Author |
Topic: Making Fractions (Read 269 times) |
|
otter
Junior Member
 

Gender: 
Posts: 142
|
 |
Making Fractions
« on: May 20th, 2003, 9:15pm » |
Quote Modify
|
If you take all of the non-zero digits and place them as follows: 6729 13458 you will have a fraction equal in value to one-half. Can you rearrange the nine non-zero digits similarly so as to form fractions exactly equal to one-third, one-fourth, one-fifth, one-sixth, one-seventh, one-eighth and one-ninth? You may use each digit only once for each fraction.
|
|
IP Logged |
We shall not cease from exploration. And the end of all our exploring will be to arrive where we started and know the place for the first time. T.S. Eliot
|
|
|
BNC
Uberpuzzler
    

Gender: 
Posts: 1732
|
 |
Re: Making Fractions
« Reply #1 on: May 21st, 2003, 12:23am » |
Quote Modify
|
Wow, that's an old one. A followup question: Each of the fractions may be achieved using more that a single way. What is the fraction with the maximal number of possibilities?
|
|
IP Logged |
How about supercalifragilisticexpialidociouspuzzler [Towr, 2007]
|
|
|
Leo Broukhis
Senior Riddler
   

Gender: 
Posts: 459
|
 |
Re: Making Fractions
« Reply #2 on: May 21st, 2003, 6:46am » |
Quote Modify
|
A 20-line program in C prints all 187 solutions of <a combination of 4 digits> / <a combination of 5 remaining digits> = 1 / <integer> in less than a second, starting with 12 solutions for one-half and ending with 1452 / 98736 = 1 / 68 The possible ratios include, in addition to 2 to 9: 12 to 19, 22-24, 26-29, 32, 35, 37, 38, 43, 44, 46, 52, 53, 59, 62, 66, 68
|
« Last Edit: May 21st, 2003, 6:47am by Leo Broukhis » |
IP Logged |
|
|
|
|