Question 39
Solve the cryptarithms given below:

We will solve each cryptarithm by analyzing the column additions and using logical deduction to find the unique digit represented by each letter.
Step 1 — Solving Cryptarithm (i) Let us analyze the addition problem: A1
- 1B B0
First, consider the units column: must result in a number ending in 0. Since B is a digit from 0 to 9, can be 10.
This means there is a carry-over of 1 to the tens column.
Next, consider the tens column: The sum of A, 1, and the carry-over (1) must equal B. We already found . Let us substitute this value into the equation:
Let us verify the solution: 71
- 19 90 The solution is consistent.
Step 2 — Solving Cryptarithm (ii) Let us analyze the addition problem: AB
- 37 6A
First, consider the units column: must result in a number ending in A. This means or . If , there is no carry-over to the tens column. If , there is a carry-over of 1 to the tens column.
Next, consider the tens column: . If there is no carry-over from the units column (carry = 0): If , then from the units column . This is impossible for a non-negative digit B. So, there must be a carry-over of 1 from the units column.
Now, assume there is a carry-over of 1 from the units column: From the tens column:
Now, use this value of A in the units column equation with a carry-over of 1: Let us verify the solution: 25
- 37 62 The solution is consistent.
Step 3 — Solving Cryptarithm (iii) Let us analyze the addition problem: ON
- ON PO
This means . First, consider the units column: must result in a number ending in O. So, or . Let be the carry-over to the tens column. So is 0 if , and 1 if .
Next, consider the tens column: must result in P. So, . Since PO is a two-digit number, P cannot be 0. Also, O cannot be 0 as it's the leading digit of ON. The letters O, N, P must represent distinct digits.
Let's consider the case where : This means . So . Also, . Since must be an integer, must be an even digit. Possible values for O (excluding 0): 2, 4, 6, 8.
If : . . The digits are . These are distinct. Let us verify: 21
- 21 42 This is a valid solution.
(Note: There are other valid solutions for this cryptarithm, but we provide one.)
Step 4 — Solving Cryptarithm (iv) Let us analyze the addition problem: QR
- QR PRR
This means . First, consider the units column: must result in a number ending in R. So, or . If : If : Since R must be a single digit, is not possible.
If , then . So there is no carry-over to the tens column (carry = 0).
Next, consider the tens column: must result in a number ending in R. We know and . So, or . If : However, Q and R must represent distinct digits. Since , cannot be 0. So, .
This means there is a carry-over of 1 to the hundreds column (carry = 1).
Finally, consider the hundreds column: The carry-over from the tens column must be P. So, . We found .
Let us verify the solution: 50
- 50 100 Here, . The result PRR is 100. All letters represent distinct digits (5, 0, 1). The solution is consistent.
Answer
(i) (ii) (iii) (iv)
More questions in IT
Evaluate each expression and write the result next to it. Do you notice anything interesting?
Now, take four other consecutive numbers. Place the '+' and '-' signs as you have done before. Find out the results of each expression. What do you observe?
Repeat this for one more set of 4 consecutive numbers. Share your findings.
Do these patterns occur no matter which 4 consecutive numbers are chosen? Is there a way to find out through reasoning?
Hint: Use algebra and describe the 8 expressions in a general form.
Now take any 4 numbers, place '+' and '-' signs in the eight different ways, and evaluate the resulting expression. What do you observe about their parities?
Repeat this with other sets of 4 numbers.
Is there a way to explain why this happens?
Hint: Think of the rules for parity of the sum or difference of two numbers.
Context: Now, let us see what happens when a negative sign is switched to a positive sign.
Q. Replace any negative sign in the expression with a positive sign and find the difference between the two numbers.
Context: Replace any negative sign in the expression with a positive sign and find the difference between the two numbers.
Q. What do you conclude from this observation?
Is the phenomenon of all the expressions having the same parity limited to taking 4 numbers? What do you think?
Breaking Even
We know how to identify even numbers. Without computing them, find out which of the following arithmetic expressions are even.
Using our understanding of how parity behaves under different operations, identify which of the following algebraic expressions give an even number for any integer values for the letter-numbers.
Context: The algebraic expressions from the previous page are:
Q. Similarly, determine and explain which of the other expressions always give even numbers. Write a couple of examples and non-examples, as appropriate, for each expression.
Write a few algebraic expressions which always give an even number.
Pairs to Make Fours
Take a pair of even numbers. Add them. Is the sum divisible by 4?
Try this with different pairs of even numbers. When is the sum a multiple of 4, and when is it not? Is there a general rule or a pattern?
When will two even numbers add up to give a multiple of 4?
This problem is similar to the question of identifying when adding two numbers will result in an even number. Can you see this?
There are three cases to examine:
Look at the following expressions and the visualisation. Write the corresponding explanation and examples.
Always, Sometimes, or Never
We examine different statements about factors and multiples and determine whether a statement is 'Always True', 'Sometimes True', or 'Never True'.
We know that the sum of any two multiples of 2 is also a multiple of 2.
- If 8 exactly divides two numbers separately, it must exactly divide their sum.
Statement 1 is always true. Determine if it is true with subtraction.
Examine each of the following statements, and determine whether it is 'Always true', 'Sometimes true', 'Never true'.
-
If a number is divisible by both 9 and 4, it must be divisible by 36.
-
If a number is divisible by both 6 and 4, it must be divisible by 24.
Context: Let us consider another expression, , and see the values it takes for different values of .
Numbers that leave a remainder of when divided by can also be seen as less than multiples of ; , where .
Q. Are there other expressions that generate numbers that are more than a multiple of ?
Similarly, explain using algebra why the divisibility shortcuts for 5, 2, 4, and 8 work.
Look at each of the following statements. Which are correct and why?
(i) If a number is divisible by 9, then the sum of its digits is divisible by 9.
(ii) If the sum of the digits of a number is divisible by 9, then the number is divisible by 9.
(iii) If a number is not divisible by 9, then the sum of its digits is not divisible by 9.
(iv) If the sum of the digits of a number is not divisible by 9, then the number is not divisible by 9.
The shortcut to find the divisibility by 3 is similar to the method for 9. A number is divisible by 3 if the sum of its digits is divisible by 3. Explore the remainders when powers of 10 are divided by 3. Explain why this method works.
Using these observations, can you tell whether the number 462 is divisible by 11?
Context: This alternating pattern of one more than 11 and one less than 11 continues for higher place values. Since 400 contains 4 hundreds, 400 is 4 more than a multiple of 11 (). Since 60 contains 6 tens, 60 is 6 less than a multiple of 11 (). Since 2 contains 2 units, 2 is 2 more than a multiple of 11, i.e., . Using these observations, can you tell whether the number 462 is divisible by 11?
Q. What could be a general method or shortcut to check divisibility by 11?
If this difference is 11 or a multiple of 11, what does that say about the remainder obtained when the number is divisible by 11?
Using this shortcut, find out whether the following numbers are divisible by 11. Further, find the remainder if the number is not divisible by 11.
(i) 158 (ii) 841 (iii) 481 (iv) 5529 (v) 90904 (vi) 857076
Is this method similar to or different from the method we saw just before?
Fill in the following table. Find a quick way to do this?
More on Divisibility Shortcuts
Divisibility Shortcuts for Other Numbers
How can we find out if a number is divisible by 6?
Will checking its divisibility by its factors 2 and 3 work? Use the shortcuts for 2 and 3 on these numbers and divide each number by 6 to verify— 38, 225, 186, 64.
How about checking divisibility by 24? Will checking the divisibility by its factors, 4 and 6, work? Why or why not?
What property do you think this digital root will have? Recall that we did this while finding the divisibility shortcut for 9.
Between the numbers 600 and 700, which numbers have the digital root: (i) 5, (ii) 7, (iii) 3?
Write the digital roots of any 12 consecutive numbers. What do you observe?
Now, find the digital roots of some consecutive multiples of (i) 3, (ii) 4, and (iii) 6.
What are the digital roots of numbers that are 1 more than a multiple of 6? What do you notice?
Try to explain the patterns noticed.
I’m made of digits, each tiniest and odd, No shared ground with root #1—how odd!
My digits count, their sum, my root— All point to one bold number’s pursuit— The largest odd single-digit I proudly claim.
What’s my number? What’s my name?
Solve the cryptarithms given below:
Try this now: GH × H = 9K.
This means a 2-digit number multiplied by a 1-digit number gives another 2-digit number in the 90s. Observe the letters corresponding to the units digits in this cryptarithm. Pick the solution to this question from the options given below: 11 × 9 = 99, 12 × 8 = 96, 46 × 2 = 92, 24 × 4 = 96, 47 × 2 = 94, 31 × 3 = 93, 16 × 6 = 96.
Solve the following:
(i) UT × 3 = PUT
(ii) AB × 5 = BC
(iii) L2N × 2 = 2NP
(iv) XY × 4 = ZX
(v) PP × QQ = PRP
(vi) JK × 6 = KKK