Theorem: the sum of any two even integers equals 4k for some integer k. "proof: suppose m and n are any two even integers. by definition of even, m = 2k for some integer k and n = 2k for some integer k. by substitution, m + n = 2k + 2k = 4k. this is what was to be shown." what's the mistakes in this proof?

Remark

The proof is only true if m and n are equal. Make it more general.

m = 2k

n = 2v

m + n = 2k + 2v = 2(k + v).

k and v can be equal but many times they are not. From that simple equation you cannot do anything for sure but divide by 2.

There are 4 combinations

m is divisible by 4 and n is not. The result will not be divisible by 4.

m is not divisible by 4 but n is. The result will not be divisible by 4.

But are divisible by 4 then the sum will be as well. Here's the really odd result

If both are even and not divisible by 4 then their sum is divisible by 4

you answer is a

step-by-step explanation:

a) y = -3x +2

b) y = 1/2x -6

these 2 can be combined into one equation.

-3x +2 = .5x -6

8 = 3.5x

x = 8 / 3.5 = 2.2857142857

y = -3 * (8 / 3.5) +2

y = (-24 / 3.5) + 2

y = -4.8571428571

step-by-step explanation: