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.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

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