ADDITION & MULTIPLICATION RULE

Rule 1

• If A + B = A then the possible value of

o B = 0 (no carry)
o B = 9 (As 1 carry from the previous step)

A X
+ B Y
--------
A Z
Example for B = 0

5 6
+ 0 2 <- Example for 9
-------
5 8
Example for B = 9

(carry) 1
5 6
+ 9 7 <- Example for 9
-------
1 5 3
Basics

• Numbers can’t begin with 0 like in the below example –

09841 makes no sense => 9841

• If there are the following numbers A, B, C, D, E

• All values are unique thus for e.g in below example A = 1 thus B, C, D, E ≠ 1
• Values are distinct thus for e.g. if G=1 then if at a later point in time you get G=2 you’re solving
wrongly.

Rule 2

A X
X
----
B X

• If X * X = _X. Therefore – A={1, 5, 6}

 Since only,
1*1 = _1
5*5 = _5
6*6 = _6

Rule 3

A X
Y
----
B X

• If X x Y= _ X
o then possible values of X and Y, then X = 5 and Y = 3, 7, 9.
o When X = 2, 4, 8 and Y = 6

- X x Y = _X
5 x 3 = _5 i.e 15
5 x 7 = _5 i.e 35
5 x 9 = _5 i.e 45
- X x Y = _X
2 x 6 = _ 2 i.e 12
4 x 6 = _ 4 i.e 24
8 x 6 = _ 8 i.e 48

Question1 – TO + GO = OUT. Find the value of T + G + O + U?

1. 15
2. 11
3. 7
4. 18

Step 1

• The value of O is clearly 1. (Rule 6)

• Since, T + G is generating O is carry so value of O is 1.

Now, after substituting the values –

T O
+ G O
-----
O U T
The above 0 is O

Step 2

• Value of T = 1 + 1
• Thus, value of T = 2

T 1
+ G 1
-----
1 U T
Step 3

• Now, 2 + G > 10 (as its resulting a carry 1 on next)

• Now, possible values of G to get 1 carry at next step is – {G = 8 or 9}

If G is 9 then –

• U = 2 + 9 = 11
• So value of U becomes 1 and 1 goes to carry
• Now, value of O is already 1 so U value can not be 1 also. (Rule – 1)

Now, obv the value of G has to be 8, lets verify this also

• U = 2 + 8 = 10
• So value of U becomes 0, there is no conflict.

So final values are –

T = 2, O = 1, G = 8, U = 0

2 1
+ G 1
-----
1 U 2
Final Step

Replace values in all steps and solution looks like –

1 1
+ 9 9
+ 8 8
-----------
 1 9 8

Question2 – HERE = COMES – SHE, (assume S = 8). Find values of R + H + O

1. 15
2. 18
3. 14
4. 12

We can make this addition problem by re-writing it as – HERE + SHE = COMES

Step 1

• C = 1 ( Rule 1, as carry is there)

Now, since –

H
+ _
---------
C O

• H + _ (nothing), can be written as H + 0 now the result of H + 0 should also be H right?

• But, the answer is coming as O, which means there must be a carry from previous step
• So, H + 1 generates a number >10 as result is C O

So, H value is 9, and O value will be H + 1 = 9 + 1 = 0 (1 carry to next step)

rewriting the problem again

H E R E
+ S H E
---------
C O M E S
Step 2

• Now, they have already given S value as 8

• Now, E + E = 8, thus, E = 4

Lets find value R

• R+9=E
 • after substituting E value R + 9 = 4
• Thus, R = 5 and (1 carry to next step)

Lets, find the value of M

• E + S + 1 (Carry) = M
• after substituting the value 4 + 8 + 1 = 3 (1 carry to next step)

The final values are –

H = 9, E = 4, R = 5, S = 8, C = 1, O = 0, M = 3

9 E R E
+ S 9 E
---------
1 0 M E S

Question3 – THIS + IS = HERE. Find all the values?

Step 1

• T + (nothing ) = H
• Thus, 1 carry must be coming from previous step

Step 2

• Similarly, H + (nothing) = E
• Thus, 1 carry must be coming from previous step
• Now, H + 1 must be >10, as its generating carry on next step too (T)
• Thus, H = 9
• And since, H + 1 = E => E = 0 (carry to next step)

Now, the problem would look this –

1 1
T 9 I S
+ I S
---------
9 0 R 0
T H I S
+ I S
---------
H E R E
Step 3

• T + 1 (carry) = 9
• Thus, T = 8

Step 4

• S+S=0
• Now, two possible values for S can be 0 or 5
• Now, 0 is not possible as its already taken by E
• So, S value is 5, as 5 + 5 = 0 (1 carry to next step)

Step 6

• I + I will always generate even number

• But, there is 1 carry from previous step, so I + I + 1 will generate odd number
• Also, this is generating 1 carry at next step
• So, Sum of I + I + 1
o Is >10
o Is odd
o I + I + 1 > 10
• Possible values for I to generate this are 6, 7, 8, 9
• Since, 8 and 9 are already taken so 6, 7 are the only options

Step 7

Lets take 6 first

• I + I + 1 = R (1 carry to next step)

• 6 + 6 + 1 = 13 = 3 ( 1 carry to next step)
• R value is 3.

There are no conflicts anywhere so question is solved.

Lets take I = 7, this should generate conflict.

• I + I + 1 = R (1 carry to next step)

• 7 + 7 + 1 = 15 = 5 ( 1 carry to next step)
• R value can not be 5 as S value is already taken as 5.

So our assumption of I = 6 was correct

Final Answer – H = 9, E = 0, T = 8, S = 5, I = 6, R = 3
 1 1
T 9 I S
+ I S
---------
9 0 R 0

Question 4 – If POINT + ZERO = ENERGY, then E + N + E + R + G + Y = ?

1. 17
2. 13
3. 19
4. 18

Step 1

• E is 1 as max carry possible is 1

• P + (nothing) = N, it should have had been P
• This means that there is a carry from previous step
• P + 1 (carry) >10 as it gives Carry at next step to result E
• Thus, P = 9
• E = P + 1 = 0 (1 carry)

So, E = 1, P = 9, N = 0

Since, the problem contains both 0 and O we will replace O by X to avoid confusion

P O I N T
+ Z E R O
-----------
E N E R G Y
Step 2

• In, column 2, R + 0 = G, this means there must be 1 carry from previous step
• Thus, G = R + 1 that means they are consecutive and G >R
• Similarly, in column 3, R = I + 1. This means I and R as consecutive, with R >G
• Since, G = R + 1 and R = I + 1 => G = (I + 1) + 1 => G = I + 2
• Thus, G, R and I are consecutive, with G > R > I.

Step 3

• T+O=Y

1 1
9 O I 0 T
+ Z 1 R O
-----------
1 0 1 R G Y
Step 3

• T + O > 10, as its generating carry on next step.

• It will also not be 10 or 11 as T + O = Y and Y cant be 0 or 1 as those values are already
taken.
• So lets assume T + O to be 12. Thus, Y = 2
• Possible values can be –
o T, O = (3, 9) not possible as 9 already taken
o T, O = (4, 8) possible as unoccupied, let’s try this.

1 1 1
9 O I 0 T
+ Z 1 R O
-----------
1 0 1 R G Y
Step 4

• Till now the values are –

• N = 0, E = 1, Y = 2, T = 4, O = 8, P = 9
• Remaining values are 3, 5, 6, 7
• Now, Z + 8 = 11
• Thus, Z has to be 3

And since, we already know G, R, I are consecutive, thus, they are 5, 6, 7

So, E + N + E + R + G + Y = 1 + 0 + 1 + 6 + 7 +2 = 17

1 1 1
9 8 I 0 4
+ Z 1 R 8
-----------
1 0 1 R G 2

Question 5 – If AA + BB + CC = ABC, then what is the value of A+B+C= ?

1. 15
2. 18
3. 21
4. 12

Step 1
What could be max possible value of ABC?

• If AA = 99
• If BB = 88
• If CC = 77

Thus, ABC = 99 + 88 + 77 = 264, from this fact we are 100% sure that max value of A can be 2

So A can be (1 or 2)

Step 2

Now, lets look at the Unit’s place position. We have –

• A+B+C=C
• This can be possible if
o A + B = 0 or
o A + B = 10
• We already know A is either 1 or 2
o A + B = 1 + 9 = 0 or — (1)
o A + B = 2 + 8 = 0 — (2)

Step 3

Now, lets try equation (1)

• At tens place we have A + B + C = B. Let’s replace the values

• 1 + 9 + C = 9 (1 carry obv)
• 1 + 9 + C = 19
• C=9

B is already 9 so there must be one carry from previous step

• If carry is 1 then C = 9 – 1 = 8

So, A = 1, B = 9, C = 8

Note – Carry of 2 can’t be generated as A is 1 and B is 9 max possible value for C is 8 thus sum
is 18

A A
+ B B
+ C C
-----------
A B C
Final Step

Replace values in all steps and solution looks like –

1 1
+ 9 9
+ 8 8
-----------
1 9 8

Question 6– If YOUR + YOU = HEART (Given O = 4) Value of Y + U + R + E is ?

1. 15
2. 16
3. 17
4. 18

Step 1

• Obv H = 1
• Y + nothing = E (not Y)
• Thus there is 1 cary from previous step
• Y + (1 carry) is generating 1 carry resulting H
• Thus, Y + 1 > 10 => Y = 9
• So, E = 0

H = 1, Y = 9, E = 0

Y O U R
+ Y O U
-----------
H E A R T
Step 2

Possibilities for A

1. A can be A = 4 + 9 = 3
2. or A = 4 + 9 + 1 (carry) = 4
3. O is already 4 thus, A = 3
Step, 4 + 9 = A also, doesn’t get any carry from previous step U + 4 = R

Step 3

U + 4 = R results in no carry.

• Thus, U + 4 < 10
• U<6
• 4, 5, 1, 0 are already taken by O, A, H and E respectively
• So, U is either 5 or 2

Let’s take U = 5 ( no carry)

• U+4=R
• 5+4=R=9
• 9 is already taken by Y

Let’s take U = 5 ( 1 carry)

• U+4+1=R
• 5+4+1=R=0
• 0 is already taken by E
• Thus, U = 2

Step 4

For tens position U + O = R i.e. 2 + 4 is 6

Guessing that there is no carry, T = R + U = 6 + 2 = 8

9 4 U R
+ 9 4 U
-----------
1 0 A R T
Final Step

If we put all these values they generate no conflicts, thus we have reached the solution

9 4 2 6
+ 9 4 2
-----------
1 0 3 6 8
Question 7 – If TOM + NAG = GOAT Value of G + O + A + T is ?

1. 15
2. 12
3. 14
4. Can not be determined

Step 1

Clearly, G = 1 (Max carry is 1)

• O+A=O
• This is only possible in two ways
o If O is zero
o Or O is 9 and there is 1 carry from M + G = T step
• However, T + N = O it generates 1 carry to result G
• Thus, clearly T + N results 10 and O is zero and 1 carry to result G

T O M
+ N A G
-----------
G O A T
Step 2

• T + N should be 10
• T and N can be (8,2), (7,3), (6,4), (3,7), (2,8)
• Lets take (8,2)
• In this case A can take any values 3, 4, 5, 6, 7
• There are too many possibilities
• In this case unfortunately, the answer can not be determined.

T 0 M
+ N A G
-----------
1 0 A T

Question 8 – If NO + NO + GUN = HUNT, what is the value of HUNT?

1. 1082
2. 1802
3. 1208
4. 1280

Step 1
 • H = 1 (Max carry)
• G + (nothing) = U
• Thus, G has a carry => G + 1 > 10
• G=9
• So, U = 0
• Since, we have 0 (zero) and O and both look similar, we will replace O with X to avoid
confusion between O and 0 and also replace all other values

N O
+ N O
+ G U N
-----------
H U N T
Step 2

• From Tens digit, N + N + 0 = N

• Now, from the previous steps carry can be 0 or 1 or 2 since instead of 2 digit its 3 digit
addition
• If carry is 0 from previous step then only possible scenario to satisfy N + N + 0 = N is
when N = 0 itself. This is not possible as U value is already found out to be 0

Step 3

Now, lets assume carry to be 2 from previous step (Hit and trial)

• The step N + N + 0 = N is generating 1 carry to next step so.

• N + N + 0 > 10
• We can also write this as
o N + N + 0 = 10 + N
o Solving this we get N = 8

1
N X
+ N X
+ 9 0 N
-----------
1 0 N T
Step 4

• From units place we have

• X+X+8=T
o This step is generating a carry of 2 in next step as assumed
• So, X + X + 8 = 20 + T
• 2X – T = 12
Values already taken are 0, 1, 8. If, we look at the options the possible values for T from options
are 0 or 8 as options say

HUNT?

1. 1082
2. 1802
3. 1208
4. 1280

8 is already taken so T = 2. Thus, X = 7

Verify the question again. We have found all the values the answer is 1082

1
8 X
+ 8 X
+ 9 0 8
-----------
1 0 8 T

Question 9– IF EAT + THAT = APPLE, What is A + P + P + L + E?

1. 13
2. 14
3. 12
4. 15

Step 1

• Clearly A = 1, T = 9, P = 0 ( Think why?)

• After replacing the values here

E A T
+ T H A T
-----------
A P P L E
Step 2

• From Units place we know T + T = E

• We found T = 9 Thus E = 9 + 9 = 8 (1 carry to next step)
• L = A + A + 1 (carry from previous step)
 • L=1+1+1=3
• Finally E + H = 0 we already know E = 8
• Thus, H = 2

E 1 9
+ 9 H 1 9
-----------
1 0 0 L E

Question 10 – USSR + USA = PEACE, what is the value of P + E + A + C + E?

1. 9
2. 10
3. 11
4. 12

Step 1

• Clearly, P = 1, U = 9, E = 0
• Let’s replace the values here

U S A
+ U S S R
-----------
P E A C E
Step 2

• A+R=0
• This is possible if, A = 5, R = 5, but, both can’t take same values
• So its possible with (8,2), (7,3), (6,4), (4,6), (3,7), (2,8)
• Let’s do hit and trial and take (2,8) and replace the new values.

0 S A
+ 9 S S R
-----------
1 0 A C 0
Step 3

• Now, assuming S value to be 3

• We have S + S + 1 (carry) = C
 • 3 + 3 + 1 => C = 7 (unoccupied)
• All the values are found out we just need to verify

1
0 S 2
+ 9 S S 8
-----------
1 0 2 C 0
Step 3

• Values, are replaced and all the operations work just fine

Value of P + E + A + C + E = 1 + 0 + 2 + 7 + 0 = 10

1
0 3 2
+ 9 3 3 8
-----------
1 0 2 7 0

Question11 – MAC + MAAR = JOCKO, find value of 3A + 2M + 2C?

1. 31
2. 36
3. 33
4. 38

Step 1

• Here obviously J = 1 as max carry allowed it

• (nothing) + M = O, i.e. 0 + M = O this should have had been M only
• It means that there is 1 carry coming from previous step
• Also this M + 1 (carry) = O, is generating 1 carry to next step
• This means M + 1 > 10, this is only possible when M = 9
• => O = M + 1 = 9 + 0 = 0 (1 carry)

M A C
+ M A A R
-----------
J O C K O
Step 2
C+R=0

Since, this is at units place there can be no carry from previous step

Possible values of (C, R) can be (2, 8), (3,7), (4, 6), (6,4), (7,3), (2,8)

Lets assume, first case C = 2 and R = 8 in that case C + R, will generate 1 carry to next step A
+ A = K. The new problem looks like this –

1 1
9 A C
+ 9 A A R
-----------
1 0 C K 0
Step 3

• Thus, A + A + 1 (Carry) = K
• Also, 9 + A = 2, this is possible in two ways
• If, A = 3 (no carry from previous step) 9 + 3 = 2 (1 carry to next step)
• If, A = 2 (1 carry from previous step) but C value is already assumed to be 2, so this is
not possible thus, A has to be 3
• Thus K = 3 + 3 + 1 = 7

All values are fetched and there is no conflict.

1 1 1
9 A 2
+ 9 A A 8
-----------
1 0 2 K 0
Step 4

• Thus, 3 A + 2 M + 2 C = 3(3) + 2(9) + 2(2) = 9 + 18 + 4 = 31

1 1 1
9 3 2
+ 9 3 3 8
-----------
1 0 2 7 0
QUESTION 1

1. Value of A + S + T + A + R + T ?
(a) 21 (b) 26 (c) 24 (d) 25

2. Find the value of 4R + T ?

(a) 19 (b) 20 (c) 21 (d) 22

3. Find the value of 2A + R ?

(a) 5 (b) 6 (c) 7 (d) 8

V I A
x G O T
----------
G R O T
A A R O
A I A G
----------------
A S T A R T
Here,
A x T = _T [G R O T]
A x O = _0 [A A R O]
A x G = _G [A I A G]
This is only possible when A=1
Hence, Put A=1 and rewrite the problem again.

V I 1
x G O T
-----------
G R O T
1 1 R O
1 I 1 G
 ----------------
1 S T 1 R T
At this stage, divide the problem in 3 parts for collecting more clues..
(1) V I 1
x T
-----------
G R O T
(2) V I 1
x O
----------
1 1 R O
(3) V I 1
x G
----------
1 I 1 G
Now you have to choose one among three based on number of clues.
In this problem, you can take case (3).
(You can also take case (1) and Case (2))
(3) V I 1
x G
----------
1 I 1 G
At this stage you have to start hit and trial with the possible values of G
G = {2, 3, 4, 5, 6, 7, 8, 9}
*G ≠ {1}
(As you have already taken A=1)
[In Cryptarithmetic, each variable should have and unique and distinct value.]
*G ≠ {0}
(As you are multiplying some number by G in (3). If we take G=0)
then V I 1
x G
----------
0 0 0 0 [1 I 1 G]
Now,take G=2
(3) V I 1
x 2
-----------
1 I 1 2
*Rejected (you can see 2 x I =_1)

( You will never get unit digit at 1 after multiplying any number by 2.)
If we multiply any digit by 2 we cannot get last digit as 1.
i.e. 2x1=2, 2x3=6, 2x4=8 2x5=_0, 2x6=_2, 2x8=_6[16] and 2x9=_8[18])

[Relax it's going to take some time to understand the concept. Please read...again!]

Now,take G=3
put G=3 in case(3)
(3) V I 1
x 3
----------
1 I 1 3
Now we can see I x 3 = _1 [ 1 I 1 3]
(last digit is 1 which is only possible when I=7 (7 x 3 = 21)
Put I=7 in (3)
(3) V 7 1
x 3
----------
1 7 1 3
Now, you can easily predict the value of V=5 (3 x 5 = 15 + 2(carry)=17)

(3) 5 7 1
x 3
----------
1 7 1 3
Therefore,
V=5, I=7, A=1, G=3, Put these value in main problem and solve further.

5 7 1
x 3 O T
----------
3 R O T
1 1 R O
1 7 1 3
----------------
1 S T 1 R T
Now you can easily predict the other values.
S=8, T=6, R=4, O=2
These values also satisfies the Basic Cryptarithmetic Rules

5 7 1
x 3 2 6
----------
3 4 2 6
1 1 4 2
1 7 1 3
----------------
1 8 6 1 4 6

QUESTION : 2
1 Value of S ?
(a) 6 (b) 7 (c) 8 (d) 9

2. Which of the following follows the Pythagoras theorem ?

(a) H, A, D (b) H, A, B (c) T, E, A (d) T, E, D

3. Value of H + R + S + A ?
(a) 14 (b) 15 (c) 16 (d) 17
It is highly suggested to go through these before solving
- Crypt arithmetic Introduction
- How to Solve Crypt arithmetic Problems
T E A
x H A D
-----------
L D T R
H R S A
E W D A
----------------
L E S S E R
Here, A x A = _ A [ H R S A ]
Therefore, Possible values of A= {5, 6} Detailed Explanation- Rule 2
Further,
T E A
x H A D
----------
L D T R
H R S A
 E W D A
----------------
L E S S E R
Here, H x A= _A [ E W D A ]
Therefore, two possible cases for the values of H and A
Case I - when A={5} then H={3, 7, 9}
Case II - when A={2, 4, 8} then H={6} Detailed Explanation-Rule 3
Firstly taking case - I
Taking A=5 rewrite the problem again,
T E 5
x H 5 D
----------
L D T R
H R S 5
E W D 5
----------------
L E S S E R
Further,
T E 5
x H 5 D
----------
L D T R
H R S 5
E W D 5
----------------
L E S S E R
Here, 5 x D = _ R [ L D T R ]
Now, you can easily predict the value of R = 0 and possible values of D= {2, 4, 6, 8}
[If you multiply 5 to a number, you will only get[0,5] as their unit digit.]
5 x Even =_0 [2, 4, 6, 8]
5 x Odd =_5 [3, 5, 7, 9]

[Relax it's going to take some to understand the concept. Please read... again!]

Put R=0 and write the problem again,

T E 5
x H 5 D
-----------
L D T 0
H 0 S 5
E W D 5
----------------
L E S S E 0
At this stage, divide the problem into 3 parts,
(1) T E 5
x D
----------
L D T 0
(2) T E 5
x 5
----------
H 0 S 5
(3) T E 5
x H
----------
E W D 5
Now, take (2) [ As it has less number of variables. 5 is repeated three times.]
(2) T E 5
x 5
----------
H 0 S 5
Now you have to start hit and trial with the possible values of E
Firstly take E=1
Put E=1 in (2)
(2) T 1 5
x 5
----------
H 0 S 5 [ H 0 7 5]
If you compare side by side, then you will get S=7
Put S=7 and E=1 in the main problem.
[It needs to be checked further whether these values satisfies the Basic
Cryptarithmetic Rules]
T 1 5
x H 5 D
----------
L D T 0
H 0 7 5
1 W D 5
----------------
L 1 7 7 1 0
At this stage you can easily predict all the values as
You can see T + 5 =_1 (which is only possible when the value of the T=6)
L=2 (As, 1 + 1(carry) = L)
Hence T=6, L=2.
Now you can easily solve the problem.
6 1 5
x 3 5 4
----------
2 4 6 0
3 0 7 5
1 8 4 5
----------------
2 1 7 7 1 0
Answer

1. B
2. A
3. B

T=6, E=1, A=5, H=3, D=4, L=2, S=7, R=0, W=8

6 1 5
x 3 5 4
 ----------
2 4 6 0
3 0 7 5
1 8 4 5
----------------
2 1 7 7 1 0

EXERCISE QUESTION ::