 For a given formula_26, the smallest positive formula_70 will be chosen such that formula_46 satisfies the constraints of the problem statement.In the William's version of the problem, formula_26 is 5 sailors, so formula_82 is 1, and formula_70 may be taken to be zero to obtain the lowest positive answer, so "N" = 1 55 – 4 = 3121 for the number of coconuts in the original pile.