Consider all integer solutions to the following equation:
What is the greatest even integer in powers of 2 that must divide ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First,notice that one of the triples ( x , y , z ) = ( 5 , 6 , 2 ) ,so we can cross out 8 , 1 6 , 3 2
We will show that x y z needs to be a multiple of 4.
Proof by contradiction. Suppose x y z is not a multiple of 4, and satisfies the equation.
The only ways that x y z is a multiple of 4 are:
Case 1: x , y , z are all odd numbers.
Then ( x − 1 ) ( y − 1 ) ( z + 1 ) is a multiple of 8, so we have a contradiction.
Case 2: One of x , y , z is even (but not a multiple of 4) and the others are odd.
Then ( x − 1 ) ( y − 1 ) ( z + 1 ) must be a multiple of 4, which is a contradiction.
So, x y z must be a multiple of 4.