QUOTE
You test me with a baby puzzle? God.
Was it worth a try?
QUOTE
What is the maximum number of creatures a_1, a_2, a_3, a_4, ..., with a_{i+1} eating a_i if the farmer isn't there, such that the obvious analogous puzzle is solvable? Proof required.
Who cares about the answer to this question? Does the farmer care?