I am trying to figure out a cryptarithm problem. You can...

<< Back to: Cryptography FAQ (01/10: Overview)

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

<< Back to: Cryptography FAQ (01/10: Overview)

[ Home | FAQ-Related Q&As | General Q&As | Answered Questions ]

Question by fishlover
Submitted on 11/25/2003
Related FAQ: Cryptography FAQ (01/10: Overview)
Rating:	Rate this question:
I am trying to figure out a cryptarithm problem. You can only use the numbers 0-9 and each number can be used only once. You must replace the letters with the numbers and the problem must work. The problem is, TWO THREE +SEVEN ------------- Twelve Email the answer to fishlover@aol.com

Answer by J3adSeed
Submitted on 1/6/2004
Rating:	Rate this answer:
How about this. I don't know if this is what you mean, but i just replaced letters with numbers in sequential order as a new letter arrived. TWO THREE +SEVEN ---------- TWELVE 123 14566 +76869 --------- 126086

Answer by Horea
Submitted on 1/14/2004
Rating:	Rate this answer:
I think you mean that the sum of the three numbers be equal to the 4th. In that case all the solutions are: 023 09866 +16567 ------------- 026456 027 09866 +16563 ------------- 026456 053 09266 +46867 ------------- 056186 057 09266 +46863 ------------- 056186 104 19722 +82526 ------------- 102352 106 19722 +82524 ------------- 102352

Answer by Taylor
Submitted on 11/9/2005
Rating: Not yet rated	Rate this answer:
THE +FAR= SIDE

Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer: