Math Project – 1
Aadit Jagga
Class – X
Group – Ceres
2025 – 26
Contents
1) Introduction
2) Body –
a. A Brief History
i. The Sphinx Journal
b. Alphametics
c. Hindu Cryptarithms
3) Conclusion
4) Bibiliography
Introduction
Cryptarithmetic is the science and art of creating and solving
cryptarithms.
Cryptarithms or crypt-arithmetic problems are encrypted math
problems, where numbers in a given mathematical expression are
represented by letters or other symbols. There are two main types
of cryptarithms: Hindu problems and Alphametics.
A Brief History
The invention of Cryptarithmetic has been ascribed to ancient China. This art was originally
known as letter arithmetic or verbal arithmetic.
In 1864 the first cryptarithm appeared in the USA, in American Agriculturist.
The Sphinx Journal –
The journal Sphinx, subtitled "Revue Mensuelle des Questions Récréatives", was published
in Belgium in French language, from 1931 to 1939, entirely devoted to recreational
mathematics.
The editor was Maurice Kraitchik, an outstanding mathematician professor at the University
of Brussels, and M. Pigeolet, a great master puzzlist, was the cryptarithmetic editor.
Sphinx cryptarithms were either contributed by M. Pigeolet or otherwise submited by the
subscribers to the magazine. To boost interest on cryptarithmetic, Sphinx editors used to
organize puzzle contests paying cash prizes to the winners. Along the year 1933 they were
running "The Cryptarithmetic Year" competition, followed by "The Cryptarithmetic Key" in
January 1934.
It was in the Sphinx edition of May 1931 that Simon Vatriquant, using the pseudonym
"Minos", first introduced the word "crypt-arithmetic"
Alphametics
Alphametics are puzzles where each digit is replaced by a different symbol, usually a letter.
Many alphametics “spell out” words, making them more attractive and entertaining.
In 1955, J. A. H. Hunter coined the word alphametic to designate a cryptarithm wholly letters
form sensible words or phrases.
More recently, beginning in the 1990s, Mike Keith, with the aid of electronic computing,
developed extensive research contributing to the invention of new genres of alphametics:
Poems, "Found" Alphametics, Chessametics, Alphametic Squares and Order-n Alphametics,
raising the cryptarithmetic to a new pinnacle.
The world's best known alphametic puzzle is undoubtedly SEND + MORE = MONEY. It
was created by H. E. Dudeney and first published in the July 1924 issue of Strand
Magazine associated with the story of a kidnapper's ransom demand.
Rules of AlphaMetics –
1. Identical digits are replaced by the same letter. Different digits are replaced by
different letters.
2. After replacing all the letters with digits, the resulting arithmetic expression must be
mathematically correct.
3. Numbers cannot start with 0. For example, the number 0900 is illegal.
4. Each problem must have exactly one solution, unless stated otherwise (unlike the
“Hindu” problems where there might be no solution or multiple solutions).
5. The problems will be in base 10 unless otherwise specified. This means that the
letters replace some or all of the 10 digits – 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.
Solving Alphametics
Now we will attempt to solve the popular Alph ametic - SEND + MORE =
MONEY.
Now the Equation is,
SEND
+MORE
---------
MONEY
According to the rules of Alphametics, M cannot be 0.
Each letter stands for a single digit, and in addition of 2 numbers, a maximum of
1 can be carried over. And since both numbers are 4 digits long, this means that
M = 1.
Now the Equation Looks like this,
SEND
+MORE
1
---------
MONEY
1
Since there needs to be a carry over, either 1 + S + M = O + 10, or S + M = O +
10, therefore either S = O + 8 or S = O + 9, and O = 0 or 1. Since S is a single
digit, and M = 1, we must have O = 0.
So now,
SEND
+MORE
10
---------
MONEY
10
since E cannot equal N, we cannot have E + 0 = N. Thus we must have 1 + E + 0
= N. Since N cannot be 0, we must also have E less than 9. So there cannot be
carryover in this column, and the 2nd column must have carryover. Since there is
no carryover, this means that S = 9.
Now we have,
SEND
9
+MORE
10
---------
MONEY
10
Now we know 1 + E = N, and there must be carryover from the 2nd column. So
we have two cases: N + R = E + 10, or N + R + 1 = E + 10. We can substitute 1
+ E = N in both cases to get (1 + E) + R = E + 10 –> R = 9 (but 9 is already
taken), or we have 1 + E + R + 1 = E + 10 –> R = 8. So we must have R = 8.
Now,
SEND
9
+MORE
108
---------
MONEY
10
Now in the units column D + E = Y, and it must have carryover. Since Y cannot
be 0 or 1, we need D + E ≥ 12. Since 9 and 8 are taken for S and R, we can have
5 + 7 = 12 or 6 + 7 = 13. So either D = 7 or E = 7.
If E = 7, then E + 1 = N so N = 8–which is not possible since R = 8. So we must
have D = 7, meaning E is either 5 or 6.
SEND
9 7
+MORE
108
---------
MONEY
10
If E = 6, then N = 7 which is not possible as D = 7. So we must have E = 5 and N
= 6. This means D + E = 7 + 5 = 12, and thus Y = 2.
Finally we have,
SEND
9567
+MORE
1085
---------
MONEY
10652
Hindu Cryptarithms
Hindu problems originated in India in the middle ages and are
sometimes referred to as arithmetical restorations or skeleton
problems. In Hindu problems, every digit in a mathematical
expression is concealed with the same symbol, usually an asterisk.
Surprisingly, despite the fact that once the original digits have been
replaced by asterisks and they are indistinguishable, these
problems can be solved. For example: * + * = 2.
Each asterisk represented one missing digit (from 0 and 9). Two or
more asterisks in the same problem may represent different digits.
For example, for the problem * + * = 2 there are two possible
solutions:
1 + 1 = 2 – in this solution each asterisk represents the digit 1
2 + 0 = 2 – in this solution one asterisk represents the digit 0
and the other asterisk represents the digit 2
Rules Of Hindu Cryptarithms –
Each asterisk represents one missing digit (In Base 10).
Two or more asterisks in the same
problem may represent different digits.
Some puzzles might have several solutions and some might
have no solution
Two adjacent asterisks represent a 2-digit number, like 74.
Three adjacent asterisks represent a 3-digit number, and so
on.
In these cases the leftmost asterisk cannot represent the
number 0, i.e. it is illegal to write to represent the number 8 as
08.
Conclusion
Modernization by introducing innovations such as computers and
the Internet is making quite an impact on cryptarithmetic. Many
websites help in both creating and solving cryptarithms, as well
as just having such puzzles just for people to solve and enjoy,
Such as -
Alphametic puzzle generator by Truman Collins –
o [Link]
Alphametic puzzle Solver by Truman Collins –
o [Link]
Alphametic puzzles by Truman Collins –
o [Link]
Bibliography
1) [Link]
2) [Link]
great-puzzle/
3) [Link]
4) [Link]
5) [Link]