2013-‐14
Challenge
Topic
(Meet
5,
Event
A)
Alphametics
A cryptarithm is a type of mathematical puzzle in which the digits in a mathematical
equation are substituted by letters or other symbols. In a typical puzzle, the same letter or
symbol always represents the same digit. The objective of the puzzle is to break the code
and determine the digits used that result in a true mathematical equation. Cryptarithms
may have unique solutions or several solutions.
In 1955, J. A. H. Hunter introduced the word alphametic to designate a cryptarithm
whose letters form meaningful words or phrases. One of the most famous cryptarithms
that is also an alphametic is:
SEND
MORE
MONEY
This puzzle appeared in the July 1924 issue of Strand Magazine. This puzzle was made
by the famous puzzlist H. E. Dudeney.
The solution to this puzzle is a bit more involved than one might think. In fact, no two
alphametics, even with the same operation, require the same approach to find the
solution. There are, however, a few observations and standard conventions that can be
applied in problem solving!
Let’s start by defining the alphametic puzzle conventions. There are few basic premises:
• The numbers represented by the words never contain a leading zero(s).
• There is a 1-to-1 correspondence between letters and digits.
• Operations are limited to +, -, *, and / .
• In division puzzles, the remainder is always 0.
Are there specific problem solving techniques that can be used with alphametics? There
is no a set strategy for cracking the code and solving the puzzle! The answer is basic
arithmetic facts, logical reasoning, solving systems of equations and determination and
patience.
Presented
at
2013
Coaches
Conference,
June
21-‐22
2013-‐14
Challenge
Topic
(Meet
5,
Event
A)
A Few Alphametic Problem Solving Facts/Strategies
1. The operation can sometimes be deduced by the largest place value of the
numbers involved or by considering intermediate steps (if given).
2. Since the digits are 0-9, the largest carry in addition with two summands is a 1.
3. In the case of K + K = K or K – K = K we know that K can only be 0 or 9 (in the
case of carry 1 or borrow 1).
4. No perfect square can end with 2, 3, 7, or 8. For example, in the equation E x E =
T, T cannot represent 2, 3, 7, or 8.
5. If N is even, then (N * 6 ) mod 10 = N. If N is odd, then (N * 5) mod 10 = 5.
6. The use of modular arithmetic often helps. For example, use of mod-10 arithmetic
allows the columns of an addition problem to be treated as simultaneous
equations, while the use of mod-2 arithmetic allows inferences based on the parity
of the variables.
Books:
Hunter, J. A., “Challenging Mathematical Teasers,” Dover, New York, 1980
Hunter, J. A., “Mathematical Brain Teasers,” Dover, New York, 1976.
Hunter, J. A., Madachy, Joseph S., “Mathematical Diversions,” Dover, New York, 1975
Web Resources:
There are many web sites as well as puzzle generators and solvers on the web. Search on
“cryptarithm.” Websites used to prepare materials:
Interesting Variations on an alphametic (including poetry):
http://www.mathematik.uni-
bielefeld.de/~sillke/PUZZLES/ALPHAMETIC/alphametic-mike-keith.html#trad
A cryptarithm creator and solver: http://www.iread.it/cryptarithms.php
Presented
at
2013
Coaches
Conference,
June
21-‐22
2013-‐14
Challenge
Topic
(Meet
5,
Event
A)
Example of Solution Strategies applied to:
SEND + MORE = MONEY
1. From
column
5,
M
=
1
since
it
is
the
only
carry-‐over
possible
from
the
sum
of
two
single
digit
numbers
in
column
4.
2. Since
there
is
a
carry
in
column
5,
O
must
be
less
than
or
equal
to
M
(from
column
4).
But
O
cannot
be
equal
to
M,
so
O
is
less
than
M.
Therefore
O
=
0.
3. Since
O
is
1
less
than
M,
S
is
either
8
or
9
depending
on
whether
there
is
a
carry
in
column
4.
But
if
there
were
a
carry
in
column
4,
N
would
be
less
than
or
equal
to
O
(from
column
3).
This
is
impossible
since
O
=
0.
Therefore
there
is
no
carry
in
column
4
and
S
=
9.
4. If
there
were
no
carry
in
column
3
then
E
=
N,
which
is
impossible.
Therefore
there
is
a
carry
and
N
=
E
+
1.
5. If
there
were
no
carry
in
column
2,
then
(
N
+
R
)
mod
10
=
E,
and
N
=
E
+
1,
so
(
E
+
1
+
R
)
mod
10
=
E
which
means
(
1
+
R
)
mod
10
=
0,
so
R
=
9.
But
S
=
9,
so
there
must
be
a
carry
in
column
2
so
R
=
8.
6. To
produce
a
carry
in
column
2,
we
must
have
D
+
E
=
10
+
Y.
7. Y
is
at
least
2
so
D
+
E
is
at
least
12.
8. The
only
two
pairs
of
available
numbers
that
sum
to
at
least
12
are
(5,7)
and
(6,7)
so
either
E
=
7
or
D
=
7.
9. Since
N
=
E
+
1,
E
can't
be
7
because
then
N
=
8
=
R
so
D
=
7.
10. E
can't
be
6
because
then
N
=
7
=
D
so
E
=
5
and
N
=
6.
11. D
+
E
=
12
so
Y
=
2.
Presented
at
2013
Coaches
Conference,
June
21-‐22
2013-‐14
Challenge
Topic
(Meet
5,
Event
A)
Let’s try a few! Hint: The first step is to figure out the operation involved!
1) 2) 3)
HE LOSE POSH
HE SEAL CHOP
SHE SALES SHOP
4) 5)
LYNDON D O
B DO ) F L Y
JOHNSON I F
D R Y
D R Y
- - -
6) What SENSE is that nine HENS is seven EGGS?
Solution Hints/Notes:
1) Multiplication. The answer must be a square number. ANS: HE = 25
2) Notice that this has to be an addition problem because of the leading S in the result. To
solve, note that S must be 1 because there are only two summands. ANS: SALES =
10921, O = zero
3) This must be a subtraction problem. To see this, consider (S+O) mod 10 = 0 and (O+H)
mod 10 = H. If this were addition, these equations would require that S=0 AND H=0
which is not possible. To solve, consider writing the problem as an addition problem!
ANS: SHOP = 5879, C=3
4) This is multiplication. To solve, recall that for K even, K * 6 = K. Consider the carries
and when there must be no carry. ANS: JOHNSON = 3420840, B = 6
5) To solve, first note that D ≤ 3 and D > 1. D = 3 forces I = 9 which is not possible. So, D =
2. Then, O x DO = DRY says that O > 7. Hence, DO = 28 or DO = 29. ANS: DO = 29,
FLY = 841
6) The puzzle is 9 x HENS = 7 x EGGS. ANS: SENSE = 58258
Presented
at
2013
Coaches
Conference,
June
21-‐22
