**From New Scientist #2155, 10th October 1998** [link]

Since **M** is the Roman numeral for 1000, we can say that with this puzzle *New Scientist* has published its Enigma **M** times — which is significant because:

**ENIGMA ÷ M = TIMES**

In this problem each letter stands for a different digit, and the same letter represents the same digit wherever it appears. No number starts with a zero.

I reckon that, with the extra puzzles that are sometime published under the same number at Christmas time, by the time **Enigma 1000** was published there had actually been 1011 *Enigma *puzzles in *New Scientist*.

However, a number of the puzzles in that range were flawed (I have found 17 so far, and there are 494 puzzles remaining to add to the site).

**Enigma 401** is unusual, as not only was the flaw acknowledged by *New Scientist*, but a corrected version of the puzzle was published as **Enigma 405**. Also **Enigma 9** is identical to **Enigma 83**. Together these reduce the count by 2 to give 1009 puzzles published.

[enigma1000]

### Like this:

Like Loading...

This alphametic problem can be solved using the [[

`SubstitutedExpression()`

]] solver from theenigma.pylibrary.The following command line executes in 133ms.

Run:[ @repl.it ]Solution:ENIGMA = 180426.