Technique
Digit puzzles: list the choices for the tightest condition first
Quantitative Aptitude • Cryptarithms
Statement
Each digit is 0 to 9. A condition such as P = 3T allows only (T, P) = (1, 3), (2, 6), (3, 9) when T is not 0; a chain such as S = R + 7 allows only R = 0, 1, 2. List each tight condition's few choices, combine them, and then remove every combination that breaks another rule, such as all digits being different.
How to use it
- 1Rewrite chained conditions in terms of one digit (for example S = R + 7).
- 2List the few values each tight condition allows.
- 3Combine the lists in a small table.
- 4Strike out rows that repeat a digit or break any other condition; count what is left.
Worked example
A 3-digit number ABC has all digits different, A = 2C and B = C + 5, with C not 0. How many such numbers are there?
Step-by-step
- 1, so is 1 to 4.
- 2:
give ; . - 3Numbers: 261, 472, 683, 894. All have different digits.
Why: Check each row for repeats before counting.
Answer
4
Watch out
Forgetting a 0 that is allowed (or allowing one that is not), and missing a repeated digit, are the usual slips.