# Enigmatic Code

Programming Enigma Puzzles

## Enigma 283: EI EI Oh!

From New Scientist #1430, 15th November 1984 [link]

In this long division sum (with no remainder) letters represent digits. A letter stands for the same digit throughout, and different letters stand for different digits.

What’s my AIM?

[enigma283]

### One response to “Enigma 283: EI EI Oh!”

1. Jim Randell 25 May 2015 at 8:56 am

This problem can be fed directly to the SubstitutedDivision() solver in enigma.py.

This (one-line) Python program runs in 61ms.

```from enigma import SubstitutedDivision

SubstitutedDivision(
'ENIGMA', 'EI', '??EI',
[('ENI', 'E??', 'E?'), ('E??', '???', '?'), ('??', '?I', 'E?'), ('E??', 'E??', '')]
).go()
```

Solution: AIM = 482.

There are three different solutions to the division sum, but the assignments for A=4, I=8 and M=2 (and also E=1) are the same in all of them:

138924 / 18 = 7718 rem 0 (G=9, N=3);
158724 / 18 = 8818 rem 0 (G=7, N=5);
178524 / 18 = 9918 rem 0 (G=5, N=7).

This site uses Akismet to reduce spam. Learn how your comment data is processed.