Copyright © University of Cambridge. All rights reserved.
'Two and Two' printed from http://nrich.maths.org/
Each of the different letters below stands for a different number.
How many solutions can you find to this cryptarithm?
How can you be sure you have found them all?
Can you create other similar cryptarithms?
Here are some suggestions to start you off.
ONE + ONE = TWO
ONE + TWO = THREE
ONE + THREE = FOUR
FOUR + FIVE = NINE
Can you make a cryptarithm subtraction?
If you enjoyed this problem you may like to take a look at Alphabet Soup
Click here for a poster of this problem