### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

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

### Site Stats

- 233,129 hits

Programming Enigma Puzzles

13 October 2017

Posted by on **From New Scientist #1568, 9th July 1987** [link]

In the following division sum each letter stands for a different digit:

Re-write the sum with the letters replaced by digits.

[enigma418]

%d bloggers like this:

This puzzle can be solved directly using the [[

`SubsitutedDivision()`

]] solver from theenigma.pylibrary.Here is a run file that executes in 95ms.

Run:[ @repl.it ]Solution:The correct sum is: 17961 ÷ 37 = 485 (remainder 16).Those letters-for-digits puzzles with a random jumble of letters are just so unimaginative.

We could have had DREAD / OR = SOB, which is what I do every time I see one by Emmet.

Oops! OR won’t fit with SOB: it must be a different divisor.