A Simple Cryptarithm

by Henry E. Dudeney

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. 0 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.