Maths Olympiad Prep

Library / /6 of 30

, 2023

Algebra Difficulty 7.8 National olympiad, round 2 Prove it Saudi Arabia

Prove that for every n1n \ge 1, then v3(un)=v3(n)v_3(u_n) = v_3(n), where (un)(u_n) is the sequence with u0=0u_0 = 0, u1=1u_1 = 1 and
un+2=2un+1+2un,n0. u_{n+2} = 2u_{n+1} + 2u_n, \forall n \ge 0.

Solution

We have the general formula of the given sequence as
un=(1+3)n(13)n23. u_n = \frac{(1 + \sqrt{3})^n - (1 - \sqrt{3})^n}{2\sqrt{3}}.
Considering the periodicity of the remainder when divided by 33 of the given sequence, we have 0,1,2,0,1,2,0, 1, 2, 0, 1, 2, \ldots So obviously u3k+1u_{3k+1} and u3k+2u_{3k+2} are not divisible by 33, and then v3(u3k+1)=v3(u3k+2)=0v_3(u_{3k+1}) = v_3(u_{3k+2}) = 0.

Next, consider n=3kn = 3k with kZ+k \in \mathbb{Z}^+. We have
u3k=(1+3)3k(13)3k23=[(1+3)k(13)k][(4+23)k+(423)k+(2)k]23=uk[(4+23)k+(423)k+(2)k]. \begin{aligned} u_{3k} &= \frac{(1 + \sqrt{3})^{3k} - (1 - \sqrt{3})^{3k}}{2\sqrt{3}} \\&= \frac{[(1 + \sqrt{3})^k - (1 - \sqrt{3})^k][(4 + 2\sqrt{3})^k + (4 - 2\sqrt{3})^k + (-2)^k]}{2\sqrt{3}} \\&= u_k[(4 + 2\sqrt{3})^k + (4 - 2\sqrt{3})^k + (-2)^k].\end{aligned}

Put ak=(4+23)k+(423)k+(2)ka_k = (4 + 2\sqrt{3})^k + (4 - 2\sqrt{3})^k + (-2)^k then it is easy to check that a0=3a_0 = 3, a1=6a_1 = 6, a2=60a_2 = 60 and
an+3=6an+2+12an+18an,n0. a_{n+3} = 6a_{n+2} + 12a_{n+1} - 8a_n, \forall n \ge 0.
Notice that a0,a1,a2a_0, a_1, a_2 are all divisible by 33 so 3an3|a_n for all nn. Thus 96an+2+12an+19|6a_{n+2}+12a_{n+1} and followed by an+38anan(mod9)a_{n+3} \equiv -8a_n \equiv a_n \pmod 9. On the other hand, the first three terms of the sequence are not divisible by 99, so the same applies to all terms of the sequence. From that we have v3(an)=1v_3(a_n) = 1 for all nn. So
v3(u3k)=v3(uk)+v3(ak)=1+v3(uk). v_3(u_{3k}) = v_3(u_k) + v_3(a_k) = 1 + v_3(u_k).
From here it is easy to see that if we put n=3tmn = 3^t m with gcd(m,3)=1\gcd(m, 3) = 1 and tZ+t \in \mathbb{Z}^+ then
v3(un)=v3(u3t1m)+1==v3(um)+t=t. v_3(u_n) = v_3(u_{3^{t-1}m}) + 1 = \cdots = v_3(u_m) + t = t.

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 and solution reproduced as published; topic and difficulty added by this site.