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:
a = -1.58
Step-by-step explanation:
1/3 +a+5/4 =0
1/3+5/4= -a
4+15/12 = -a
19/12 = -a
1.58= -a
1.58/-1 = -a/-1
-1.58 = a
Answer: Obviously shrek.
Step-by-step explanation: His massive hands would crush will
Answer: No es posible (It is not possible)
Step-by-step explanation:
The question in english is as follows:
Is it possible to draw 9 line segments so that each segment crosses exactly 1 of the other segments?
A necessary condition for two lines to intersect is that they must be in the same plane (they must be coplanar), being their intersection a single point.
Now, if we want several lines to intersect only once, we need to have an <u>even number</u> of line segments. However, this is not the case because <u>9 is odd.
</u>
Therefore, it is not possible.
Answer:
10 units
Step-by-step explanation:
Kebause i took the test nerds lol