Cody

# Problem 2126. Split bread like the Pharaohs - Egyptian fractions and greedy algorithm

Solution 389904

Submitted on 23 Jan 2014
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Fail
%% % Updated test suite to remove trivial solutions; % Small Vmin = 10; Vmax = 55; denom = floor(unique(egyptian_fraction(Vmin,Vmax))); egyptian_value = sum(1./denom); rel_tol = Vmin/Vmax*1e-6; actual_error = abs( egyptian_value - Vmin/Vmax ); assert(isequal(actual_error < rel_tol ,true))

Error: Assertion failed.

2   Fail
%% % Pie Vmin = 113; Vmax = 355; denom = floor(unique(egyptian_fraction(Vmin,Vmax))); egyptian_value = sum(1./denom); rel_tol = Vmin/Vmax*1e-6; actual_error = abs( egyptian_value - Vmin/Vmax ); assert(isequal(actual_error < rel_tol ,true))

Error: Assertion failed.

3   Fail
%% % Ramanujan Vmin = 1023; Vmax = 1729; denom = floor(unique(egyptian_fraction(Vmin,Vmax))); egyptian_value = sum(1./denom); rel_tol = Vmin/Vmax*1e-6; actual_error = abs( egyptian_value - Vmin/Vmax ); assert(isequal(actual_error < rel_tol ,true))

Error: Assertion failed.

4   Fail
%% % E Vmin = 27; Vmax = 183; denom = floor(unique(egyptian_fraction(Vmin,Vmax))); egyptian_value = sum(1./denom); rel_tol = Vmin/Vmax*1e-6; actual_error = abs( egyptian_value - Vmin/Vmax ); assert(isequal(actual_error < rel_tol ,true))

Error: Assertion failed.