Maths Olympiad Prep

Library / /34 of 69

, 2011

Number theory Difficulty 5.2 AIME, harder Prove it South Africa

If nNn \in \mathbb{N} and 3n+13n+1 and 4n+14n+1 are perfect squares, show that 56n56|n.

Solution

Let 3n+1=x23n + 1 = x^2 and 4n+1=y24n + 1 = y^2. Then y2x2=ny^2 - x^2 = n. As yy is odd, y281y^2 \equiv_8 1, so nn has to be even, therefore xx is odd, and therefore y2x2811=0y^2 - x^2 \equiv_8 1 - 1 = 0, hence 8n8|n.

Now notice that 4x23y2=14x^2 - 3y^2 = 1, so setting w=2xw = 2x we obtain Pell's equation w23y2=1w^2 - 3y^2 = 1. This has solutions (2+3)m=wm+3ym(2 + \sqrt{3})^m = w_m + \sqrt{3}y_m, but only the odd mm solutions correspond to an even wmw_m. Starting with the base solution 2+32 + \sqrt{3}, and multiplying through by (2+3)2(2 + \sqrt{3})^2 we get the recursions
wm+1=2xm+1=14xm+12ym,andym+1=8xm+7ym. w_{m+1} = 2x_{m+1} = 14x_m + 12y_m, \quad \text{and} \quad y_{m+1} = 8x_m + 7y_m.
Then xm+1=7xm+6ym7ymx_{m+1} = 7x_m + 6y_m \equiv_7 -y_m, and ym+1=8xm+7ym7xmy_{m+1} = 8x_m + 7y_m \equiv_7 x_m, hence ym+12xm+127xm2ym2y_{m+1}^2 - x_{m+1}^2 \equiv_7 x_m^2 - y_m^2, and by induction, xm2ym270x_m^2 - y_m^2 \equiv_7 0. Hence 7 divides n=ym2xm2n = y_m^2 - x_m^2.

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.