Henry Ernest Dudeney/Puzzles and Curious Problems/93 - Figures for Letters/Solution
Jump to navigation
Jump to search
Puzzles and Curious Problems by Henry Ernest Dudeney: $93$
- Figures for Letters
Solve this cryptarithm:
A B C D x E F G H I ----------------- A C G E F H I B D
Each of the letters $A$ to $I$ represents one of the digits from $1$ to $9$ inclusive.
Solution
6 5 4 3 x 9 8 2 7 1 ----------------- 6 4 2 9 8 7 1 5 3
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. |
Sources
- 1932: Henry Ernest Dudeney: Puzzles and Curious Problems ... (previous) ... (next): Solutions: $93$. -- Figures for Letters
- 1968: Henry Ernest Dudeney: 536 Puzzles & Curious Problems ... (previous) ... (next): Answers: $153$. Figures for Letters