Problem 2838. Optimum Egyptian Fractions
Solution Stats
Problem Comments
-
2 Comments
FYI, there is no known algorithm for optimal Egyptian fractions. Therefore this problem should allow the trivial solution of p/q as 1/q times p, which is not currently (this could be the worst score, a penalty can be included for repeated denominators). The solution for this problem is a greedy one (which may produce huge denominators), or the combination of non-greedy techniques that breaks the problem into several smaller pieces and which may create a huge sequence. I hope that the author has tested for upper and lower bounds on the test suite numbers since he is requesting an unknown solution and random numbers.
And my advice is if you do find a solution for this which attends the general case, don't publish it here, write a scientific paper.
Problem Recent Solvers12
Suggested Problems
-
Remove the polynomials that have positive real elements of their roots.
1030 Solvers
-
Find perfect placement of non-rotating dominoes (easier)
297 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
714 Solvers
-
579 Solvers
-
153 Solvers
More from this Author40
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!