### Random Post

### Recent Posts

### Recent Comments

Jim Randell on Enigma 544a: Merry Christ… | |

Jim Randell on Puzzle #52: Bus change | |

J. Pijnenburg on Puzzle #52: Bus change | |

Jim Randell on Puzzle #53: Painting by n… | |

GeoffR on Puzzle #52: Bus change |

### Archives

### Categories

- article (11)
- enigma (1,367)
- misc (4)
- project euler (2)
- puzzle (90)
- puzzle# (48)
- site news (58)
- tantalizer (93)
- teaser (7)

### Site Stats

- 233,055 hits

This puzzle is exactly the same as

Enigma 9, so I thought I’d try a different approach to normal (seeEnigma 80and all the puzzles mentioned in my solution for my more usual approach) and used the [[`SubstitutedSum()`

]] solver (from theenigma.pylibrary) to attack it. It’s not the fastest way, but there are only three candidate solutions that make it through the initial check, and two of those are removed by the first check on the intermediate values, but I went ahead and put the checks in for all of the intermediate values to make sure the only viable solution is indeed correct. This Python program runs in 1.1s.Solution:The correct sum is 6851496 ÷ 32 = 214109 remainder 8.