Maths Olympiad Prep

Library / CEMC Fermat /536 of 566

CEMC Fermat, 2013

Algebra Difficulty 3.8 AMC 10/12 Find the answer Canada

Megan and Shana race against each other with the winner of each race receiving xx gold coins and the loser receiving yy gold coins. (There are no ties and xx and yy are integers with x gt; y gt; 0\text{x gt; y gt; 0}.) After several races, Megan has 42 coins and Shana has 35 coins. Shana has won exactly 2 races. The value of xx is

Pick one

Solution

Suppose that Megan and Shana competed in exactly nn races.

Since Shana won exactly 2 races, then Megan won exactly n−2n-2 races.

Since Shana won 2 races and lost n−2n-2 races, then she received 2x+(n−2)y2x+(n-2)y coins.

Thus, 2x+(n−2)y=352x+(n-2)y=35.

Since Megan won n−2n-2 races and lost 22 races, then she received (n−2)x+2y(n-2)x+2y coins.

Thus, (n−2)x+2y=42(n-2)x+2y=42.

If we add these two equations, we obtain (2x+(n−2)y)+((n−2)x+2y)=35+42(2x+(n-2)y)+((n-2)x+2y)=35+42 or nx+ny=77nx+ny=77 or n(x+y)=77n(x+y)=77.

Since nn, xx and yy are positive integers, then nn is a positive divisor of 77, so n=1,7,11n=1,7,11 or 7777.

Subtracting 2x+(n−2)y=352x+(n-2)y=35 from (n−2)x+2y=42(n-2)x+2y=42, we obtain ((n−2)x+2y)−(2x+(n−2)y)=42−35((n-2)x+2y)-(2x+(n-2)y)=42-35 or (n−4)x+(4−n)y=7(n-4)x+(4-n)y = 7 or (n−4)(x−y)=7(n-4)(x-y)=7.

Since nn, xx and yy are positive integers and x gt;y\text{x gt;y}, then n−4n-4 is a positive divisor of 7, so n−4=1n-4 = 1 or n−4=7n-4 = 7, giving n=5n=5 or n=11n=11.

Comparing the two lists, we determine that nn must be 11.

Thus, we have 11(x+y)=7711(x+y)=77 or x+y=7x+y=7.

Also, 7(x−y)=77(x-y)=7 so x−y=1x-y=1.

Adding these last two equations, we obtain (x+y)+(x−y)=7+1(x+y)+(x-y)=7+1 or 2x=82x=8, and so x=4x=4.

(Checking, if x=4x=4, then y=3y=3. Since n=11n=11, then Megan won 9 races and Shana won 2 races. Megan should receive 9(4)+2(3)=429(4)+2(3)=42 coins and Shana should receive 2(4)+9(3)=352(4)+9(3)=35 coins, which agrees with the given information.)

Want a route through all this instead of an archive? The track puts 2,604 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.