olymmath

IZhO 2006 Problem 3

    Let m≥n≥4m\geq n\geq 4 be two integers. We call a m×nm\times n board filled with 0's or 1's good if

    1. not all the numbers on the board are 0 or 1;

    2. the sum of all the numbers in 3×33\times 3 sub-boards is the same;

    3. the sum of all the numbers in 4×44\times 4 sub-boards is the same.

    Find all m,nm,n such that there exists a good m×nm\times n board.

    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 zhautykov/2006/p3 · Tag 62GABYTJBP · Edit this page on GitHub · Keys: j next, k previous