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 "2008 AMC 10B Problems/Problem 11"

(→‎Solution)
m (→‎Solution)
 
(12 intermediate revisions by 8 users not shown)
Line 1: Line 1:
 
==Problem==
 
==Problem==
−
Postman Pete has a pedometer to count his steps. The pedometer records up to 99999 steps, then flips over to 00000 on the next step. Pete plans to determine his mileae for a year. On January 1 Pete sets the pedometer to 00000. During the year, the pedometer flips from 99999 to 00000 forty-four
+
Suppose that <math>(u_n)</math> is a [[sequence]] of real numbers satifying <math>u_{n+2}=2u_{n+1}+u_n</math>,
−
times. On December 31 the pedometer reads 50000. Pete takes 1800 steps per mile. Which of the following is closest to the number of miles Pete walked during the year?
 
−
 
 
−
(A) 2500 (B) 3000 (C) 3500 (D) 4000 (E) 4500
 
−
 
 
−
==Problem==
 
−
{{Suppose that <math>(u_n)</math> is a serquence of real numbers satifying <math>u_{n+2}=2u_{n+1}+u_n</math>,
 
  
 
and that <math>u_3=9</math> and <math>u_6=128</math>. What is <math>u_5</math>?
 
and that <math>u_3=9</math> and <math>u_6=128</math>. What is <math>u_5</math>?
  
−
(A) 40 (B) 53 (C) 68 (D) 88 (E) 104}}
+
<math>\mathrm{(A)}\ 40\qquad\mathrm{(B)}\ 53\qquad\mathrm{(C)}\ 68\qquad\mathrm{(D)}\ 88\qquad\mathrm{(E)}\ 104</math>
  
 
==Solution==
 
==Solution==
−
{{We konw that <math>u_6=128</math>, so we plug in <math>n=4</math> to get <math>128=2u_5+u_4</math>. We plug in <math>n=3</math> to get
+
If we plug in <math>n=4</math>, we get  
−
 
 
−
<math>u_5=2u_4+9</math>. Substituting gives
 
  
−
<math>128=5u_4+18 \rightarrow u_4=22</math>
+
<center><math>128=2u_5+u_4.</math></center>  
  
−
This gives <math>u_5=\frac{128-22}{2}=53</math>.
+
By plugging in <math>n=3</math>, we get
  
−
Answer B is the correct answer
+
<center><math>u_5=2u_4+9.</math></center>
  
−
NOTE: This is my (BOGTRO) solution, not the official one,
+
This is a system of two equations with two unknowns. Multiplying the second equation by 2 and substituting into the first equation gives <math>128=5u_4+18 \Longrightarrow u_4=22</math>, therefore <math>u_5=\frac{128-22}{2}=53 \longrightarrow \textbf{\boxed{(B)}}</math>.
−
 
+
~ Mathkiddie
−
and should be ignored in view of a better solution.}}
 
  
 
==See also==
 
==See also==
−
{{AMC10 box|year=2008|ab=B|num-b=9|num-a=11}}
+
{{AMC10 box|year=2008|ab=B|num-b=10|num-a=12}}
  
−
==See also==
+
[[Category:Introductory Algebra Problems]]
−
{{AMC10 box|year=2008|ab=B|num-b=10|num-a=12}}
+
{{MAA Notice}}

Latest revision as of 19:42, 24 October 2022

Problem

Suppose that $(u_n)$ is a sequence of real numbers satifying $u_{n+2}=2u_{n+1}+u_n$,

and that $u_3=9$ and $u_6=128$. What is $u_5$?

$\mathrm{(A)}\ 40\qquad\mathrm{(B)}\ 53\qquad\mathrm{(C)}\ 68\qquad\mathrm{(D)}\ 88\qquad\mathrm{(E)}\ 104$

Solution

If we plug in $n=4$, we get

$128=2u_5+u_4.$

By plugging in $n=3$, we get

$u_5=2u_4+9.$

This is a system of two equations with two unknowns. Multiplying the second equation by 2 and substituting into the first equation gives $128=5u_4+18 \Longrightarrow u_4=22$, therefore $u_5=\frac{128-22}{2}=53 \longrightarrow \textbf{\boxed{(B)}}$. ~ Mathkiddie

See also

2008 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 10 		Followed by
Problem 12
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 10 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=2008_AMC_10B_Problems/Problem_11&oldid=179450"