Following problem was inspired by this problem and that comment.
Given fraction numerator A and denominator B, find denominators C for Egyptian fraction. The goal of this problem is to minimize the sum of the list.
Example:
A = 16; B = 63; % 16/63 == 1/7 + 1/9 C = [7, 9];
C may be [4, 252] or [5, 19, 749, 640395] or [5, 27, 63, 945] or [6, 12, 252] or [7, 9] or almost any else of infinite more other options. The best one is [7, 9] with sum 16.
244 Solvers
Pull the variable y_correct from the Caller's Workspace
60 Solvers
Find the sum of the elements in the "second" diagonal
879 Solvers
Convert a numerical matrix into a cell array of strings
152 Solvers
Return the first and last character of a string
1659 Solvers
Problem Tags