VMO 2006 Problem 3
Let , be two positive integers greater than 3. Consider the table of size ( rows and columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions:
each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click here to view the pictures).
In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same?
a) , ;
b) , .
Attachments:

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.