B × B ⋯ C B A D B A D 7 A D C ⋯ ⋯ ⋯ A D C A D C B D 2 In the above cryptogram , each letter represents non-zero digits where the number of A , B , C is 9 and D is 1 0 .
Find the sum of all the digits of the obtained product.
This is original problem (after being inspired)
Clarifications: If 1 2 3 × 6 5 4 = 8 0 4 4 2 then 8 + 0 + 4 + 4 + 2 = 1 8 is sum of all digits of the obtained product.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Glad that you like the problem. I wish to see your solution too. :) :)
Problem Loading...
Note Loading...
Set Loading...
Nice problem. I am still thinking of a nice solution.