Problem:
How many ordered triples (x,y,z) of distinct nonnegative integers β€8 satisfy xy>z, zx>y, and yz>x?
Answer Choices:
A. 36
B. 84
C. 186
D. 336
E. 486
Solution:
Without loss of generality, assume x<y<z. Now we count the complement, that is how many triples result in xyβ€z or xzβ€y or yzβ€x. yzβ€x is impossible and xzβ€y only holds if x=0, which would imply xyβ€z anyways. Therefore, it suffices to compute the number of triples where xy<z.
Case 1: x=0. There are (28β)=28 possibilities for y and z.
Case 2: x=1. If x=1, for some given y then, zβ{y+1,y+2,β¦,y+8} all result in xy<z. There are 8βy options in the set, so summing across all y gives:
y=2β7β8βy=21
Case 3: x=2. We see that y=3, zβ₯6 and y=4, z=8 work for 4 possibilities.
Case 4: xβ₯3. If xβ₯3, then we are guaranteed xy>z. This gives 0 possibilities.
There are (39β) ways to pick x, y, and z in increasing order for a total of 6(84β28β21β4)=(C) 186β ordered triples.
The problems on this page are the property of the MAA's American Mathematics Competitions