This cryptarithm is built in such a way that first you multiply two numbers and then add to the result one extra number to get the final result. Every asterisk in this cryptarithm means some digit from 1 through 9, and every digit is used exactly once 0r isn't used.
The object is to replace all the asterisks with digits from 1 through 9 so that the whole calculation is correct. The solution is unique.
That was a tough one. Took good bit of time to crack it.
ReplyDelete1. had to think logically to eliminate the options for some positions.
2. had to go for trial & error in the left out options to converge on the solution:
17 * 4 = 68 + 25 = 93