Problem:
The strictly decreasing sequence of 11 positive integers (a0β,a1β,a2β,β¦,a10β) is defined by the recursive rule akβ=21βakβ1β+2 for kβ₯1. Let N be the minimum possible value of a0β. What is the sum of the digits of N?
Answer Choices:
A. 7
B. 9
C. 10
D. 11
E. 14
Solution:
The rule akβ=21βakβ1β+2 has fixed point 4 (since 21ββ
4+2=4). Subtracting 4 from both sides,
akββ4=21β(akβ1ββ4).
So if we let bkβ=akββ4, then bkβ=2bkβ1ββ, and therefore
bkβ=2kb0ββ,akβ=4+2ka0ββ4β.
- For all of a0β,β¦,a10β to be integers, we need 210=1024 to divide a0ββ4.
- For the sequence to be strictly decreasing, we need b0β>0, that is a0β>4. (If a0β=4 the sequence is constant, and if a0β<4 it increases.)
The smallest a0β with 1024β£a0ββ4 and a0β>4 is
N=4+1024=1028.
Check. The sequence is 1028,516,260,132,68,36,20,12,8,6,5, which is strictly decreasing and consists of positive integers.
The sum of the digits of N is 1+0+2+8=(D) 11.
The problems and solutions on this page are the property of the MAA's American Mathematics Competitions