For any single draw,
Drawing a white marble or a gray marble are disjoint events; only one of them can happen. So
Out of 224 draws, you should expect
of the marbles to be either white or gray.
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
Because there are no parentheses, I'm assuming you're asking for how to factor this using the GCF, which can be done like so:
9−12x+6y
Factor a 3 out of this expression.
3(3 - 4x + 2y)
The expression has been simplified using the distributive property in reverse.
