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?
 |
All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars |
