Difference between revisions of "2000 AMC 10 Problems/Problem 12"

(New page: We have a recursion: <math>A_n=A_{n-1}+4(n-1)</math>. I.E. we add increasing multiples of <math>4</math> each time we go up a figure. So, to go from Figure 0 to 100, we add <math>4 \cd...)
 
m
Line 1: Line 1:
 +
==Problem==
 +
 +
==Solution==
 +
 
We have a recursion:
 
We have a recursion:
  
Line 13: Line 17:
  
 
B.
 
B.
 +
 +
==See Also==
 +
 +
{{AMC10 box|year=2000|num-b=11|num-a=13}}

Revision as of 18:44, 8 January 2009

Problem

Solution

We have a recursion:

$A_n=A_{n-1}+4(n-1)$.

I.E. we add increasing multiples of $4$ each time we go up a figure.

So, to go from Figure 0 to 100, we add

$4 \cdot 1+4 \cdot 2+...+4 \cdot 99=4 \cdot 4950=19800$.


$19801$

B.

See Also

2000 AMC 10 (ProblemsAnswer KeyResources)
Preceded by
Problem 11
Followed by
Problem 13
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