Maths Olympiad Prep

Library / HMMT February /656 of 1302

HMMT February

Number theory Difficulty 5.3 AIME, harder Find the answer

Let TL=∑n=1L⌊n3/9⌋T_{L}=\sum_{n=1}^{L}\left\lfloor n^{3} / 9\right\rfloor for positive integers LL. Determine all LL for which TLT_{L} is a square number.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Since TLT_{L} is square if and only if 9TL9 T_{L} is square, we may consider 9TL9 T_{L} instead of TLT_{L}. It is well known that n3n^{3} is congruent to 0,1, or 8 modulo 9 according as nn is congruent to 0,1, or 2 modulo 3. Therefore n3−9⌊n3/9⌋n^{3}-9\left\lfloor n^{3} / 9\right\rfloor is 0,1, or 8 according as nn is congruent to 0,1, or 2 modulo 3. We find therefore that 9TL=∑1≤n≤L9⌊n39⌋=∑1≤n≤Ln3−#{1≤n≤L:n≡1( mod 3)}−8#{1≤n≤L:n≡2( mod 3)}=(12L(L+1))2−⌊L+23⌋−8⌊L+13⌋9 T_{L} =\sum_{1 \leq n \leq L} 9\left\lfloor\frac{n^{3}}{9}\right\rfloor =\sum_{1 \leq n \leq L} n^{3}-\#\{1 \leq n \leq L: n \equiv 1(\bmod 3)\}-8 \#\{1 \leq n \leq L: n \equiv 2(\bmod 3)\} =\left(\frac{1}{2} L(L+1)\right)^{2}-\left\lfloor\frac{L+2}{3}\right\rfloor-8\left\lfloor\frac{L+1}{3}\right\rfloor Clearly 9TL<(L(L+1)/2)29 T_{L}<(L(L+1) / 2)^{2} for L≥1L \geq 1. We shall prove that 9TL>(L(L+1)/2−1)29 T_{L}>(L(L+1) / 2-1)^{2} for L≥4L \geq 4, whence 9TL9 T_{L} is not square for L≥4L \geq 4. Because (L(L+1)/2−1)2=(L(L+1)/2)2−L(L+1)+1(L(L+1) / 2-1)^{2}=(L(L+1) / 2)^{2}-L(L+1)+1 we need only show that ⌊L+23⌋+8⌊L+13⌋≤L2+L−2\left\lfloor\frac{L+2}{3}\right\rfloor+8\left\lfloor\frac{L+1}{3}\right\rfloor \leq L^{2}+L-2 But the left-hand side of this is bounded above by 3L+10/33 L+10 / 3, and the inequality 3L+10/3≤L2+L−23 L+10 / 3 \leq L^{2}+L-2 means exactly L2−2L−16/3≥0L^{2}-2 L-16 / 3 \geq 0 or (L−1)2≥19/3(L-1)^{2} \geq 19 / 3, which is true for L≥4L \geq 4, as desired. Hence TLT_{L} is not square for L≥4L \geq 4. By direct computation we find T1=T2=0T_{1}=T_{2}=0 and T3=3T_{3}=3, so TLT_{L} is square only for L∈{1,2}L \in\{\mathbf{1}, \mathbf{2}\}.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.