I think the answer is B. idk if im right and im sorry if im wrong
Answer:
8) answer=5 9)answer=15
Step-by-step explanation:
all you have to do is replace in the following formula
Where
X1: is the first number of the first point
Y1: is the second number of the first point
X2: is the first number of the second point
Y2: is the second number of the second point
you replace in the formula and solve
I attach solution
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
