A semipro baseball league has teams with players each. League rules state that a player must be paid at least and that the total of all players' salaries for each team cannot exceed What is the maximum possible salary, in dollars, for a single player?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
To make one salary as large as possible, pay everyone else the smallest amount allowed. The star gets whatever is left of the 700,000.
Solution
The team has a fixed amount of money. Every dollar paid to someone else is a dollar the star cannot get, so pay everyone else as little as the rules allow.
1. Besides the star there are players.
2. Each must get at least . Paying each of them exactly that costs
3. The total cannot be more than , so the star can get at most
4. This really happens: twenty players at and one at add to exactly , and everyone gets at least the minimum.
The answer is .
Why this works
When a total has a ceiling and each piece has a floor, one piece is biggest when all the other pieces sit at their floor. So "make one as large as possible" becomes "make all the others as small as possible", and the problem is one subtraction. Be careful to count the others, not everyone: players, not .
The trap
Subtracting 21 minimum salaries instead of 20 (which gives 385,000), or forgetting the minimum and answering 700,000.
Concise solution
The team's payroll is at most . To leave as much as possible for one player, every one of the other players should earn the minimum, :
The remaining money goes to the highest-paid player:
This is attainable (twenty players at and one at totals exactly ), so it is the maximum.
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 3: One-Variable Linear Equations (§3.3, §3.4)
- Introduction to Algebra, Chapter 20: Special Functions (§20.2, §20.5)
- Introduction to Algebra, Chapter 7: Proportion (§7.4)
- Introduction to Algebra, Chapter 15: More Inequalities (§15.1, §15.3, §15.4)
Techniques
Consider the largest/smallest element or boundary case