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

Home > Just Math
Another rational cryptarithm (Posted on 2006-02-22) Difficulty: 3 of 5

Replace each variable with a positive rational number (i.e. fraction) such that all of the following equations simultaneously hold true. Note that 0/n is not considered positive.

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
S + E + V + E + N = 7
E + I + G + H + T = 8

Additional constraints:

1) All fractions must have the same denominator, which must be as small as possible.
2) All variables must be distinct.
3) Reducible fractions, i.e. those in which the numerator and denominator share a common divisor greater than 1, are not allowed.

Hint: there are four distinct solutions. For extra credit, find the one with the lowest possible sum of the 14 variables.

This problem was inspired by a similar submission by pcbouhid (see http://perplexus.info/show.php?pid=3872)

No Solution Yet Submitted by Ethan    
Rating: 2.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Puzzle AnswerK Sengupta2023-07-26 06:56:33
SolutionI will guess, the solution of extra creditDej Mar2006-02-23 18:09:16
Corrective addendum to Possible SolutionDej Mar2006-02-23 03:32:17
Possible SolutionDej Mar2006-02-23 01:48:10
Some ThoughtsSeveral answersLeming2006-02-22 19:44:55
A solutionLeming2006-02-22 17:19:37
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
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