Problem#4 Interesting Problem

Here's an interesting problem at Yahoo Answer that I solved this morning. Comments and suggestions and a better approach welcome :)

Substitute 0-9 for the alphabets below using all the digits and repeating none.

A B C
D E F
-----------
sum
-----------
G H I J
SolutionSo easily G is 1 . 0 should be in the Answer becuase if 0 + 2 or something will give result 2. so we will have repeatiton.So lets put H = 0


So
ABC
DEF
--------
10 I J
A + D = 10 .. cant be if we do not have a carry over from the sum of B + E . So A = 4 D = 5.

we are left with 2,3,6,7,8,9

7 + 8 = 15 but if we have + 1 as carry over we can have 16 or 6
left with 2, 3, 9 9 + 3 is 12 and 1 can be used as carry over.

So
473
+589
---------
1062
--------
there can be many combinations
479
583
-----
1062

483
579
-------
and so on.

http://tinyurl.com/6k2vqy8