olymmath

TUYMAADA 2012 J3

  • Junior

Prove that N2N^2 arbitrary distinct positive integers ( N>10N>10 ) can be arranged in a N×NN\times N table, so that all 2N2N sums in rows and columns are distinct.

Proposed by S. Volchenkov

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 tuymaada/2012/j3 · Tag 8Y444FK34X · Edit this page on GitHub · Keys: j next, k previous