olymmath

OIM 2008 Problem 1

    The integers from 1 to 200822008^2 are written on each square of a 2008×20082008 \times 2008 board. For every row and column the difference between the maximum and minimum numbers is computed. Let SS be the sum of these 4016 numbers. Find the greatest possible value of SS .

    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 ibero/2008/p1 · Tag KAZAVWT72K · Edit this page on GitHub · Keys: j next, k previous