Recover a value in a magic square
Not answeredIn the square below, the three numbers in every row, every column, and both diagonals have the same sum. Find x.
Number-filling arrays, magic squares, neighbor rules, and number networks. Every diagram and instruction needed to complete the test is included on this page.
Your work saves automatically in this browser. Use Print or Reset at the top of the page when needed.
Complete all twelve questions. Each question is worth 10 points.
In the square below, the three numbers in every row, every column, and both diagonals have the same sum. Find x.
In a 3×3 magic square, the sums of all three rows, all three columns, and both diagonals are the same number A. The three shown entries are fixed. Find A.
Fill a 3×3 grid with nine different numbers so that every row, every column, and both diagonals have sum 3. Among the nine entries, how many must be less than 1?
This grid is optional; the requested count below is required.
Imagine completing the blank cells so that every row, every column, and both diagonals have the same sum. Only the value of x is required below; use the scratch space for a completed grid if helpful. Find x.
In the 3×3 square, place 5 in Row 1, Column 3 and 6 in Row 2, Column 1. Fill every remaining cell so that all rows, columns, and diagonals have sum 27.
Each cell contains a digit from 0 through 9. Repeated digits are allowed; they do not affect the requested value. Every row, every column, and both diagonals have the same sum. Find x.
In the model, the center cell is not used. The three numbers along each outside side sum to 5, and all eight outside numbers total 12. Rearrange or choose any numbers to complete two new border grids: one with total 13 and one with total 14. You may choose new numbers and repeat values; you do not have to reuse the model’s numbers. In both grids, every outside side must still sum to 5.
In the nine-cell square, every row, every column, and both diagonals have the same sum. Explain why no value of N can satisfy all the givens.
original correction: The original book contains inconsistent givens in this question. The grid below preserves them. Your task is to diagnose the contradiction, rather than find a number. Compare the sum forced by the first column with the sum forced by the opposite corners and the center.
Within each row, the difference between neighboring entries is constant (right number minus left number). Different rows may have different differences. Within each column, divide each entry by the one immediately above it: all three quotients in that column must agree. Do not assume in advance that different columns have the same quotient. Find a+b×c.
Suppose six different numbers fill the circles. A, B, C are the three side-middle values, not the corner values. The three numbers on each side of the triangle sum to 12. If A+B+C=18, what is the sum of the three corner values? Only their sum is required, not a full construction.
Place the numbers 1,2,3,4,5,6,7,8, each exactly once, in the eight circles. For every drawn segment, subtract the smaller endpoint value from the larger endpoint value. The seven differences must be exactly 1,2,3,4,5,6,7, each once.
On a small screen, scroll the diagram sideways to reach every circle.
Place the digits 1, 2, …, 9, each exactly once, in a 3×3 grid. For every horizontally or vertically adjacent pair, calculate larger minus smaller. There are twelve such differences. Arrange the digits so that the sum of the twelve differences is as large as possible. Give both your arrangement and the maximum sum.
This section includes all saved working, even when its panel was closed on screen.