Math (please help me Steve)
posted by Mark .
The squares of a 3×3 grid are filled with non-negative integers such that the sum of each row and the sum of each column is 7. How many different ways can the squares be filled? The numbers in each grid square does not need to be distinct. Rotations and reflections are distinct arrangements.
Here's a lower bound solution. You may want to investigate other possibilities.
The number 7 can be partitioned into 3 ascending non-negative integers in 8 ways, namely:
There are 3 permutations of partitions (indicated #) with non-distinct digits and 6 permutations of those with distinct digits for a total of
4*3+4*6=36 permutations of non-negative integers whose sum is 7.
Each of these permutations can make a 3x3 grid as follows by putting a permutation as the first line, then rotate the digits to the left:
We can also make another grid by rotating them to the right, as follows:
This doubles the number of grids for a total of
what about this case, i didn't enumerated it
1 2 4
0 5 2
6 0 1
Hint: you need these:
(1) a,b,c,d are non-negative integers
Try to count how many satisfies these conditions (: