Maths Olympiad Prep

Library / /229 of 241

, 2015

Number theory Difficulty 4.7 AIME Find the answer Canada

A bank teller has some stacks of bills. The total value of the bills in each stack is 1000. Every stack contains at least one 20 bill, at least one 50 bill, and no other types of bills. If no two stacks have the same number of 20 bills, what is the maximum possible number of stacks that the teller could have?

Pick one

Solution

Consider a stack of bills with a total value of 1000thatincludes1000 that includes x 20 bills and yy $50 bills.

The 20billsareworth20 bills are worth \$20xandthe and the 50 bills are worth $50y\$50y, and so 20x+50y=100020x+50y=1000 or 2x+5y=1002x+5y=100.

Determining the number of possible stacks that the teller could have is equivalent to determining the numbers of pairs (x,y)(x,y) of integers with x1x\geq1 and y1y \geq 1 and 2x+5y=1002x+5y=100.

(We must have x1x \geq 1 and y1y \geq 1 because each stack includes at least one 20 bill and at least one 50 bill.)

Since x1x \geq 1, then 2x22x \geq 2, so 5y=1002x985y = 100 -2x \leq 98.

This means that y985=19.6y \leq \frac{98}{5}=19.6.

Since yy is an integer, then y19y \leq 19.

Also, since 5y=1002x5y = 100 -2x, then the right side is the difference between two even integers, so 5y5y is itself even, which means that yy must be even.

Therefore, the possible values of yy are 2,4,6,8,10,12,14,16,182,4,6,8,10,12,14,16,18.

Each of these values gives a pair (x,y)(x,y) that satisfies the equation 2x+5y=1002x+5y=100: (x,y)=(45,2),(40,4),(35,6),(30,8),(25,10),(20,12),(15,14),(10,16),(5,18)(x,y)=(45,2),(40,4),(35,6),(30,8),(25,10),(20,12),(15,14),(10,16),(5,18) Translating back to the original context, we see that the maximum number of stacks that the teller could have is 9.

Want a route through all this instead of an archive? The track puts 2,444 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.