Maths Olympiad Prep

Track / Stage 4 / 296 of 340 #556 of 1964

Problem 556

AMC 12 late, AIME early
Combinatorics Difficulty 5.0 Find the answer

10. There are 2000 nodes, and each pair of nodes is connected by a wire. Now, let Varia and Peter take turns to cut these wires, with Varia starting first. She can only cut one wire each time, while Peter can cut 2 or 3 wires. The one who cuts the last wire loses. Who will win in the end?
(1999 Russian Olympiad Problem)

A number or a short expression. Spacing and $ signs are ignored.

Official solution

10. Since there are C2002=1999000C_{200}^{2}=1999000 wires, and 1999000 is a multiple of 4, Varia cuts 1 wire, and Peter cuts 3 wires, until 4 wires are left and it's Varia's turn to cut. Varia cuts 1, Peter cuts 2, and the last one is cut by Varia, so Peter can definitely win.

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