»

# Cryptarithms by Charles Timmerman

A cryptarithm is a puzzle where numbers are substituted for letters to correctly complete an arithmetic equation. These types of puzzles originated thousands of years ago in China. Your challenge is to determine the numbers that can correctly be substituted for the letters. The same number must be substituted for the same letter throughout the equation. Some people find trial and error the best method to hone in on a solution. (Answers for this section begin on page 313.)

Example:

(Hint: F must be “1” since that is the only number that can be carried from the previous column.)

There are seven possible solutions:

938+938=1,876

928+928=1,856

836+836=1,672

765+765=1,530

846+846=1,692

734+734=1,468

867+867=1,734

Cryptarithm Challenge 1

There are twenty possible solutions.

Cryptarithm Challenge 2

There are six possible solutions.

Cryptarithm Challenge 3

There are sixteen possible solutions.

Cryptarithm Challenge 4

There are sixteen possible solutions.

Cryptarithm Challenge 5

There are seven possible solutions.

Cryptarithm Challenge 6

There are eighteen possible solutions.

Cryptarithm Challenge 7

There are two possible solutions.

Cryptarithm Challenge 8

There are fifteen possible solutions.

Cryptarithm Challenge 9

There are ten possible solutions.

Cryptarithm Challenge 10

There are fourteen possible solutions.