Which of the following conditions is sufficient to guarantee that integers , , and satisfy the equation
- A)
x>yy=z
- B)
x=y-1y=z-1
- C)
x=z+1y=x+1
- D)
x=zy-1=x
- E)
Answer
D
Key insight
The left side equals half the sum (x-y)^2 + (y-z)^2 + (z-x)^2, which is 1 exactly when two of the integers are equal and the third differs by 1.
Solution
Expand the left side: . Doubling it gives
So the equation says . Three squares of integers summing to must be in some order: two of the numbers are equal and the third is exactly away from them.
Check the choices against this description.
- (A) : the differences are , giving , which is only if . Not guaranteed.
- (B) consecutive (): squares , total . Fails.
- (C) consecutive: total again. Fails.
- (D) and : squares , total . Always works.
- (E) : for example works but gives . Fails.
The answer is .
Why this works
The expression appears constantly (it is the second factor in ), and its half-sum-of-squares form makes its sign and size transparent. Turning "" into a statement about differences reduces a symbolic question to a finite check.
Alternative approach
Plug numbers into each condition, but use two different triples per condition. For (A), gives but gives , so (A) is not sufficient. Only (D) survives such double-checking, since , gives for every .
The trap
Testing one convenient triple for a condition (such as x = 2, y = z = 1 for choice A), seeing it work, and calling the condition sufficient.
Common mistakes
- Testing one convenient triple for a condition (such as x = 2, y = z = 1 for choice A), seeing it work, and calling the condition sufficient.
- Misreading (B) or (C) as "two equal, third adjacent"; both describe three consecutive integers, which give , not .
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Test small/specific values or special cases to find or verify the answer