Quantitative — Diophantine Digit Reversal
Question
A is a 2-digit number with different digits. B is also a 2-digit number and is obtained by reversing the digits of A. If A-B is a multiple of 27, where A > B, then how many such different A's are possible? [cite: 4440, 4441, 4443, 4446, 4494]
Options
6
9
12
18
Explanation
Let the two-digit number A be represented as 10x + y, where x and y are distinct single-digit integers (1 \le x \le 9 and 0 \le y \le 9).
A - B = (10x + y) - (10y + x) = 9(x - y)
9(x - y) = 27k \implies x - y = 3k
\{(4,1), (5,2), (6,3), (7,4), (8,5), (9,6), (3,0)\} \rightarrow 7 possibilities
\{(7,1), (8,2), (9,3), (6,0)\} \rightarrow 4 possibilities
\{(9,0)\} \rightarrow 1 possibility
Answer: (c).
Question details
Year
2026
Paper
CSAT
Question
Q46
Section
Quantitative Aptitude
Sub-topic
Number System
Type
Arithmetic Problem
Difficulty
Hard
Source hint
Number theory — algebraic digit transformations
Same sub-topic — other years
Number System has appeared in multiple CSAT papers:
See all questions on Number System
Browse every tagged question across all years