# Cryptograms

$\Large \begin{array} { c c c } & 1 & \color{orange}{B} \\ + & \color{orange}{B} & 6 \\ \hline & 7 & 1 \\ \end{array}$

Cryptograms are puzzles where capital letters stand in for the digits of a number. If the same letter is used twice, it’s the same digit in both places. And, in all of our puzzles, different letters represent different digits.

Solve enough cryptograms, and you’ll start to see patterns--tricks that will help you solve puzzles like these faster and more skillfully.

# Cryptograms

$\Large \begin{array} { c c c } & 1 & \color{orange}{B} \\ + & \color{orange}{B} & 6 \\ \hline & 7 & 1 \\ \end{array}$

What digit in place of $$\color{orange}{B}$$ would make this sum true?

# Cryptograms

$\large \begin{array} { l l l l } & & \color{green}{Z} & \color{green}{Z} \\ & & \color{green}{Z} & \color{green}{Z} \\ & & & \color{green}{Z} \\ & & & \color{green}{Z} \\ +& & &\color{green}{Z} \\ \hline & 1 & 0 & 0 \end{array}$

What digit is $${\color{green}{Z}}?$$

# Cryptograms

The remainder of the problems in this quiz get increasingly difficult as you go along. You will be called on to use all of the strategies below methodically and deliberately to work out solutions:

• Converting the problem into equations that take the place value of the letters into account. For example, $$R2D2 = 1000R + 200 + 10D + 2.$$

• Being aware of how carry digits work--when adding two numbers, you carry the ‘overflow’ from one place value to the next if the sum is greater than 10.

• Organizing and eliminating possibilities--keeping track of the possibilities carefully and in an organized way!

Which of these techniques did you already use while solving the two previous warmup puzzles?

# Cryptograms

$\Large \begin{array} {c c c c } & & \color{red}{A} & \color{blue}{B} \\ + & & \color{red}{A} & \color{blue}{B} \\ \hline & 1 & 3 & 8 \\ \end{array}$

What is the value of $$\color{red}{A} \color{#333333}{?}$$

# Cryptograms

$\Large \begin{array} {c c c } & 1 & \color{blue}{E} \\ \times & & \color{blue}{E} \\ \hline & 9 & \color{blue}{E} \\ \end{array}$

What digit in place of $$\color{blue}{E}$$ would make this multiplication true?

# Cryptograms

$\begin{array} {ccccc} \large & & & & \large \color{purple}{X}& \large \color{purple}{X}\\ \large & & & & \large \color{red}{Y}& \large \color{red}{Y}\\ \large + & & & & \large \color{blue}{Z}& \large \color{blue}{Z}\\ \hline \large& & & \large \color{purple}{X} & \large \color{red}{Y} & \large \color{blue}{Z} \end{array}$

If each letter represents a different nonzero digit, what must $$\large \color{blue}{Z}$$ be?

×