A camel with a less strict diet
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910397398777856 |
|---|---|
| author | de Bondt, Michiel |
| author_facet | de Bondt, Michiel |
| contents | A camel can carry $B$ bananas on its back. It can have $2$ bananas at a time in its stomach. For each mile the camel walks, the amount of bananas in its stomach decreases $1$. As soon as the amount of bananas in the camel's stomach is at most $1$, 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 $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.)
The case $B=1$ is solved completely. The round trip variant is solved for $B=1$ as well. For $B=2$, the round trip variant is solved for $N$ which are a power of $2$ and $N \le 8$, and estimated up to $1/(N-1)$ miles for general $N$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_02828 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A camel with a less strict diet de Bondt, Michiel History and Overview Optimization and Control A camel can carry $B$ bananas on its back. It can have $2$ bananas at a time in its stomach. For each mile the camel walks, the amount of bananas in its stomach decreases $1$. As soon as the amount of bananas in the camel's stomach is at most $1$, 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 $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.) The case $B=1$ is solved completely. The round trip variant is solved for $B=1$ as well. For $B=2$, the round trip variant is solved for $N$ which are a power of $2$ and $N \le 8$, and estimated up to $1/(N-1)$ miles for general $N$. |
| title | A camel with a less strict diet |
| topic | History and Overview Optimization and Control |
| url | https://arxiv.org/abs/2404.02828 |