2009 AMC 10A Problem 15

Below is the professionally curated solution for Problem 15 of the 2009 AMC 10A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2009 AMC 10A solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:recursionarithmetic sequencesummation

Difficulty rating: 1400

15.

The figures F1,F_1, F2,F_2, F3,F_3, and F4F_4 shown are the first in a sequence of figures. For n3,n \ge 3, FnF_n is constructed from Fn1F_{n-1} by surrounding it with a square and placing one more diamond on each side of the new square than Fn1F_{n-1} had on each side of its outside square. For example, figure F3F_3 has 1313 diamonds. How many diamonds are there in figure F20?F_{20}?

401401

485485

585585

626626

761761

Solution:

Going from Fn1F_{n-1} to Fn,F_n, the new outside square carries 4(n1)4(n-1) diamonds. Starting from the single diamond of F1,F_1, Fn=1+4(1+2++(n1))=1+4(n1)n2=1+2n(n1).F_n = 1 + 4\big(1 + 2 + \cdots + (n-1)\big) = 1 + 4 \cdot \dfrac{(n-1)n}{2} = 1 + 2n(n-1).

Therefore F20=1+22019=761.F_{20} = 1 + 2 \cdot 20 \cdot 19 = 761.

Thus, the correct answer is E.

Problem 15 in Other Years