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
Answer:
112
Step-by-step explanation:
To find the least common multiple, we break the numbers down into prime factors
7 = 7
14 = 7*2
16 = 2*8 = 2*4*2 = 2*2*2*2
Then we take the largest number of times it appears in all the numbers
2 appears 4 times so we take take four 2's
7 appears 1 so we take one 7
LCM = 2*2*2*2*7
LCM = 112
Answer:
$1.00
Step-by-step explanation:
Answer:
i think light blue
Step-by-step explanation:
that or dark blue but you have to graph the answer to find where it lands.
