2019 AIME I Problems/Problem 4

Revision as of 19:29, 14 March 2019 by Krisha12 (talk | contribs) (Problem 4)

The 2019 AIME I takes place on March 13, 2019.

Problem 4

A soccer team has 22 available players. A fixed set of 11 players starts the game, while the other 11 are available as substitutes. During the game, the coach may make as many as 3 substitutions, where any one of the 11 players in the game is replaced by one of the substitutes. No player removed from the game may reenter the game, although a substitute entering the game may be replaced later. No two substitutions can happen at the same time. The players involved and the order of the substitutions matter. Let $n$ be the number of ways the coach can make substitutions during the game (including the possibility of making no substitutions). Find the remainder when $n$ is divided by 1000.

Solution

See Also

2019 AIME I (ProblemsAnswer KeyResources)
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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS