English

A camel with a less strict diet

History and Overview 2024-04-04 v1 Optimization and Control

Abstract

A camel can carry BB bananas on its back. It can have 22 bananas at a time in its stomach. For each mile the camel walks, the amount of bananas in its stomach decreases 11. As soon as the amount of bananas in the camel's stomach is at most 11, it can eat a new banana. When the camel's stomach is empty, the camel must eat a new banana (in order to be able to continue its itinerary). Let there be a stock of NN bananas at the border of the desert. How far can the camel penetrate into the desert, starting at this point? (Of course it can form new stocks with transported bananas.) The case B=1B=1 is solved completely. The round trip variant is solved for B=1B=1 as well. For B=2B=2, the round trip variant is solved for NN which are a power of 22 and N8N \le 8, and estimated up to 1/(N1)1/(N-1) miles for general NN.

Cite

@article{arxiv.2404.02828,
  title  = {A camel with a less strict diet},
  author = {Michiel de Bondt},
  journal= {arXiv preprint arXiv:2404.02828},
  year   = {2024}
}

Comments

15 pages

R2 v1 2026-06-28T15:43:10.078Z