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 "2021 Fall AMC 12B Problems/Problem 18"

(Adding the See Also box)
Line 5: Line 5:
 
This sequence tends to a limit; call it <math>L</math>. What is the least value of <math>k</math> such that <cmath>|u_k-L| \le \frac{1}{2^{1000}}?</cmath>
 
This sequence tends to a limit; call it <math>L</math>. What is the least value of <math>k</math> such that <cmath>|u_k-L| \le \frac{1}{2^{1000}}?</cmath>
  
−
<math>(\textbf{A})\: 10\qquad(\textbf{B}) \: 87\qquad(\textbf{C}) \: 123\qquad(\textbf{D}) \: 329\qquad(\textbf{E}) \: 401</math>
+
<math>\textbf{(A)}\: 10\qquad\textbf{(B)}\: 87\qquad\textbf{(C)}\: 123\qquad\textbf{(D)}\: 329\qquad\textbf{(E)}\: 401</math>
  
 
==Solution==
 
==Solution==
  
−
If we list out the first few values of k, we get the series <math>\frac{1}{4}, \frac{3}{8}, \frac{15}{32}, \frac{255}{512}</math>, which seem to always be a negative power of 2 away from <math>\frac{1}{2}</math>. We can test this out by setting <math>u_k</math> to <math>\frac{1}{2}-\frac{1}{2^{n_k}}</math>.  
+
If we list out the first few values of <math>k</math>, we get the series <math>\frac{1}{4}, \frac{3}{8}, \frac{15}{32}, \frac{255}{512}</math>, which seem to always be a negative power of <math>2</math> away from <math>\frac{1}{2}</math>. We can test this out by setting <math>u_k</math> to <math>\frac{1}{2}-\frac{1}{2^{n_k}}</math>.  
  
 
Now,  
 
Now,  
Line 23: Line 23:
 
We see that <math>n_k</math> seems to always be <math>1</math> above a power of <math>2</math>. We can prove this using induction.  
 
We see that <math>n_k</math> seems to always be <math>1</math> above a power of <math>2</math>. We can prove this using induction.  
  
−
Claim: <math>n_k = 2^k+1</math>
+
<u><b>Claim</b></u>
  
−
Base case: <math>n_0=2^0+1</math>
+
<math>n_k = 2^k+1</math>
  
−
Induction: <math>n_{k+1}=2 \cdot 2^k+2-1=2^{k+1}+1</math>
+
<u><b>Base case</b></u>
 +
 
 +
We have <math>n_0=2^0+1</math>, which is true.
 +
 
 +
<u><b>Induction Step</b></u>
 +
 
 +
Assuming that the claim is true, we have <math>n_{k+1}=2 \cdot 2^k+2-1=2^{k+1}+1</math>.
  
 
It follows that <math>n_{10}=2^{10}+1>1000</math>, and <math>n_9=2^9+1<1000</math>. Therefore, the least value of <math>k</math> would be <math>\boxed{\textbf{(A) }10}</math>.
 
It follows that <math>n_{10}=2^{10}+1>1000</math>, and <math>n_9=2^9+1<1000</math>. Therefore, the least value of <math>k</math> would be <math>\boxed{\textbf{(A) }10}</math>.

Revision as of 16:53, 17 March 2022

Problem

Set $u_0 = \frac{1}{4}$, and for $k \ge 0$ let $u_{k+1}$ be determined by the recurrence \[u_{k+1} = 2u_k - 2u_k^2.\]

This sequence tends to a limit; call it $L$. What is the least value of $k$ such that \[|u_k-L| \le \frac{1}{2^{1000}}?\]

$\textbf{(A)}\: 10\qquad\textbf{(B)}\: 87\qquad\textbf{(C)}\: 123\qquad\textbf{(D)}\: 329\qquad\textbf{(E)}\: 401$

Solution

If we list out the first few values of $k$, we get the series $\frac{1}{4}, \frac{3}{8}, \frac{15}{32}, \frac{255}{512}$, which seem to always be a negative power of $2$ away from $\frac{1}{2}$. We can test this out by setting $u_k$ to $\frac{1}{2}-\frac{1}{2^{n_k}}$.

Now, \begin{align*} u_{k+1} &= 2\cdot\left(\frac{1}{2}-\frac{1}{2^{n_{k}}}\right)-2\cdot\left(\frac{1}{2}-\frac{1}{2^{n_{k}}}\right)^2 \\ &= 1-\frac{1}{2^{n_k - 1}}-2\cdot\left(\frac{1}{4}-\frac{1}{2^{n_k}}+\frac{1}{2^{2 \cdot n_k}}\right)\\ &= 1-\frac{1}{2^{n_k - 1}}-\frac{1}{2}+\frac{1}{2^{n_k-1}}-\frac{1}{2^{2 \cdot n_k-1}} \\ &= \frac{1}{2}-\frac{1}{2^{2 \cdot n_k-1}} \\ \end{align*}

This means that this series approaches $\frac{1}{2}$, as the second term is decreasing. In addition, we find that $n_{k+1}=2 \cdot n_k-1$.

We see that $n_k$ seems to always be $1$ above a power of $2$. We can prove this using induction.

Claim

$n_k = 2^k+1$

Base case

We have $n_0=2^0+1$, which is true.

Induction Step

Assuming that the claim is true, we have $n_{k+1}=2 \cdot 2^k+2-1=2^{k+1}+1$.

It follows that $n_{10}=2^{10}+1>1000$, and $n_9=2^9+1<1000$. Therefore, the least value of $k$ would be $\boxed{\textbf{(A) }10}$.

-ConcaveTriangle

See Also

2021 Fall AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 17 		Followed by
Problem 19
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
All AMC 12 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=2021_Fall_AMC_12B_Problems/Problem_18&oldid=172717"