2003 AIME I Problem 3

Below is the professionally curated solution for Problem 3 of the 2003 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2003 AIME I 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:counting pairsdouble counting

Difficulty rating: 1840

3.

Let the set S={8,5,1,13,34,3,21,2}.\mathcal{S} = \{8, 5, 1, 13, 34, 3, 21, 2\}. Susan makes a list as follows: for each two-element subset of S,\mathcal{S}, she writes on her list the greater of the set's two elements. Find the sum of the numbers on the list.

Solution:

An element xx is the greater element of a two-element subset exactly once for each smaller element of the set, so xx contributes to the sum once per element below it. Sorting the set as 1,2,3,5,8,13,21,34,1, 2, 3, 5, 8, 13, 21, 34, the sum of the list is 0(1)+1(2)+2(3)+3(5)+4(8)+5(13)+6(21)+7(34)=2+6+15+32+65+126+238=484.0(1) + 1(2) + 2(3) + 3(5) + 4(8) + 5(13) + 6(21) + 7(34) = 2 + 6 + 15 + 32 + 65 + 126 + 238 = 484.

← Problem 2Full ExamProblem 4

Problem 3 in Other Years