Maths Olympiad Prep

Library / /161 of 520

Number theory Difficulty 6.1 National olympiad Prove it

Show that there are infinitely many solutions in positive integers to 2a23a+1=3b2+b2 a^{2}-3 a+1=3 b^{2}+b.

The translation is already in English, so no changes were made.

Solution

Put A=a1\mathrm{A}=\mathrm{a}-1 and the equation becomes A(2 A+1)=b(3 b+1)\mathrm{A}(2 \mathrm{~A}+1)=\mathrm{b}(3 \mathrm{~b}+1). Let d\mathrm{d} be the greatest common divisor of A and bb. Put A=dx,b=dyA=d x, b=d y. Then x(2dx+1)=y(3dy+1)x(2 d x+1)=y(3 d y+1). Since xx and yy are coprime, x\mathrm{x} must divide 3dy+13 \mathrm{dy}+1. So put 3dy+1=nx3 \mathrm{dy}+1=\mathrm{nx}. Then 2dx+1=ny2 \mathrm{dx}+1=\mathrm{ny}. Solving for x\mathrm{x} and y\mathrm{y} in terms of nn and dd we get x=(n+3d)/(n26d2),y=(n+2d)/(n26d2)x=(n+3 d) /\left(n^{2}-6 d^{2}\right), y=(n+2 d) /\left(n^{2}-6 d^{2}\right).

So we would certainly be home if we could show that there were infinitely many solutions to n26 d2=1\mathrm{n}^{2}-6 \mathrm{~d}^{2}=1. It is not hard to find the first few: 126.02=1,52622=1,4926202=11^{2}-6.0^{2}=1,5^{2}-6 \cdot 2^{2}=1,49^{2}-6 \cdot 20^{2}=1. We notice that 492=2.52149^{2}=2.5^{2}-1, so we wonder whether n=2.4921\mathrm{n}=2.49^{2}-1 might be another solution and indeed we find it gives d=1960=249.20d=1960=2 \cdot 49.20. This suggests we try (2n21)26(2nd)2=4n4\left(2 n^{2}-1\right)^{2}-6(2 n d)^{2}=4 n^{4}- 4n2+124n2d2=4n2(n26d21)+1=14 n^{2}+1-24 n^{2} d^{2}=4 n^{2}\left(n^{2}-6 d^{2}-1\right)+1=1. So there are indeed infinitely many solutions to n2n^{2} 6 d2=1-6 \mathrm{~d}^{2}=1 and we are done.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.