MathLabs

Problem 5

Let nn be a positive integer. A pair of nn-tuples (a1,…,an)(a_1,\ldots,a_n) and (b1,…,bn)(b_1,\ldots,b_n) with integer entries is called an exquisite pair if ∣a1b1+⋯+anbn∣≤1|a_1b_1+\cdots+a_nb_n|\le1. Determine the maximum number of distinct nn-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
A=A1∪⋯∪An,Ai={tuples whose last nonzero entry is at position i},∣Ai∣≤2iA=A_1\cup\cdots\cup A_n,\quad A_i=\{\text{tuples whose last nonzero entry is at position } i\},\quad |A_i|\le2i
Detailed analysis

Let AA be a set of nonzero tuples among which any two are exquisite. Write A=A1∪A2∪⋯∪AnA=A_1\cup A_2\cup\cdots\cup A_n, where AiA_i is the set of tuples in AA whose last nonzero entry appears in position ii. It suffices to show ∣Ai∣≤2i|A_i|\le2i for every ii, since 2+4+⋯+2n=n2+n2+4+\cdots+2n=n^2+n, so together with the zero tuple this bounds ∣A∣+1≤n2+n+1|A|+1\le n^2+n+1.