olymmath

ELMO 2020 Problem 5

    Let mm and nn be positive integers. Find the smallest positive integer ss for which there exists an m×nm \times n rectangular array of positive integers such that

    • each row contains nn distinct consecutive integers in some order,
    • each column contains mm distinct consecutive integers in some order, and
    • each entry is less than or equal to ss .

    Proposed by Ankan Bhattacharya.

    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 elmo/2020/p5 · Tag G0RVCD6BEV · Edit this page on GitHub · Keys: j next, k previous