olymmath

ISL 2020 C6

4n4 n coins of weights 1,2,3,…,4n1,2,3, \ldots, 4 n are given. Each coin is colored in one of nn colors and there are four coins of each color. Show that all these coins can be partitioned into two sets with the same total weight, such that each set contains two coins of each color. (Hungary)

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2020 Shortlist booklet, page 8.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2020/c6 · Tag 1VGDHCGGFQ · Edit this page on GitHub · Keys: j next, k previous