Prove that if m and n are integers and nm is even, then m is even or n is even. What is the best approach here, direct proof, proof by contraposition, or proof by contradiction - why?

Proof by contraposition

Step-by-step explanation:

If m and n both are odd, then mn is also odd.

m and n are integers which is not divisible by 2,

Therefore,

m×n is also not divisible by 2.

Which means mn is odd.

15 units use socratic

step-by-step explanation: 15 units

g = (2, 2)

step-by-step explanation:

given the ratio is 1 : 1 then f is the midpoint of eg

let the coordinates of g = (x, y)

using the midpoint formula

(0 + x) = 1 ( multiply both sides by 2 )

0 + x = 2 ⇒ x = 2

similarly

(4 + y) = 3 ( multiply both sides by 2 )

4 + y = 6 ( subtract 4 from both sides )

y = 2

coordinates of g = (2, 2)