All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
A rational cryptarithm (Posted on 2005-12-29) Difficulty: 2 of 5
Replace each letter by a positive rational number such that the following is true. Do it for rationals that can be written in the same denominator that is as small as possible.
O + N + E          =  1
T + W + O          =  2
T + H + R + E + E  =  3
F + O + U + R      =  4
F + I + V + E      =  5
S + I + X          =  6

See The Solution Submitted by pcbouhid    
Rating: 2.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Let's make this a bit more insidious (gah...correction to previous post) | Comment 5 of 18 |
Sorry, folks...bad math on my part.  The good news is that there  are only two solutions within my added constraints, not 56, which makes things even more fun.

The shared demoninator is still 7.
The total of the numerators is 101, *not* 113 as previously stated.
S and X are, as you may have figured, interchangeable (hence the two solutions).  The other 11 variables have only one possible value under these constraints.


  Posted by Ethan on 2005-12-30 03:34:16
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (14)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information