Henry Ernest Dudeney/Puzzles and Curious Problems/96 - Wrong to Right/Solution

From ProofWiki
Jump to navigation Jump to search

Puzzles and Curious Problems by Henry Ernest Dudeney: $96$

Wrong to Right
Solve this cryptarithm:
  W R O N G
+ W R O N G
-----------
  R I G H T
Each letter represents a different digit, and no $0$ is allowed.
There are several different ways of doing this.


Solution

The solution given by Dudeney: 

  2 5 9 3 8
+ 2 5 9 3 8
-----------
  5 1 8 7 6

but there are six more solutions: 

  1 2 7 3 4
+ 1 2 7 3 4
-----------
  2 5 4 6 8

  1 2 8 6 7
+ 1 2 8 6 7
-----------
  2 5 7 3 4

  1 2 9 3 8
+ 1 2 9 3 8
-----------
  2 5 8 7 6

  2 5 7 3 4
+ 2 5 7 3 4
-----------
  5 1 4 6 8

  2 5 8 6 7
+ 2 5 8 6 7
-----------
  5 1 7 3 4

  3 7 8 4 6
+ 3 7 8 4 6
-----------
  7 5 6 9 2

Proof


This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Immediate first deductions:

$T$ is even.
$1 \le W \le 4$


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Henry_Ernest_Dudeney/Puzzles_and_Curious_Problems/96_-_Wrong_to_Right/Solution&oldid=564781"