olymmath

KöMaL 2019 B5041

    An n×nn \times n table of real numbers in each field is called a zero square if the sum of the numbers in every 2×22 \times 2 square part of it (therefore in the whole table, too) is zero. (The diagram shows a 3×33\times3 example.) 2 -3 4 -4 5 -6 1 -2 3 What is the largest possible nn for which there exists an n×nn \times n zero square such that the entries are not all zeros?

    Official text KöMaL. 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 hu-komal/2019/b5041 · Tag WNZYGC96ZH · Edit this page on GitHub · Keys: j next, k previous