### Random Post

### Recent Posts

### Recent Comments

Jim Randell on Enigma 423: Four teams, more… | |

Jim Randell on Puzzle 61: A division sum | |

geoffrounce on Enigma 1457: Anglo-Italian… | |

Brian Gladman on Enigma 1088: That’s torn… | |

Hugh Casement on Enigma 1088: That’s torn… |

### Archives

### Categories

- article (11)
- enigma (1,122)
- misc (2)
- project euler (2)
- puzzle (31)
- site news (43)
- tantalizer (31)
- teaser (3)

### Site Stats

- 167,976 hits

This Python program uses the

SubstitutedDivision()solver from theenigma.pylibrary to examine long division sums with the right “shape”. It runs in 390ms.Solution:TEASE = 58044.A similar program will work with the new version of the

SubstitutedDivision()solver in theenigma.pylibrary, although there are some minor differences (the intermediate subtraction sums are included directly in the returned solutions, but the new version does include empty intermediates, and we can also provide acheck()function to the solver, to select the required solution).Here is a version of the above program that works with the latest version of the

SubstitutedDivision()solver. It runs in 336ms.But using the

distinctparameter to the newSubstitutedDivision()solver (which is inherited from theSubstitutedExpression()solver) we can specify the collections of symbols that have to take on distinct values amongst their own group. I use lower case letters to stand for the symbols in the division sum, and then group together symbols that correspond to the same upper case letter in the puzzle statement.Instead of requiring a specialised program the puzzle can be solved by presenting the right arguments to the

SubstitutedDivision()solver. Here is the necessary run file. It executes in 113ms.