Cryptarithmetic, also referred to as Verbal arithmetic, is a cryptic mathematical game with equations among unknown numbers. The digits of these numbers are represented by letters.

The task is to identify the number that each of these letters represent.

The name crypt-arithmetic was coined by puzzlist Minos (pseudonym of Maurice Vatriquant) in May 1931 issue of Sphinx, a Belgian magazine of recreational mathematics. In 1955, J. A. H. Hunter introduced the word “alphametic” for the same, such as Dudeney’s, whose letters form meaningful words or phrases

Example,

S E N D

+ M O R E

———–

= M O N E Y

The solution to this puzzle is O = 0, M = 1, Y = 2, E = 5, N = 6, D = 7, R = 8, and S = 9.

Traditionally, each letter should represent a different digit, and (as in ordinary arithmetic notation) the leading digit of a multi-digit number must not be zero. A good puzzle should have a single solution, and the letters should make up a meaning phrase (as in the example mentioned above).

Cryptarithms provide good examples for the backtracking paradigm of algorithm design in the world of computer sciences. They also provide a pedagogical application for algorithms that generate all permutations (reordering) of n given things.

Try to solve this one (Ignore the symbol ‘@’)

I W R I T E

+ O N L Y @

—————-

= I W E B I E

Those of you who have taken up preparations for CAT examination can expect a few problems on Cryptarithmetic, as this involves a test of quickness and calm at problem solving.

Leave a Reply