Math (please help me Steve)
posted by Mark .
The squares of a 3×3 grid are filled with nonnegative 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 nonnegative integers in 8 ways, namely:
007#
016
025
034
115#
124
133#
233#
There are 3 permutations of partitions (indicated #) with nondistinct digits and 6 permutations of those with distinct digits for a total of
4*3+4*6=36 permutations of nonnegative 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:
124
241
412
We can also make another grid by rotating them to the right, as follows:
124
412
241
This doubles the number of grids for a total of
36*2=72 grids. 
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 nonnegative integers
(2) 7−a−b≥0⇔a+b≤7
(3) 7−c−d≥0⇔c+d≤7
(4) 7−a−c≥0⇔a+c≤7
(5) 7−b−d≥0⇔b+d≤7
(6) a+b+c+d−7≥0⇔a+b+c+d≥7
Try to count how many satisfies these conditions (:
Respond to this Question
Similar Questions

MATH
The squares of an infinite chessboard are numbered as follows: in the first row and first column we put 0, and then in every other square we put the smallest nonnegative integer that does not appear anywhere below it in the same column … 
college math
I do not understand a problem from a text book or how to solve the problem for the answer. Could shomeone show me the steps (show work) on how to solve this question. The sum of the intergers from 1 through n is n(n+1)/2. the sum of … 
math
Two nonnegative numbers are chosen such that their sum is 30. Find the numbers if the sum of their squares is to be a maximum. Explanation to solve this would help ! 
Math (Probability)
Four players are playing a game involving choosing squares on a grid of size 3×8. Each player chooses a random square on the grid, then all players reveal their choices and a token is placed in the center of each of these squares. … 
Math
The squares of a 3×3 grid are filled with nonnegative 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? 
Math (please help steve)
The squares of a 3×3 grid are filled with nonnegative 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? 
math
The squares of a 3×3 grid are filled with nonnegative 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? 
MATH
A four by four grid of unit squares contains squares of various sizes (1 by 1 through 4 by 4), each of which are formed entirely from squares in the grid. In each of the 16 unit squares, write the number of squares that contain it. … 
combinatirics
Please Help me with this question:Considering a 4*4 square grid,How many ways are there to fill each square with an integer from 1 to 10, such that the sum of each row and column is the same? 
Combinatorics
Please Help me with this question:Considering a 4*4 square grid,How many ways are there to fill each square with an integer from 1 to 10, such that the sum of each row and column is the same?