Olympiad Maths Prep

Track / Stage 5 / 318 of 400 #918 of 2000

Problem 918

AIME late
Combinatorics Difficulty 5.8 Prove it

A row of fifty coins with integer denominations is given, such that the sum of the denominations is odd. Alice and Bob alternate taking either coin at the left end of the row or the right end of the row, with Alice playing first. Prove that Alice can always ensure she gets more than half the money.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Color the coins alternatively black and white. Since 50 is even, on Alice's turn, the coins at either end of the row are different colors.

Thus Alice could guarantee getting all of the black coins, she could also guarantee getting all of the white coins. Since either the sum of the black coins is more the sum the white coins, or vice-versa (they are not equal since the sum is odd), Alice can guarantee getting more money than Bob.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.