A Cryptarithm for Middle SchoolThe following cryptarithm was included in the 2004 UK Intermediate Mathematical Challenge as problem 14:
where all the letters stand for distinct non-zero digits. The problem is to determine the sum |Up| |Contact| |Front page| |Contents| |Algebra| |Store| Copyright © 1996-2012 Alexander Bogomolny Solution
First off, the only digits that taken three times produce a number that ends with that digit, are 0 and 5. Look at the last column. Since the problem stipulates that the digits are non-zero, The largest 3-digit number taken three times is strictly less than 3000,1000,2000,3000, which shows that a may be either 1 or 2,1 or 2,1 or 3,2 or 3. But it can't be 1, because from the tens column l would have to be 0. It follows that Let's now focus on the 100s column. (Remember that their an extra 2 carried over from the 10s column.) To make Answer: a + w + a + y = 2 + 6 + 2 + 5 = 15. |Up| |Contact| |Front page| |Contents| |Algebra| |Store| Copyright © 1996-2012 Alexander Bogomolny | ||||||||||||||||||||||||||||||||||||||||
| 40618116 |

