Problem:
Let a1β,a2β,β¦ be a sequence of integers determined by the rule anβ=anβ1β/2 if anβ1β is even and anβ=3anβ1β+1 if anβ1β is odd. For how many positive integers a1ββ€2008 is it true that a1β is less than each of a2β,a3β, and a4β?
Answer Choices:
A. 250
B. 251
C. 501
D. 502
E. 1004
Solution:
If a1β is even, then a2β=(a1β/2)<a1β, so the required condition is not met. If a1ββ‘1(mod4), then a2β=3a1β+1 is a multiple of 4 , so a3β= (3a1β+1)/2, and a4β=(3a1β+1)/4β€a1β. Hence the required condition is also not met in this case. If a1ββ‘3(mod4), then a2β is even but not a multiple of 4 . It follows that a3β=(3a1β+1)/2>a1β, and a3β is odd, so a4β=3a3β+1>a3β>a1β. Because 2008 is a multiple of 4 , a total of 42008β=502β possible values of a1β are congruent to 3(mod4). These 502 values of a1β meet the required condition.
Note: It is a famous unsolved problem to show whether or not the number 1 must be a term of this sequence for every choice of a1β.
The problems on this page are the property of the MAA's American Mathematics Competitions