Problem 5
Let be a positive integer. A pair of -tuples and with integer entries is called an exquisite pair if . Determine the maximum number of distinct -tuples with integer entries such that any two of them form an exquisite pair.
Step 4 of 5: Split any exquisite family by last nonzero position
Detailed analysis
Let be a set of nonzero tuples among which any two are exquisite. Write , where is the set of tuples in whose last nonzero entry appears in position . It suffices to show for every , since , so together with the zero tuple this bounds .