olymmath

ILL 1990 Problem 84

    Let n≥4n \geq 4 be an integer. a1,a2,…,an∈(0,2n)a_1, a_2, \ldots, a_n \in (0, 2n) are nn distinct integers. Prove that there exists a subset of the set {a1,a2,…,an}\{a_1, a_2, \ldots, a_n \} such that the sum of its elements is divisible by 2n.2n.

    Dataset text AI-MO AoPS. 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

    Similar problems

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

    Locator ill/1990/p84 · Tag QQ5K20PB6N · Edit this page on GitHub · Keys: j next, k previous