I got this problem from my sister in 6th grade. I spent 3 hours on this and couldn't figure it out for the life of me.
You're given an empty 3x3 square. You have to fill it with numbers from -9 to 9. Columns and rows and diagonals add up to 1. You cannot repeat any number.
I can't seem to find any combination that would give sums of 1 for all of them. Is there some algorithm for this?
The teacher claimed that none of her students had been able to solve this problem the past 14 years she's given it to them.
Suppose the sum of each row, column, and diagonal is s. Then the sum of all the digits is 3s.
If z is the center value, then, adding all the lines through the center, since the center is counted 4 times and all the other cells once, 4s-3z = 3s, or s = 3z.
Therefore the sum of all the digits is 3s or 9z. Therefore the sum of all the digits is divisible by 9.
But if s = 1, then the sum of all the digits is 3, which is not divisible by 9. This is a contradiction, so no such square can exist.