# solve this cryptarithm using the digits 0 through 9 where each letter represents a digit and no digit can be represented by two different letters. all digits may not be usedUSSR+USA=PeaceI have tried to work all day and do not understand

Question

solve this cryptarithm using the digits 0 through 9 where each letter represents a digit and no digit can be represented by two different letters. all digits may not be used

USSR+USA=Peace

I have tried to work all day and do not understand

Step 1

We assume all letters have values between 0 and 9
Now,
U S S R
+      U S A
=P E A C E

So, the highest that S+U can carry to U is 1 (9 + 8 = 17 = 10 + 7).

Let us consider the ones column (A + R =E) as E is 0, then A + R must be 10 and forward 1 as a carry to the ten’s column.

Now, applying the trial and error method

• Starting from one’s column...

### Want to see the full answer?

See Solution

#### Want to see this answer and more?

Our solutions are written by experts, many with advanced degrees, and available 24/7

See Solution
Tagged in