1989 AJHSME Problems/Problem 22
From AoPSWiki
Problem
The letters 
, 
, 
, 
, 
, 
and the digits 
, 
, 
, are "cycled" separately as follows and put together in a numbered list:
![\begin{tabular}[t]{lccc} & & AJHSME & 1989 \\ & & & \\1. & & JHSMEA & 9891 \\2. & &am...](http://alt2.artofproblemsolving.com/Forum/latexrender/pictures/c/3/4/c34d19a025446a5f32f797f3676ff11f60cbb042.gif)
What is the number of the line on which 
will appear for the first time?
Solution
Every 
line has 
as part of it and every 
line has 
as part of it. In order for both to be part of line 
, must be a multiple of 
and 
, the least of which is 
.
See Also
| 1989 AJHSME (Problems • Resources) | ||
| Preceded by Problem 21 | Followed by Problem 23 | |
| 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 | ||
