Enigmatic Code

Programming Enigma Puzzles

Sphinx Cryptarithm #21

1 Comment Posted by on 4 March 2026

From Sphinx Magazine #146, July 1933

Reconstruct the division:

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

[sphinx21]

sphinx

One response to “Sphinx Cryptarithm #21”

  1. Jim Randell's avatarJim Randell 4 March 2026 at 9:40 am

    The following run file executes in 92ms. (Internal runtime of the generated code is 9.3ms).

    #! python3 -m enigma -rr

SubstitutedDivision

#                ? ?
#        -----------
#  A B ? ) ? ? C D ?
#          ? ? C E
#          -------
#            ? F F ?
#            ? ? E D
#            -------
#              D E ?  (remainder)
#            =======

"??CD? / AB? = ??"

"??CD - ??CE = ?FF"
"?FF? - ??ED = DE?"

# output solution as a division sum
--output="lambda p, s, ans=None: output_div(s.a, s.b, pre='  ', start='', end='')"

    Solution: The diagram corresponds to three possible long division sums:

    18530 ÷ 627 = 29 (rem 347)
    18531 ÷ 627 = 29 (rem 348)
    18532 ÷ 627 = 29 (rem 349)

    For example:

    (The red digits can have 1 or 2 added to them to get the other two solutions).

    Reply

Leave a Comment

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

Design a site like this with WordPress.com
Get started