Hi everyone,
After several years away from the forum, I came across this thread by chance and found it very interesting. Working on it with Claude (Anthropic's AI), I found a few complements. The proofs are short; I can send the details to anyone interested.
Setting (blue's): an NxN Latin square, rows written one after another as the digits of a number X in base B, and M = B^N - 1 (so M = 999999999 for Sudoku).
1) Modulo (B-1)*M, all Latin squares on the same symbols leave the SAME remainder, for every N and every B, and this remainder can be written down explicitly.
Why: each symbol d marks a permutation matrix P_d (one cell per row and per column), and X = sum of d*P_d. Every permutation matrix, read as a number, leaves the same remainder modulo (B-1)*M.
Two by-products:
- Modulo M only the columns matter (Mladen's remark); modulo (B-1)*M the rows matter too.
- M divides X exactly when B-1 divides the sum of the symbols: blue's condition is necessary as well as sufficient.
2) (B-1)*M cannot be improved: no larger number gives all Latin squares the same remainder, for every N except N = 3.
The proof builds two Latin squares whose last two rows differ only by swapping two neighbouring symbols. For N = 3 this is impossible, and indeed for 3x3 squares a number three times larger works when 3 divides B-1 (for instance in base 10, all twelve 3x3 squares on 1,2,3 leave remainder 18648 modulo 26973).
3) The Sudoku case (N = 9, base 10, digits 1..9): X/999999999 always leaves remainder 5 when divided by 9.
In other words, X mod 8999999991 = 4999999995 for every grid. Consequences:
- X is divisible by 81 (coloin's "second 9", already contained in the conjecture), but never by 243.
- X is never divisible by 3*999999999, nor by 999999999^2.
Mladen's own relaxed examples show that the rows matter here: they are all divisible by M, but X/M mod 9 is 5, 0 or 7 depending on the example.
4) 9*999999999 is the best possible even for Sudoku grids alone. Sudokus are a smaller family than Latin squares, so they might have had a larger common modulus - they don't. These three grids (solutions of 17-clue puzzles) have differences whose gcd is exactly 8999999991:
- Code: Select all
A = 123456789456789123789123456214368597867945231935217864348672915591834672672591348
B = 123456789456789123789123456214378695867295341935641872348962517591837264672514938
C = 123456789456789123789123465214368597637594812895217346368971254571642938942835671
5) A last curiosity: a Sudoku number is never divisible by 1000000001 (hence never by eighteen 9's).
JPF