finds favour in the nursery. The general solution is that for
the number must be
(n - 1), where
is any integer.
Each man will receive
- 1 biscuits at the final division,
though in the case of two men, when
= 1, the final distribution
only benefits the dog. Of course, in every case each man steals an
nth of the number of biscuits, after giving the odd one to the dog.