### Random Post

### Recent Posts

### Recent Comments

Jim Randell on Tantalizer 452: Snailspaces | |

Brian Gladman on Enigma 1061: Par is never… | |

Hugh Casement on Enigma 1061: Par is never… | |

Jim Randell on Enigma 1061: Par is never… | |

geoffrounce on Puzzle 47: Digits all wro… |

### Archives

### Categories

- article (11)
- enigma (1,175)
- misc (2)
- project euler (2)
- puzzle (44)
- site news (46)
- tantalizer (48)
- teaser (3)

### Site Stats

- 183,007 hits

Advertisements

This puzzle is similar to

Enigma 1421.This Python 3 program (it uses the

yield fromconstruct) runs in 173ms. It would probably be more efficient to check the potential sequences forward starting from the start number we’ve determined, but we’ve already written the`solve()`

routine, so we use that and check if any solution starts from the number we want.Solution:Penny’s numbers are: 0, 2, 6, 4, 7, 9, 3, 5, 8, 1.