### Random Post

### Recent Posts

### Recent Comments

Hugh Casement on Enigma 1070: Time to work | |

Jim Randell on Enigma 1070: Time to work | |

Jim Randell on Enigma 1070: Time to work | |

geoffrounce on Enigma 440: Three X | |

Jim Randell on Enigma 1588: As easy as 1… |

### Archives

### Categories

- article (11)
- enigma (1,157)
- misc (2)
- project euler (2)
- puzzle (39)
- site news (44)
- tantalizer (42)
- teaser (3)

### Site Stats

- 177,568 hits

Advertisements

The following Python program tries all bases up to 36 (when we run out of letters), and finds the solution in 30ms.

The magic square is (in base 10 and base 34):

Solution:(a) base 34, (b) 1398.Jim, I guess you’re solution was a lucky shot. Where did you get the s4=s/3 from? By coincidence, this is the case, but if it hadn’t, you’re solver would not have worked…

It’s a property of 3×3 magic squares. You can solve the equations yourself to prove it, or you can get SymPy to do it for you:

Consider the three non-horizontal lines that go through the centre square, as they are magic lines they all sum to

s,so:rearranging gives:

since the bracketed terms are also magic lines, each one sums to

s,hence:I see, awesome.