**From New Scientist #1551, 12th March 1987** [link]

It is true, of course, that there are rather a lot of letters in this puzzle, but despite that I though that for once Uncle Bungle was going to write it out correctly. In fact there was no mistake until the answer but in that, I’m afraid, one of the letters was incorrect.

This is another addition sum with letters substituted for digits. Each letter stands for the same digit whenever it appears, and different letters stand for different digits. Or at least they should, and they do, but for the mistake in the last line across.

Which letter is wrong?

Write out the correct addition sum.

As it stands the puzzle has no solution. **New Scientist** published the following correction with **Enigma 404**:

**Correction to Enigma 401,** “Uncle bungles the answer”. Unfortunately, as a result of a printer’s error, **New Scientist** managed to bungle the question. We will publish the correct question, in full, in our issue of 9 April, as **Enigma 405**. In the meantime, our apologies to those who were thwarted by the mistake.

[enigma401]

### Like this:

Like Loading...

This Python program uses the [[

`SubstitutedSum()`

]] solver from theenigma.pylibrary, and demonstrates that the problem does not have a solution as stated. It runs in 431ms.Solution:The puzzle has no solution.The puzzle has no solution in base 10, but adding a [[

`base=11`

]] parameter in line 16 shows that there is a solution in base 11.If we change the final digit in the result from Y to H then there is a solution, as we can see: