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.
124 Solvers
Count letters occurence in text, specific to words with a given length.
84 Solvers
79 Solvers
Return fibonacci sequence do not use loop and condition
219 Solvers
Divisible by n, prime divisors from 20 to 200
42 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!