Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia counting and probability
Problem
Find the number of ways one can put numbers or in each cell of a chessboard in such a way that the sum of numbers in each column and in each row is an odd number (two ways are considered different if the number on some cell in the first way is different from the number on the cell at correspondent position in the second way).

Solution
Consider the leftmost column and lowest row of table, we color all these cells. We can see that for all ways to put the number of the sub square that not colored, we can choose the number for the correspondent colored position at same column or row. Indeed, if sum of the numbers is odd, then we put on the remain cell; otherwise, we put .
Finally, the number for the cell at corner can choose base on the parity of the sum of all number in square . These mean that the way to fill in the square uniquely define the numbers on the rest cells.
Since we can fill each cell among cells of the square by or in any way then the number of way is .
Finally, the number for the cell at corner can choose base on the parity of the sum of all number in square . These mean that the way to fill in the square uniquely define the numbers on the rest cells.
Since we can fill each cell among cells of the square by or in any way then the number of way is .
Final answer
2^49
Techniques
Recursion, bijectionInvariants / monovariants