Enigmatic Code

Programming Enigma Puzzles

Tag Archives: by: M. Rose-Innes

Sphinx Cryptarithm #21

From Sphinx Magazine #146, July 1933

Reconstruct the division:

The puzzle is credited to “M. Rose-Innes (Yokohama, Japan)”.

[sphinx21]

Sphinx Cryptarithm #18

From Sphinx Magazine, June 1933

In the sum of the series:

50^0 + 50^1 + 50^2 + … + 50^1010

it was found that 8 consecutive digits between the 1010th and the 990th terms (counting right to left) can be represented by PIGEOLET.

What are these figures and what places they occupy?

The puzzle is credited to “M. Rose-Innes (Yokoama, Japan)”.

[sphinx18]

Sphinx Cryptarithm #7

From Sphinx Magazine, February 1933

A printer, setting up the division shown above, found that he had only type numbers 7 and 0 which he put in their respective places, and two A‘s, which he used to substitute for a certain digit that appears twice in the dividend; but this same digit was next replaced by asterisks in all other parts of the division. The divisor is equal to the quotient.

Reconstruct the division sum.

[sphinx7]

Design a site like this with WordPress.com
Get started