Cryptarithmetic: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) Created page with "Cryptarithmetic puzzles are arithmetic problems made of letters instead of numbers. The goal is to replace each letter with a single, unique digit in order to make the arithmeti..." |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 3: | Line 3: | ||
== English Bad, Math Good == | == English Bad, Math Good == | ||
Solve the cryptarithmetic in base six: TO + TO = FOR. | #Solve the cryptarithmetic in base six: TO + TO = FOR. | ||
#Solve the cryptarithmetic in base six: TOO + TOO = FOR. Now try it in base seven. | |||
Solve the cryptarithmetic in base six: TOO + TOO = FOR. Now try it in base seven. | #Prove that there are no solutions to the cryptarithmetic in ANY base: WON + WON = TOO. | ||
Prove that there are no solutions to the cryptarithmetic in ANY base: WON + WON = TOO. | |||
[[Category: Cryptarithmetic puzzles]] | [[Category: Cryptarithmetic puzzles]] | ||
[[Category: New]] | [[Category: New]] | ||
Revision as of 04:39, 5 May 2011
Cryptarithmetic puzzles are arithmetic problems made of letters instead of numbers. The goal is to replace each letter with a single, unique digit in order to make the arithmetic work out correctly. Here are some I have invented.
English Bad, Math Good
- Solve the cryptarithmetic in base six: TO + TO = FOR.
- Solve the cryptarithmetic in base six: TOO + TOO = FOR. Now try it in base seven.
- Prove that there are no solutions to the cryptarithmetic in ANY base: WON + WON = TOO.