Difference between revisions of "2014 AIME II Problems/Problem 15"
(→Solution) |
|||
| Line 1: | Line 1: | ||
| + | ==Problem== | ||
| + | For any integer <math>k\geq 1</math>, let <math>p(k)</math> be the smallest prime which does not divide <math>k.</math> Define the integer function <math>X(k)</math> to be the product of all primes less than <math>p(k)</math> if <math>p(k)>2</math>, and <math>X(k)=1</math> if <math>p(k)=2.</math> Let <math>\{x_n\}</math> be the sequence defined by <math>x_0=1</math>, and <math>x_{n+1}X(x_n)=x_np(x_n)</math> for <math>n\geq 0.</math> Find the smallest positive integer <math>t</math> such that <math>x_t=2090.</math> | ||
| + | |||
==Solution== | ==Solution== | ||
| − | Note that (in base 2 for the indices, base 10 for the values) <math>a_1 | + | Note that (in base 2 for the indices, base 10 for the values) <math>a_1 = 2, a_{10} = 3, a_{11} = 2 * 3 = 6, ..., a_{10010101} = 2 * 5 * 11 * 19 = 2090.</math> Thus, <math>t = 10010101</math> (base 2) = <math>\boxed{149}</math>. |
| + | |||
| + | == See also == | ||
| + | {{AIME box|year=2014|n=II|num-b=14|after=Last Problem}} | ||
| + | {{MAA Notice}} | ||
Revision as of 01:22, 21 May 2014
Problem
For any integer 
, let 
be the smallest prime which does not divide 
Define the integer function 
to be the product of all primes less than if 
, and 
if 
Let 
be the sequence defined by 
, and 
for 
Find the smallest positive integer 
such that 
Solution
Note that (in base 2 for the indices, base 10 for the values) 
Thus, 
(base 2) = 
.
See also
| 2014 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 14 |
Followed by Last Problem | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
