Solve Year 8 AMC Question: Find the Highest Number

  • Context: High School 
  • Thread starter Thread starter asdfghjklqqww
  • Start date Start date
  • Tags Tags
    Hard
Click For Summary
SUMMARY

The Year Eight AMC question requires finding the highest number in a sequence defined by the relation that each number is one more than the average of its neighbors. The correct sequence is derived from the recurrence relation a_n = -n^2 + 14n - 12, with the first number as 1 and the last as 12. The highest number in this sequence is definitively 37, as calculated from the values a_0 through a_11.

PREREQUISITES
  • Understanding of recurrence relations
  • Basic algebra for solving quadratic equations
  • Familiarity with sequences and series
  • Knowledge of the Australian Maths Competition format
NEXT STEPS
  • Study recurrence relations in depth
  • Learn how to derive sequences from given conditions
  • Practice solving quadratic equations
  • Explore problem-solving strategies for math competitions
USEFUL FOR

Students preparing for math competitions, educators teaching algebra and sequences, and anyone interested in advanced problem-solving techniques.

asdfghjklqqww
Messages
12
Reaction score
0
AMC Question HARD!

While doing the Year Eight AMC (Australian Maths Competition), I came across this diffucult question...
(By the way, this isn't homework :P)

"I have a list of twelve numbers. The first number is 1 and the last number is 12. Each of the numbers is one more than the average of its neighbours. What is the heighest number on the list?"

It was an open answered question, and I couldn't work it out, so with seconds to spare, I guessed the number 47.

This is most likely wrong, so what is the actual answer?
 
Mathematics news on Phys.org


Your numbers are (I omit the calculations, but you can verify the answer is correct)

[tex]a_n=1+12n-n^2\qquad n=0,1,\dots,10,11[/tex]

So

a_0=1
a_1=12
a_2=21
a_3=28
a_4=33
a_5=36
a_6=37
a_7=36
a_8=33
a_9=28
a_10=21
a_11=12

You was wrong, largest number is 37.
 


You may just write out the recurrence equation and solve it yourself:

[tex]a_n = \frac{a_{n+1}+a_{n-1}}{2} +1[/tex]

[tex]a_1=1[/tex]

[tex]a_{12}=12[/tex]

The solution is:

[tex]a_n = -n^2 + 14 n -12[/tex]
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
3K
  • · Replies 67 ·
3
Replies
67
Views
17K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 21 ·
Replies
21
Views
5K
  • · Replies 8 ·
Replies
8
Views
3K