olymmath

KöMaL 2009 A476

    Let n≥n \ge3 be an odd integer, and let AA={0,1,...,nn-1} denote the set of residual classes modulo nn. Call a non-empty subset B⊂AB \subset A a Dutch set, if for every a∈Aa \in A and for every b∈Bb \in B at least one of bb+aa and bb-aa lies in BB. Determine the smallest possible cardinality of a Dutch set in terms of nn.

    Official text KöMaL. 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 hu-komal/2009/a476 · Tag 22RSC8R77A · Edit this page on GitHub · Keys: j next, k previous