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.
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
846 Solvers
Remove all the words that end with "ain"
1026 Solvers
173 Solvers
Remove NaNs and numbers adjacent to NaNs
59 Solvers
Problem Tags