In this cryptarithm: PQR + STU + VWX = YYY, each letter represents a different base-11 digit from 0 to A, and none of the numbers can start with zero.
Many solutions exist for the above equation, but there are precisely two distinct values that Y can assume. Determine these values for Y and prove that there are no others.
Note: While a solution is trivial with the aid of a computer program, show how to derive it without one.
Question
Guest
In this cryptarithm: PQR + STU + VWX = YYY, each letter represents a different base-11 digit from 0 to A, and none of the numbers can start with zero.
Many solutions exist for the above equation, but there are precisely two distinct values that Y can assume. Determine these values for Y and prove that there are no others.
Note: While a solution is trivial with the aid of a computer program, show how to derive it without one.
Link to comment
Share on other sites
4 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.