AMC 10 · 2002 · #23

Grade 6 arithmetic
recursive-sequencetriangular-numberspattern-recognition pattern-recognition ↑ Prerequisites: recursive-sequence
📏 Long solution 💡 3 insights
Problem

Let {ak}\{a_k\} be a sequence of integers such that a1=1a_1=1 and am+n=am+an+mn,a_{m+n}=a_m+a_n+mn, for all positive integers mm and n.n. Then a12a_{12} is

Pick an answer.

(A)
45
(B)
56
(C)
67
(D)
78
(E)
89

AMC 10 2002 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

Try it yourself first — the explanation is most useful after you’ve attempted it.