A telephone number has the form , where each letter represents a different digit. The digits in each part of the number are in decreasing order; that is, , , and . Furthermore, , , and are consecutive even digits; , , , and are consecutive odd digits; and . Find .
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
All ten digits are used, so ABC is whatever the odd run GHIJ and even run DEF leave behind; only 9753 and 642 leave digits summing to 9.
Solution
There are ten letters and ten digits, all different, so every digit through is used exactly once. That means are simply the three digits not used by and .
Four consecutive odd digits in decreasing order: or . Three consecutive even digits: , or .
Case : the leftover pool is . Removing leaves (sum ); removing leaves (sum ); removing leaves (sum ). No sum is .
Case : the pool is . Removing leaves (sum ); removing leaves (sum ); removing leaves (sum ).
The only match is , , , so .
The answer is .
Why this works
The hidden constraint "ten distinct letters" turns a search into a complement: fix the rigid parts (runs of consecutive odd or even digits, which have very few options) and the flexible part is forced. Six cases, each a three-digit sum, is a small and safe enumeration.
The trap
Forgetting that 0 is a digit (so 420 is a valid DEF and 810 a valid ABC), or not using the fact that all ten digits must appear.
Common mistakes
- Forgetting that 0 is a digit (so 420 is a valid DEF and 810 a valid ABC), or not using the fact that all ten digits must appear.
- Trying to build directly from digits summing to and checking compatibility afterwards, which invites overlooked overlaps.
Techniques
Split into exhaustive cases and handle each