Home > Numbers
Bartender to his apprentice: (Posted on 2013-03-26) |
|
"Get the proof of his age, Joe".
Insert the 4 bold words into alphametic equations:
(I) W1+W2=W3
(II) W1-W2=W4
in such an order that there will be a unique set of non-zero
digits (each distinct letter representing a distinct digit) fitting as a solution.
Which digits represent the nine letters a,e, ...t?
REM: I've built this puzzle bottom-up, so there might be solutions different
from mine - unlikely, but always welcome.
|
Submitted by Ady TZIDON
|
No Rating
|
|
Solution:
|
(Hide)
|
The way it is worded, there is no
unique set of 9 digits, there are 4 distimct solutions, depending on words' order.
If the unused digit had been 9 the answer would have been unique:
ask+joe=his 652 132 784 520 , without 9.
For more details see Charlie's post. |
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|