Difference between revisions of "2002 AMC 10B Problems/Problem 23"
(Created page with "== Problem 23 == Let <math>\{a_k\}</math> be a sequence of integers such that <math>a_1=1</math> and <math>a_{m+n}=a_m+a_n+mn,</math> for all positive integers <math>m</math> an...") |
(added See also section and AMC10 box) |
||
Line 26: | Line 26: | ||
<cmath>a_6 = 2a_2+15 = 6+15 = 21</cmath> | <cmath>a_6 = 2a_2+15 = 6+15 = 21</cmath> | ||
<cmath>a_{12} = a_{6+6} = a_6+a_6+36 = 21+21+36 = \boxed{\mathrm{(D) \ } 78}</cmath> | <cmath>a_{12} = a_{6+6} = a_6+a_6+36 = 21+21+36 = \boxed{\mathrm{(D) \ } 78}</cmath> | ||
+ | |||
+ | == See also == | ||
+ | {{AMC10 box|year=2002|ab=B|num-b=21|num-a=23}} |
Revision as of 18:24, 28 December 2011
Problem 23
Let be a sequence of integers such that and for all positive integers and Then is
Solution
First of all, write and in terms of
can be represented by in different ways.
Since both are equal to you can set them equal to each other.
Substitute the value of back into and substitute that into
See also
2002 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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 |