olymmath

AUSTRIAN-POLISH 1981 Problem 1

    Find the smallest nn for which we can find 1515 distinct elements a1,a2,...,a15a_{1},a_{2},...,a_{15} of {16,17,...,n}\{16,17,...,n\} such that aka_{k} is a multiple of kk .

    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 austrian-polish/1981/p1 · Tag MEHNWYRW61 · Edit this page on GitHub · Keys: j next, k previous