olymmath

CGMO 2021 Problem 5

    Proof that if 44 numbers (not necessarily distinct) are picked from {1,2,⋯ ,20}\{1, 2, \cdots, 20\} , one can pick 33 numbers among them and can label these 33 as a,b,ca, b, c such that ax≡b  ( mod c)ax \equiv b \;(\bmod c) has integral solutions.

    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 cn-gmo/2021/p5 · Tag MG611DTYKH · Edit this page on GitHub · Keys: j next, k previous