2025 AIME I Problem 3

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

Difficulty rating: 2180

3.

The 99 members of a baseball team went to an ice-cream parlor after their game. Each player had a single scoop 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 NN be the number of different assignments of flavors to players that meet these conditions. Find the remainder when NN is divided by 1000.1000.

Solution:

Let c>v>s1c \gt v \gt s \ge 1 be the numbers of players choosing chocolate, vanilla, and strawberry, with c+v+s=9.c + v + s = 9. Checking small values of ss shows the only possibilities are (6,2,1),(6, 2, 1), (5,3,1),(5, 3, 1), and (4,3,2).(4, 3, 2).

Since the players are distinct, each triple of counts contributes a multinomial coefficient: 9!6!2!1!=252,9!5!3!1!=504,9!4!3!2!=1260.\frac{9!}{6!\,2!\,1!} = 252, \qquad \frac{9!}{5!\,3!\,1!} = 504, \qquad \frac{9!}{4!\,3!\,2!} = 1260. Thus N=252+504+1260=2016,N = 252 + 504 + 1260 = 2016, and the remainder modulo 10001000 is 16.16.

← Problem 2Full ExamProblem 4

Problem 3 in Other Years