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

Home > Algorithms
Fractional computation (Posted on 2006-11-21) Difficulty: 4 of 5
The following algorithm can be applied to a list of fractions and an integer input. You go down the list and multiply the input by the first fraction that will result in an integer. Taking this product as the new input, you repeat, using the same list of fractions. The algorithm ends when none of the fractions will result in an integer.

For example, if the list of fractions is {5/6, 5/2, 5/3}, then inputting an integer 2a * 3b will result in 5max(a,b). A more complicated example: inputting 2a * 3b into {7/11, 11/(3*7), 1/7, (5*7)/2, 3/5} will result in 3a (if a>0).

Find a list of fractions such that inputting an integer 2a * 3b will result in 5ab.

How about a list that, when the input is 2a * 3b, results in 5a^b (with b>0)?

See The Solution Submitted by Tristan    
Rating: 4.1818 (11 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: simplification of part 2Tristan2006-11-22 04:09:47
Revised solutionGamer2006-11-22 01:43:09
simplification of part 2Joel2006-11-22 00:25:03
re: First question (correction)Steve Herman2006-11-21 23:08:00
re: First questionJoel2006-11-21 23:03:41
SolutionSolution?Joel2006-11-21 22:55:04
First questionGamer2006-11-21 22:42:31
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