The computation was possible because
Now how would one comply with the will and use calculus? Well,
divide the remainder according to the will again, that is first
calculate 1/2, 1/3, and 1/9 of 17 obtaining 17/2,
17/3, and 17/9 respectively, and a reminder of 17/18. Now
this remainder should be split in three, the question being, how?
Since the will says nothing more than 1/2 to the oldest 1/3 to
the second oldest and 1/9 to the youngest one should proceed
exactly that way and give
more to the first
born,
to the second, and
to the youngest. By doing so one still has a remainder of
17/(182). Continuing like that there will always be something
left, so we should go like that for ever, that is continue
infinitely many times. Assume we did just that what would happen?
According to freshman calculus the first brother should get
![]() |
(1) |
A similar computation for the second brother would look as follows
![]() |
(2) |
The youngest should get then
![]() |
(3) |
So by applying the stipulations of the will ad infinitum one splits the heard exactly as the judge did, without tricks with extra camels added.
Back to the Problem of
the Week Page