2025 AIME I Problems/Problem 3: Difference between revisions
Removed spam Tag: Blanking |
Mathkiddus (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
==Problem== | |||
The <math>9</math> members of a baseball team went to an ice-cream parlor after their game. Each player had a singlescoop cone of chocolate, vanilla, or strawberry ice cream. At least one player chose each flavor, and the number of players who chose chocolate was greater than the number of players who chose vanilla, which was greater than the number of players who chose strawberry. Let <math>N</math> be the number of different assignments of flavors to players that meet these conditions. Find the remainder when <math>N</math> is divided by <math>1000.</math> | |||
Revision as of 19:22, 13 February 2025
Problem
The 
members of a baseball team went to an ice-cream parlor after their game. Each player had a singlescoop cone of chocolate, vanilla, or strawberry ice cream. At least one player chose each flavor, and the number of players who chose chocolate was greater than the number of players who chose vanilla, which was greater than the number of players who chose strawberry. Let 
be the number of different assignments of flavors to players that meet these conditions. Find the remainder when is divided by 
