Proof by cases · Discrete Math · Varsity Tutors

Discrete Math Quiz

20 questions · no time limit

0:00

LOGIC AND PROOF

Question 1 of 20

No time limit

Current

Answered

Flagged

Not seen

To prove "For integers

m

and

n

, if

mn

is odd, then

m^2 + n^2 \equiv 2 \pmod{4}

" using proof by cases, which case analysis correctly handles the constraint that

mn

is odd?

YOUR PROGRESS

20

QUESTIONS

Ready when you are

Answer in any order. Your progress shows here as you go.

QUESTIONS

KEYBOARD

Pick an answer ABCD

Next question ↵→

Previous ←

Flag for review F