Each entry of a square table of numbers is either or . Suppose that the sum of entries in each of the four sub-square tables is divisible by , while the sum of all the entries in the table is not divisible by . Determine the greatest possible values of the sum of all the entries.
This problem is a part of Tessellate S.T.E.M.S. (2019)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, we realize that the greatest theoretically possible sum is 2 ⋅ 1 6 = 3 2 . But if there are only 2s, then the sum of all entries would be divible by 4. If we put a 1 somewhere, the total sum won't be divisible by 4, but all 3 × 3 sub-squares that contain this 1 will have a sum of 2 ⋅ 8 + 1 ⋅ 1 = 1 7 , which is not divisible by 4. If we now take another 1 and put it and the other 1 into the central 2 × 2 sub-square both 1s will be in all 3 × 3 sub-squares, so each of these sums will be 2 ⋅ 7 + 1 ⋅ 2 = 1 6 which is divisible by 4. The total sum will be 2 ⋅ 1 4 + 1 ⋅ 2 = 3 0 and will not be divisible by 4.