$67.82 if you pay it on time.
$90.43 if you pay it late.
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:
24 i think
Step-by-step explanation:
I evaluated using he given value
X=4
You have to distribute the negative sign for everything in the parentheses. After that you add x to the other side then add 8 to the opposite side to move them. Then your answer is 4.
