Maths Olympiad Prep

Library / /301 of 520

Number theory Difficulty 6.6 National olympiad Prove it

Show that if (2+3)k=1+m+n3(2+\sqrt{3})^{k}=1+m+n \sqrt{3}, for positive integers m,n,km, n, k with kk odd, then mm is a perfect square.

Solution

We have (2+3)4=97+563=14(7+43)1=14(2+3)21(2+\sqrt{3})^{4}=97+56 \sqrt{3}=14(7+4 \sqrt{3})-1=14(2+\sqrt{3})^{2}-1. Hence (2+3)k+2=14(2+3)k(2+3)k2(2+\sqrt{3})^{k+2}=14 (2+\sqrt{3})^{k}-(2+\sqrt{3})^{k-2}. Thus if (2+3)k=ak+bk3(2+\sqrt{3})^{k}=a_{k}+b_{k} \sqrt{3}, then ak+2=14akak2a_{k+2}=14 a_{k}-a_{k-2}.

Now suppose the sequence ckc_{k} satisfies c1=1,c2=5,ck+1=4ckck1c_{1}=1, c_{2}=5, c_{k+1}=4 c_{k}-c_{k-1}. We claim that ck2ck1ck+1=6c_{k}^{2}-c_{k-1} c_{k+1}=6. Induction on kk. We have c3=19c_{3}=19, so c22c1c3=2519=6c_{2}^{2}-c_{1} c_{3}=25-19=6. Thus the result is true for k=2k=2. Suppose it is true for kk. Then ck+1=4ckck1c_{k+1}=4 c_{k}-c_{k-1}, so ck+12=4ckck+1ck1ck+1=4ckck+1ck2+6=ck(4ck+1ck)+6=ckck+2+6c_{k+1}^{2}=4 c_{k} c_{k+1}-c_{k-1} c_{k+1}=4 c_{k} c_{k+1} -c_{k}^{2}+6=c_{k}(4 c_{k+1}-c_{k})+6=c_{k} c_{k+2}+6, so the result is true for k+1k+1.

Now put dk=ck2+1d_{k}=c_{k}^{2}+1. We show that dk+2=14dk+1dkd_{k+2}=14 d_{k+1}-d_{k}. Induction on kk. We have d1=2,d2=26,d3=362=14d2d1d_{1}=2, d_{2}= 26, d_{3}=362=14 d_{2}-d_{1}, so the result is true for k=1k=1. Suppose it is true for kk. We have ck+34ck+2+ck+1=0c_{k+3}- 4 c_{k+2}+c_{k+1}=0. Hence 12+2ck+3ck+18ck+2ck+1+2ck+12=1212+2 c_{k+3} c_{k+1}-8 c_{k+2} c_{k+1}+2 c_{k+1}^{2}=12. Hence 2ck+228ck+2ck+1+2ck+12=122 c_{k+2}^{2}-8 c_{k+2} c_{k+1}+2 c_{k+1}^{2}=12. Hence 16ck+228ck+2ck+1+ck+12+1=14ck+22+14ck+12116 c_{k+2}^{2}-8 c_{k+2} c_{k+1}+c_{k+1}^{2}+1=14 c_{k+2}^{2}+14-c_{k+1}^{2}-1, or (4ck+2ck+1)2+1=14(ck+22+1)(ck+12+1)(4 c_{k+2}-c_{k+1})^{2}+ 1=14(c_{k+2}^{2}+1)-(c_{k+1}^{2}+1), or ck+32+1=14(ck+22+1)(ck+12+1)c_{k+3}^{2}+1=14(c_{k+2}^{2}+1)-(c_{k+1}^{2}+1), or dk+3=14dk+2dk+1d_{k+3}=14 d_{k+2}-d_{k+1}. So the result is true for all kk.

But a1=2,a3=26a_{1}=2, a_{3}=26 and a2k+3=14a2k+1a2k1a_{2k+3}=14 a_{2k+1}-a_{2k-1}, and d1=2,d2=26d_{1}=2, d_{2}=26 and dk+1=14dkdk1d_{k+1}=14 d_{k}-d_{k-1}. Hence a2k1=dk=ck2+1a_{2k-1}=d_{k}=c_{k}^{2}+1.

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.