Any positive integer n can be written in the form n=2b(2c+1). We call 2c+1 the *odd part of* n. Given an odd integer n>0, define the sequence a0,a1,a2,… as follows: a0=2n−1, ak+1 is the odd part of 3ak+1. Find an.
Solution
An induction shows that ak=3k2n−k−1 for k≤n−1. It is certainly true for k=0. Suppose it is true for k<n−1. Then 3ak+1=3k+12n−k−2. Since n−k>1, the odd part is 3k+12n−(k+1)−1, so the result is true for k+1. That gets us as far as an−1=3n−12−1.
Now we want the odd part of 2(3n−1). Certainly 3n−1 is even. We have 3n−1≡(−1)n−1≡2(mod4) for n odd, so for n odd it is not divisible by 4. Hence for n odd we have an=23n−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: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.