IZhO 2006 Problem 3
Let be two integers. We call a board filled with 0's or 1's good if
-
not all the numbers on the board are 0 or 1;
-
the sum of all the numbers in sub-boards is the same;
-
the sum of all the numbers in sub-boards is the same.
Find all such that there exists a good 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.
Similar problems
These problems have the most words in common with this statement.