Difference between revisions of "2002 AMC 12B Problems/Problem 10"
(→Solution) |
|||
| Line 14: | Line 14: | ||
[[Category:Introductory Combinatorics Problems]] | [[Category:Introductory Combinatorics Problems]] | ||
| + | {{MAA Notice}} | ||
Revision as of 09:21, 4 July 2013
Problem
How many different integers can be expressed as the sum of three distinct members of the set 
?
Solution
Each number in the set is congruent to 1 modulo 3. Therefore, the sum of any three numbers is a multiple of 3. We can make all multiples of three between 1+4+7=12 (the minimum sum) and 13+16+19=48 (the maximum sum), inclusive. There are 
integers we can form.
See also
| 2002 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 9 |
Followed by Problem 11 |
| 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 12 Problems and Solutions | |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
