Enigmatic Code

Programming Enigma Puzzles

Enigma 385: A multiletteral problem

From New Scientist #1534, 13th November 1986 [link]

In the following multiplication sum letters have been substituted for most of the digits.

enigma-385

Write out the whole multiplication sum.

[enigma385]

Advertisements

One response to “Enigma 385: A multiletteral problem

  1. Jim Randell 24 February 2017 at 7:48 am

    We can use the general alphametic solver (SubstitutedExpression()) in the enigma.py library to tackle this problem.

    Here is the run file. It executes in 158ms.

    # consider the multiplication sum:
    #
    #     A B C D
    #         f p
    #   ---------
    #   g k b f p
    #   p g b f
    #   ---------
    #   y m f p p
    #   ---------
    
    # solver to use
    SubstitutedExpression
    
    # solver parameters
    --symbols="bfgkmpyABCD"
    --distinct="bfgkmpy"
    
    # expressions to solve
    "ABCD * fp = ymfpp"
    "ABCD * p = gkbfp"
    "ABCD * f = pgbf"
    

    Solution: The correct sum is: 2031 × 48 = 97488.

    enigma-385-solution

Leave a Comment

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: