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

m
(duplicate)
 
(3 intermediate revisions by 2 users not shown)
Line 1: Line 1:
==Problem==
+
#REDIRECT [[2000 AMC 12 Problems/Problem 8]]
 
 
==Solution==
 
 
 
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 \cdot 1+4 \cdot 2+...+4 \cdot 99=4 \cdot 4950=19800</math>.
 
 
 
 
 
<math>19801</math>
 
 
 
B.
 
 
 
==See Also==
 
 
 
{{AMC10 box|year=2000|num-b=11|num-a=13}}
 

Latest revision as of 22:46, 26 November 2011