2021 AIME I Problems/Problem 4: Difference between revisions
Icematrix2 (talk | contribs) No edit summary |
|||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
Find the number of ways <math>66</math> identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile. | |||
==Solution== | ==Solution== | ||
Revision as of 15:47, 11 March 2021
Problem
Find the number of ways 
identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile.
Solution
See also
| 2021 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 3 |
Followed by Problem 5 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America. 
