The Camel-Banana Problem

التفاصيل البيبلوغرافية
العنوان: The Camel-Banana Problem
المؤلفون: de Bondt, Michiel
المصدر: Nieuw Archief voor Wiskunde, Vierde serie, Deel 14, No. 3 november 1996, pp. 415--426
سنة النشر: 2024
المجموعة: Mathematics
مصطلحات موضوعية: Mathematics - History and Overview, Mathematics - Optimization and Control
الوصف: A camel can carry one banana at a time on its back. It is on a diet and therefore can only have one banana at a time in its stomach. As soon as it has eaten a banana it walks a mile and then it needs a new banana (in order to be able to continue its itinerary). Let there be a stock of N 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.)
Comment: 8 pages, 3 eps-figures. The camel-banana problem by David Klarner is solved. The proof of Lemma B in v1 has been replaced by a shorter proof
نوع الوثيقة: Working Paper
URL الوصول: http://arxiv.org/abs/2403.19667
رقم الأكسشن: edsarx.2403.19667
قاعدة البيانات: arXiv