How many four-digit integers , with , have the property that the three two-digit integers form an increasing arithmetic sequence? One such number is , where , , , and .
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
The digit b is both the units digit of ab and the tens digit of bc; comparing the two forces the common difference to be 11p or 11p + 1.
Solution
Let the common difference be with . Adding to must produce , and adding it to must produce .
Track the digits. In the first addition, the units digits satisfy with a carry , and the tens digits satisfy . In the second addition, with carry , and .
The step from to appears twice: as units digits, ; as tens digits, . Hence , which forces and . So .
Case : , no carries, and increase by each step. Need with : gives ( numbers such as ), gives ( numbers such as ). That is .
Case : , so , , and . Constraints: and , i.e. . So with :
- : , giving ().
- : , giving .
- : , giving .
- : , giving .
That is .
Total: .
The answer is .
Why this works
The overlapping digits ( is both a units digit and a tens digit) let you compare two descriptions of the same step, which pins down the common difference modulo and rules out a carry in the first addition. After that the problem is two small, fully determined cases. In digit problems, write each addition column by column with explicit carries rather than reasoning about the numbers as wholes.
Alternative approach
Bound and search: and , so . Then or leaves , and a quick check of each (for instance and give nothing) reproduces the numbers.
The trap
Counting only the carry-free numbers with digits in arithmetic progression (1234, 2468, ...), which gives 9 (choice A) and misses cases like 4692.
Common mistakes
- Counting only the carry-free numbers with digits in arithmetic progression (, , ...), which gives (choice A) and misses cases like .
- Rejecting (as in or ); only is required to be nonzero, and is still a two-digit number.
Techniques
Split into exhaustive cases and handle each · Use an invariant, parity, or coloring argument