Maths Olympiad Prep

Library / /5 of 6

Algebra Difficulty 6.2 National olympiad Prove it Brazil

Any positive integer nn can be written in the form n=2b(2c+1)n = 2^b(2c + 1). We call 2c+12c + 1 the *odd part of* nn. Given an odd integer n>0n > 0, define the sequence a0,a1,a2,a_0, a_1, a_2, \ldots as follows: a0=2n1a_0 = 2^n - 1, ak+1a_{k+1} is the odd part of 3ak+13a_k + 1. Find ana_n.

Solution

An induction shows that ak=3k2nk1a_k = 3^k 2^{n-k} - 1 for kn1k \le n-1. It is certainly true for k=0k=0. Suppose it is true for k<n1k < n-1. Then 3ak+1=3k+12nk23a_k + 1 = 3^{k+1} 2^{n-k} - 2. Since nk>1n-k > 1, the odd part is 3k+12n(k+1)13^{k+1} 2^{n-(k+1)} - 1, so the result is true for k+1k+1. That gets us as far as an1=3n121a_{n-1} = 3^{n-1} 2 - 1.

Now we want the odd part of 2(3n1)2(3^n - 1). Certainly 3n13^n - 1 is even. We have 3n1(1)n12(mod4)3^n - 1 \equiv (-1)^n - 1 \equiv 2 \pmod 4 for nn odd, so for nn odd it is not divisible by 4. Hence for nn odd we have an=3n12a_n = \frac{3^{n-1}}{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 and solution reproduced as published; topic and difficulty added by this site.