Maths Olympiad Prep

Library / /780 of 1394

, 2015

Number theory Difficulty 5.3 AIME, harder Prove it United States

Problem:

$indyhas\$ indy has \$ 100inpennies(worth in pennies (worth \$ 0.01each),nickels(worth each), nickels (worth \$ 0.05each),dimes(worth each), dimes (worth \$ 0.10each),andquarters(worth each), and quarters (worth \$ 0.25 each). Prove that she can split her coins into two piles, each with total value exactly \$ 50$.

Solutions — 2

Solution 1

Solution:

First, observe that if there are pennies in the mix, there must be a multiple of 5 pennies (since 5,10,250(mod5)5,10,25 \equiv 0 \pmod{5}), so we can treat each group of 5 pennies as nickels and reduce the problem to the case of no pennies, treated below.

Indeed, suppose there are no pennies and that we are solving the problem with only quarters, dimes, and nickels. So we have 25q+10d+5n=1000025q + 10d + 5n = 10000 (or equivalently, 5q+2d+n=20005q + 2d + n = 2000), where qq is the number of quarters, dd is the number of dimes, and nn is the number of nickels. Notice that if q200q \geq 200, d500d \geq 500, or n1000n \geq 1000, then we can just take a subset of 200 quarters, 500 dimes, or 1000 nickels, respectively, and make that our first pile and the remaining coins our second pile.

Thus, we can assume that q199q \leq 199, d499d \leq 499, n999n \leq 999. Now if there are only quarters and dimes, we have 5q+2d<1000+1000=20005q + 2d < 1000 + 1000 = 2000, so there must be nickels in the mix. By similar reasoning, there must be dimes and quarters in the mix.

So to make our first pile, we throw all the quarters in that pile. The total money in the pile is at most $49.75\$ 49.75, so now,

- if possible, we keep adding in dimes until we get an amount equal to or greater than $50\$ 50. If it is $50\$ 50, then we are done. Otherwise, it must be $50.05\$ 50.05 since the total money value before the last dime is either $49.90\$ 49.90 or $49.95\$ 49.95. In that case, we take out the last dime and replace it with a nickel, giving us $50\$ 50.

- if not possible (i.e. we run out of dimes before reaching $50\$ 50), then all the quarters and dimes have been used up, so we only have nickels left. Of course, our money value now has a hundredth's place of 5 or 0 and is less than $50\$ 50, so we simply keep adding nickels until we are done.

Solution 2

Solution:

First, observe that if there are pennies in the mix, there must be a multiple of 5 pennies (since 5,10,250(mod5)5,10,25 \equiv 0 \pmod{5}), so we can treat each group of 5 pennies as nickels and reduce the problem to the case of no pennies, treated below. Similarly, we can treat each group of 2 nickels as dimes, and reduce the problem to the case of at most one nickel. We have two cases:

Case 1. There are no nickels. Then, either the dimes alone total to at least $50\$ 50, in which case \$ indy can form a pile with \$ 50 worth of dimes and a pile with the rest of the money, or the quarters alone total to at least \$ 50,inwhichcase, in which case \$ indy can form a pile with $50\$ 50 worth of quarters and a pile with the rest of the money.

Case 2. There is exactly one nickel. By examining the value of the money modulo $0.25\$ 0.25, we find that there must be at least two dimes. Then, we treat the nickel and two dimes as a quarter, and reduce the problem to the previously solved case.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.