olymmath

MK-MO 2008 Problem 4

    We call an integer n>1n > 1 good if, for any natural numbers 1≤b1,b2,…,bn−1≤n−11 \le b_1, b_2, \ldots , b_{n-1} \le n - 1 and any i∈{0,1,…,n−1}i \in \{0, 1, \ldots , n - 1\} , there is a subset II of {1,…,n−1}\{1, \ldots , n - 1\} such that ∑k∈Ibk≡i(modn)\sum_{k\in I} b_k \equiv i \pmod n . (The sum over the empty set is zero.) Find all good numbers.

    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 mk-mo/2008/p4 · Tag VBY8ZBD6GE · Edit this page on GitHub · Keys: j next, k previous