In this set of alphametic relationships, each letter in bold represents a different digit from 0 to 9. None of the numbers can contain a leading zero.

AB*C = DE, and:
DE + FG= HI

Assume that if I tell you whether A is 1 or not you would then be able to solve it uniquely. Given this information, can you now solve it?

There are four solutions:

AB * C = DE + FG = HI

17 * 2 = 34 + 56 = 90

17 * 4 = 68 + 25 = 93

18 * 2 = 36 + 54 = 90

38 * 2 = 76 + 14 = 90

If you tell use that A is not equal to one, then the last one is the only unique solution.

Posted by tomarken on 2014-08-11 11:40:21