Cryptarithm pp + qq + rr = tt0
Question
Let pp, qq and rr be 2-digit numbers where p < q < r. If pp + qq + rr = tt0, where tt0 is a 3-digit number ending with zero, consider the following statements:
Which of the above statements is/are correct?
Options
1 only
2 only
Both 1 and 2
Neither 1 nor 2
Explanation
Represent the identical-digit 2-digit numbers algebraically : pp = 10p + p = 11p qq = 11q, \quad rr = 11r
The sum equation becomes: 11p + 11q + 11r = tt0 \implies 11(p + q + r) = tt0
Since tt0 must be a multiple of 11 and end in 0, it must be a multiple of LCM(11, 10) = 110. Given p, q, r are single-digit numbers where p < q < r, the maximum possible sum is 7 + 8 + 9 = 24, meaning 11(p+q+r) \le 11 × 24 = 264. The only multiple of 110 in this range is 110 or 220.
Case 1: 11(p + q + r) = 110 \implies p + q + r = 10. Find single-digit combinations where p < q < r:
Case 2: 11(p + q + r) = 220 \implies p + q + r = 20.
Let's compile the set of possible values for each digit:
Answer: (a).
Question details
Year
2023
Paper
CSAT
Question
Q46
Section
Logical & Analytical Reasoning
Sub-topic
Cryptarithmetic
Type
Coding-decoding
Difficulty
Hard
Source hint
Cryptarithmetic puzzle
Same sub-topic — other years
Cryptarithmetic has appeared in multiple CSAT papers:
See all questions on Cryptarithmetic
Browse every tagged question across all years