In a well known puzzle, a father willed to his three sons camels, with the proviso that of the inheritance should go to the oldest among them, with being due to the middle one and to the youngest. Shortly after the father's death, a wise man riding on his camel through the village noticed the three brothers in a quandary. He added his camel to the inherited thus getting a herd of animals. He gave of these (i. e. camels) to the oldest brother, to the middle one, and to the youngest. camel remained which he climbed up and rode away on. To the great satisfaction of all brothers, each of them received more than was willed by their father.
Among those who found interest in the puzzle, one may try solving it before reading the solution; another may read and enjoy the solution; somebody else may think up related problems. Paul Stockmeyer - a professor emeritus of computer science at the College of William and Mary - did just that (Math Horizons, Volume 21, Number 1, September 2013 , pp. 8-11), posing a generalized question and even listing several related research problems.
Are there situations that include two brothers? other problems with three? problems with four, etc. How many camels could be shared in such a manner? Below are several identities that answer some of the questions, if only partially. Rather obviously the problem involves the unit fractions:
Two sons, three camels:
Two sons, five camels:
Three sons, seven camels:
Three sons, eleven camels:
Three sons, eleven camels:
Three sons, nineteen camels:
Four sons, 1805 camels:
There are many more examples. But could an estate consist of 9 or 21 or of an even number of camels. Are there divisions where the oldest son is willed one third of the inheritance and not one half? What about one fourth?
This is amazing how many questions may be asked starting with such an elementary problem. Probably not all problem submit to such extensions, but many do. I've been recently referred to the site of an Online (more accurately, by correspondence) Russian Math Olympiad honoring Leonhard Euler. Here are some examples from this year's olympiad:
- In the expression replace each star with one of four arithmetic operations to make the result zero.
What comes to mind? First, an obvious generalization (that gives away a solution) is to end the product with Then it's natural to ask if there are other cases. I am not sure of the answer yet. What I am sure about is that a solution - if exists - is never unique. Prove that.
- In the island of knights (that always tell truth) and knaves (that always lie), fellows stand in a circle, all facing the center, and each declares that the ten to his left are all knaves. How many knaves are actually there?
Is the relation inherent for the solvability of the problem?
- Draw five staright lines in a plane that intersect in exactly seven points.
What number of intersections is possible for lines?