Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2014 AIME II Problems/Problem 15"

(→‎Solution)
(→‎Solution)
Line 3: Line 3:
  
 
==Solution==
 
==Solution==
−
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, \cdots, a_{10010101} = 2 \cdot 5 \cdot 11 \cdot 19 = 2090.</math> Thus, <math>t = 10010101</math> (base 2) = <math>\boxed{149}</math>.
+
Note that for any <math>x_i</math>, for any prime <math>p</math>, <math>p^2 \nmid x_i</math>.  This provides motivation to translate <math>x_i</math> into a binary sequence <math>y_i</math>.  
  
−
Could someone provide a little more detail? This solution doesn't explain how it got to the answer very well.
+
Let the prime factorization of <math>x_i</math> be written as <math>p_a_1 \cdot p_a_2 \cdot p_a_3 \cdots</math>, where <math>p_i</math> is the <math>i</math>th prime number. Then, for every <math>p_a_k</math> in the prime factorization of <math>x_i</math>, place a <math>1</math> in the <math>a_k</math>th digit of <math></math>y_i. This will result in the conversion <math>x_1 = 2, x_{2} = 3, x_{3} = 2 * 3 = 6, \cdots</math>.
 +
 
 +
Multiplication for the sequence <math>x_i</math> will translate to addition for the sequence <math>y_i</math>. Thus, we see that <math>x_{n+1}X(x_n) = x_np(x_n)</math> translates into <math>y_{n+1} = y_n+1</math>. Since <math>x_0=1, and y_0=0</math>, <math>x_i</math> corresponds to <math>y_i</math>, which is <math>i</math> in binary. Since <math>x_{10010101} = 2 \cdot 5 \cdot 11 \cdot 19 = 2090, </math>t = 10010101<math> (base 2) = </math>\boxed{149}$.
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=2014|n=II|num-b=14|after=Last Problem}}
 
{{AIME box|year=2014|n=II|num-b=14|after=Last Problem}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 22:03, 10 January 2016

Problem

For any integer $k\geq 1$, let $p(k)$ be the smallest prime which does not divide $k.$ Define the integer function $X(k)$ to be the product of all primes less than $p(k)$ if $p(k)>2$, and $X(k)=1$ if $p(k)=2.$ Let $\{x_n\}$ be the sequence defined by $x_0=1$, and $x_{n+1}X(x_n)=x_np(x_n)$ for $n\geq 0.$ Find the smallest positive integer $t$ such that $x_t=2090.$

Solution

Note that for any $x_i$, for any prime $p$, $p^2 \nmid x_i$. This provides motivation to translate $x_i$ into a binary sequence $y_i$.

Let the prime factorization of $x_i$ be written as $p_a_1 \cdot p_a_2 \cdot p_a_3 \cdots$ (Error compiling LaTeX. Unknown error_msg), where $p_i$ is the $i$th prime number. Then, for every $p_a_k$ (Error compiling LaTeX. Unknown error_msg) in the prime factorization of $x_i$, place a $1$ in the $a_k$th digit of $$ (Error compiling LaTeX. Unknown error_msg)y_i. This will result in the conversion $x_1 = 2, x_{2} = 3, x_{3} = 2 * 3 = 6, \cdots$.

Multiplication for the sequence $x_i$ will translate to addition for the sequence $y_i$. Thus, we see that $x_{n+1}X(x_n) = x_np(x_n)$ translates into $y_{n+1} = y_n+1$. Since $x_0=1, and y_0=0$, $x_i$ corresponds to $y_i$, which is $i$ in binary. Since $x_{10010101} = 2 \cdot 5 \cdot 11 \cdot 19 = 2090,$t = 10010101$(base 2) =$\boxed{149}$.

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2014_AIME_II_Problems/Problem_15&oldid=74481"