2006 AIME I Problems/Problem 2: Difference between revisions
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
== See also == | == See also == | ||
* [[2006 AIME I Problems]] | * [[2006 AIME I Problems]] | ||
* [[Combinatorics]] | |||
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] | ||
Revision as of 16:15, 18 July 2006
Problem
Let set 
be a 90-element subset of 
and let 
be the sum of the elements of 
Find the number of possible values of 
Solution
The smallest S is 
. The largest S is 
. All numbers between 4095 and 4995 are possible values of S, so the number of possible values of S is 
.
