Maths Olympiad Prep

Library / /3 of 4

Algebra Difficulty 4.8 AIME Prove it Philippines

Problem:
A sequence {an}\{a_n\} of real numbers is defined by a1=1a_1=1 and for all integers n1n \geq 1,
an+1=ann2+nn2+n+2an2 a_{n+1}=\frac{a_n \sqrt{n^2+n}}{\sqrt{n^2+n+2 a_n^2}}
Compute the sum of all positive integers n<1000n<1000 for which ana_n is a rational number.

Solution

Solution:
First, note that for k1k \geq 1,
ak+12=k(k+1)ak2k(k+1)+2ak21ak+121ak2=2k(k+1)=2k2k+1 a_{k+1}^2=\frac{k(k+1) a_k^2}{k(k+1)+2 a_k^2} \Longleftrightarrow \frac{1}{a_{k+1}^2}-\frac{1}{a_k^2}=\frac{2}{k(k+1)}=\frac{2}{k}-\frac{2}{k+1}
and summing the second equation from k=1k=1 to k=n1k=n-1 with n2n \geq 2, we get
1an21a12=k=1n1(1ak+121ak2)=k=1n1(2k2k+1)=22n \frac{1}{a_n^2}-\frac{1}{a_1^2}=\sum_{k=1}^{n-1}\left(\frac{1}{a_{k+1}^2}-\frac{1}{a_k^2}\right)=\sum_{k=1}^{n-1}\left(\frac{2}{k}-\frac{2}{k+1}\right)=2-\frac{2}{n}
Since a1=1a_1=1, we see that
1an2=32nan=n3n2 \frac{1}{a_n^2}=3-\frac{2}{n} \Longleftrightarrow a_n=\sqrt{\frac{n}{3 n-2}}
for all integers n1n \geq 1 and we wish to find the sum of all positive integers n<1000n<1000 such that n3n2\frac{n}{3 n-2} is a square of some rational number. To help us look for such integers nn, we use the following lemma that provides integer solutions to the generalized Pell equation.

Lemma. 1{ }^{1} Let dd be a squarefree positive integer, and let aa and bb be positive integers such that a2db2=1a^2-d b^2=1. Set u=a+bdu=a+b \sqrt{d}. Then for each nonzero integer nn, every solution of x2dy2=nx^2-d y^2=n is a power of uu times x+ydx+y \sqrt{d} where (x,y)(x, y) is an integer solution of x2dy2=nx^2-d y^2=n with xn(u+1)/2|x| \leq \sqrt{|n|}(\sqrt{u}+1) / 2 and yn(u+1)/(2d)|y| \leq \sqrt{|n|}(\sqrt{u}+1) /(2 \sqrt{d}).

We now let g=gcd(n,3n2)g=\operatorname{gcd}(n, 3 n-2). Then g{1,2}g \in\{1,2\} since g3n(3n2)=2g \mid 3 n-(3 n-2)=2. We now consider the following cases:

- Suppose g=1g=1. Then n=y2n=y^2 and 3n2=x23 n-2=x^2 for some relatively prime positive integers xx and yy. This leads us to the generalized Pell equation x23y2=2x^2-3 y^2=-2. Set u=2+3u=2+\sqrt{3}, with (2,1)(2,1) being a solution of x23y2=1x^2-3 y^2=1 in positive integers. We now look for the positive integer solutions (x,y)(x, y) of x23y2=2x^2-3 y^2=-2 with x2(u+1)/22.07x \leq \sqrt{2}(\sqrt{u}+1) / 2 \approx 2.07 and y2(u+1)/(23)1.2y \leq \sqrt{2}(\sqrt{u}+1) /(2 \sqrt{3}) \approx 1.2. We obtain (x,y)=(1,1)(x, y)=(1,1) as the only such integer solution, so by the above lemma, we see that all positive integer solutions (xk,yk)\left(x_k, y_k\right) of x23y2=2x^2-3 y^2=-2 are given by xk+yk3=(1+3)(2+3)kx_k+y_k \sqrt{3}=(1+\sqrt{3})(2+\sqrt{3})^k for all integers k0k \geq 0. We now compute this product for small values of kk :

kk0123
xk+yk3x_k+y_k \sqrt{3}1+31+\sqrt{3}5+335+3 \sqrt{3}19+11319+11 \sqrt{3}71+41371+41 \sqrt{3}

As n<1000n<1000, we require that yk31y_k \leq 31, so the positive integer solutions (xk,yk)\left(x_k, y_k\right) of x23y2=x^2-3 y^2= -2 with yk31y_k \leq 31 are (xk,yk)=(1,1),(5,3),(19,11)\left(x_k, y_k\right)=(1,1),(5,3),(19,11) (which indeed have relatively prime coordinates). These correspond to the values of n:n=1,9,121n: n=1,9,121.

- Suppose g=2g=2. Then n=2y2n=2 y^2 and 3n2=2x23 n-2=2 x^2 for some relatively prime positive integers xx and yy. This leads us to the generalized Pell equation x23y2=1x^2-3 y^2=-1. Again, we set u=2+3u=2+\sqrt{3}. We now look for the positive integer solutions (x,y)(x, y) of x23y2=1x^2-3 y^2=-1 with x(u+1)/21.47x \leq(\sqrt{u}+1) / 2 \approx 1.47 and y(u+1)/(23)0.85y \leq(\sqrt{u}+1) /(2 \sqrt{3}) \approx 0.85. It turns out that there are no such solutions on these bounds, so by the above lemma, we conclude that x23y2=1x^2-3 y^2=-1 has no solutions in positive integers.

Hence, the only positive integers n<1000n<1000 for which ana_n is a rational number are n=1,9,121n=1,9,121 and the sum is 1+9+121=1311+9+121=131.

[^0]: 1{ }^{1} For proof, see Theorem 3.3 from https://kconrad.math.uconn.edu/blurbs/ugradnumthy/pelleqn2.pdf.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.