A group of N merchants must cross a wide and deep river with no bridge in sight. They notice two 10-year-old boys playing in a rowboat by
the shore, The boat is so diny, however, that it can only hold two boys or one merchant, Which of the following is the minimum number of
cimes does the boat need to pass from shore to shore to transfer all merchants to the other side?
Answers
Answered by
3
Answer:
4N - 1
Step-by-step explanation:
1. First Two boys will go to other shore
2. one boy will bring the boat back
3. one merchant will go to other shore
4. one boy will bring the boat back
5 both boys will go to other shore
6 one boy will bring boat back
7 one merchant will go to other shore
8. one boy will bring the boat back
This process keep repeating
but in Last transfer bringing back og boy is not mandatory
so for N merchant transfer
it would be
4N - 1 ( as return of one boy is not mandatory)
Similar questions