All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Exploring New Guinea (based on a true story!) (Posted on 2009-05-07) Difficulty: 2 of 5

In the days before the invention of aeroplanes European explorers faced grave difficulties exploring the foodless and nearly impenetrable jungles of New Guinea.

With time and experience, they learnt that a well trained and physically fit explorer could carry a three days supply of food with him.

Show how a team of 3N-1 explorers could send one of their number a distance N days march from the base camp, with all explorers returning safely to the base camp. (Note that once an explorer returns to camp, he must stay there.)

See The Solution Submitted by FrankM    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
A possible solution Comment 2 of 2 |
If the consumption of food is a quanta, calculated per day, as opposed to a fluidic consumption, the travel an explorer makes is limited...

    For 31-1 = 1 explorer, the explorer can travel 2 days out.
  • E1 travels 1 day out (checkpoint 1), consuming 1 day of food.
  • E1 continues a 2nd day out and consumes a 2nd day of food.
  • E1 returns to checkpoint 1 and consumes a 3rd day of food.
  • E1 returns to base camp (where he may raid the kitchen).
    For 32-1 = 3 explorers, one explorer can travel 3 days out.
  • E1, E2 and E3 travels 1 day out (checkpoint 1), consuming 1 day of food.
  • E1 transfers 1 day food to E2 and E3.
  • E1 returns to base camp.
  • E2 and E3 travels a 2nd day out (checkpoint 2), consuming a 2nd day of food.
  • E2 transfers 1 day food to E3.
  • E2 returns to checkpoint 1, consuming a 3rd day of food.
  • E3 returns to base camp.
  • E3 travels a 3rd day out, consumes a 3rd day of food.
  • E3 returns to checkpoint 2 and consumes a 4th day of food.
  • E3 returns to checkpoint 1 and consumes a 5th day of food.
  • E3 returns to base camp.
For a fluidic consumption, where food may be cached and transferred (at each "checkpoint", one explorer caches an amount needed to return to base camp for all other explorers and transfers the same amount to each explorer, returning each explorer to a full load, and keeping enough for his own return to base camp) the distance one explorer may reach with 3N-1 explorers setting out and returning to base camp is as follows:
(for x=1 to 3N-1) SUMMATION: 3/(2x)
  • For 31-1 = 1 explorer, the explorer can travel 1 1/2 days out.
  • For 32-1 = 3 explorers, one explorer can travel 2 3/4 days out.
  • For 33-1 = 9 explorers, one explorer can travel approximately 4 1/4 days out.
  • For 34-1 = 27 explorers, one explorer can travel approximately 5 5/6 days out.
  • For 35-1 = 81 explorers, one explorer can travel approximately 7 1/2 days out.
  • For 35-1 = 243 explorers, one explorer can travel approximately 9 1/9 days out.
  • etc....

  Posted by Dej Mar on 2009-05-08 05:16:17
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information