We haven’t done any recreational math for a while. As a change of pace, instead of the division problems we’ve done in the past, here’s a multiplication problem. The usual rules for this kind of cryptarithm apply:
- Each letter represents one of the digits 0-9.
- Different letters represent different digits.
- There are no leading zeros, so in the problem below we know right away that A, C, D, and
FG are not zero.
Unlike many examples of these, if you put the letters for 0-9 in order, it won’t spell anything.
A B C x D E F ---------- G H I C G E G B C G G C ------------- C D F J I C
Please ROT13 any solutions, so others can keep playing.