1987 AHSME Problems/Problem 29

Revision as of 15:34, 20 January 2018 by Sturdyoak2012 (talk | contribs) (Problem)

Problem

Consider the sequence of numbers defined recursively by $t_1=1$ and for $n>1$ by $t_n=1+t_{(n/2)}$ when $n$ is even and by $t_n=\frac{1}{t_{(n-1)}}$ when $n$ is odd. Given that $t_n=\frac{19}{87}$, the sum of the digits of $n$ is

$\textbf{(A)}\ 15 \qquad \textbf{(B)}\ 17 \qquad \textbf{(C)}\ 19 \qquad \textbf{(D)}\ 21 \qquad \textbf{(E)}\ 23$


Solution

$(A)$

See also

1987 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 28
Followed by
Problem 30
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png