ACKNOWLEDGEMENT

I would like to thank my Math's Sir , ----------- , for giving me such an

interesting project .i have learnta lot about planning a house in this
project . I alsothank my parents for their constant help andsupport
for me during this project.

A cryptarithm is just a math puzzle or a math

riddle. We can turn any regular addition,
subtraction, multiplication, or division problem
into a cryptarithm by replacing the numbers
with letters.
Cryptarithm was originally called crypt-arithmetic

Pg--
Alphametic
A type of cryptarithm in which a
set of words is written down in the
form of a long addition sum or
some other mathematical
problem.The object is to replace the
letters of the alphabet with decimal
digits to make a valid arithmetic
sum.

There are two rules that we must

follow while solving these
alphametic puzzles.
1. The leftmost letter cannot be
equal to 0 in any of the words in
the alphabetic riddle.
2. Each alphabet can be mapped to
only one number.
i.e in above examples If N is
mapped to 8 then all another
letter(A O B U) cannot be mapped
to 8.
 ALPHABETS+ARITHMETIC=AL
PHAMETIC

Eg
#1 - Base Ball Games
Cryptarithmetic Riddle
BASE +
BALL
------
GAMES

The equation can be solved by substituting

B=7
A=8
S=8
E=3
L=5

Therefore the equation now looks as:

7483 +
7455
-------
14938
-------

#2 - Cross Roads Danger Alphametic Puzzle

CROSS
+ROADS
===========
DANGER

Solution:
+96233
+62513
===========
158746

NUMBER +
NUMBER
=======
PUZZLE

Above puzzle can be solved by substituting

N-2
U-0
M-1
B-6
E-8
R-9
P-4
Z-3
L-7

The puzzle can now be read as:

201689 +
201689
----------
403378

A Few Alphametic Problem Solving

Strategies
1. Since the digits are 0-9, the largest carry
in addition with two summands is a 1.
2. 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).
 3. 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.
4. If N is even, then (N * 6 ) mod 10 = N. If
N is odd, then (N * 5) mod 10 = 5.

Digimetic
A cryptarithm in which digits are used to represent other
digits.

eg
1. 1=10, 2=11*--
1+2=22

2. 1= 3, 2=6
1+2 = 9

Skeletal division
A long division in which most or all of the digits are replaced
by symbols (usually asterisks) to form a cryptarithm.
Reverse cryptarithm
A rare variation where a formula is written, and the solution
is the corresponding cryptarithm whose solution is the
formula given.