### Random Post

### Recent Posts

### Recent Comments

Jim Randell on Enigma 457: Divided by ex… | |

geoffrounce on Puzzle 44: Men-only Mews | |

Jim Randell on Puzzle 44: Men-only Mews | |

Brian Gladman on Enigma 1053: Home truths | |

Jim Randell on Enigma 1053: Home truths |

### Archives

### Categories

- article (11)
- enigma (1,192)
- misc (3)
- project euler (2)
- puzzle (48)
- site news (47)
- tantalizer (51)
- teaser (3)

### Site Stats

- 186,584 hits

Advertisements

This Python code isn’t the fastest program (runtime is 1.1s), but it constructs the minimal solutions.

Solution:There are many squares with a highest number of a 5, and a total of 19.{1,1,1},{2,2,1},{1,3,5} has sum 17.

1, 1, 1 / 2, 2, 1, / 1, 3, 5 doesn’t satisfy the conditions that all the rows, columns and diagonals should all have different sums. The first column is 1 + 2 + 1 = 4, and the reverse diagonal (from bottom left to top right) is also 1 + 2 + 1 = 4.

Reverse diagonal… OK – thanks!