### 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

This Python program solves the problem recursively in 56ms.

Solution:The five numbers are 10, 39, 72, 48, 56.A solution using the permutations approach:

Here is my version. There are at most 15 squares so its quicker to work with these rather than the numbers themselves.

An interesting approach. Here’s my take on it.

I also rewrote it in a similar way to make it shorter:

And here’s a recursive version.

Mine is a similar idea to Brian’s :

Here is another programme solution for Enigma 1471