olymmath

ISL 1991 Problem 13

    Given any integer n≥2,n \geq 2, assume that the integers a1,a2,…,ana_1, a_2, \ldots, a_n are not divisible by nn and, moreover, that nn does not divide ∑i=1nai.\sum^n_{i=1} a_i. Prove that there exist at least nn different sequences (e1,e2,…,en)(e_1, e_2, \ldots, e_n) consisting of zeros or ones such ∑i=1nei⋅ai\sum^n_{i=1} e_i \cdot a_i is divisible by n.n.

    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 isl/1991/p13 · Tag B7B9JJ6NFE · Edit this page on GitHub · Keys: j next, k previous