Five children collect N pieces of Halloween candy and decide to split it evenly among them. When they try to divide it they have two pieces of candy left over. One of the children leaves, taking the 26 pieces of candy she collected with her. The remaining four children try to split the N – 26 remaining pieces of candy and discover that they have one piece of candy left over. Frustrated, a second child leaves, taking 24 pieces of candy and the remaining three children split the N – 26 – 24 pieces of candy left between them, delighted to discover that it can be split exactly three ways. What is the smallest (positive, of course) value for N for which this is possible? Are there other values of N for which this is possible also?
-
N mod 5 leaves 2
(N-26) mod 4 leaves 1
(N-50) is a multiple of 3
The smallest N is 107 original pieces
Next is N = 167, then N = 227, so every increment of 60 produces another solution
(N-26) mod 4 leaves 1
(N-50) is a multiple of 3
The smallest N is 107 original pieces
Next is N = 167, then N = 227, so every increment of 60 produces another solution