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 didnt 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 (:
Answer this Question
Math (please help steve) - The squares of a 3×3 grid are filled with non-...
Math - The squares of a 3×3 grid are filled with non-negative integers such ...
math - The squares of a 3×3 grid are filled with non-negative integers such that...
Combinatorics - Please Help me with this question:Considering a 4*4 square grid,...
combinatirics - Please Help me with this question:Considering a 4*4 square grid,...
MATH - A four by four grid of unit squares contains squares of various sizes (1 ...
college math - I do not understand a problem from a text book or how to solve ...
math - Two non-negative numbers are chosen such that their sum is 30. Find the ...
math - if you have 3 rows and three columns and you have to find the hidden ...
MATH - The squares of an infinite chessboard are numbered as follows: in the ...