search
Log In
6 votes
572 views

Three men and three rakhsasas arrive together at a ferry crossing to find a boat with an oar, but no boatman. The boat can carry one or at the most two persons, for example, one man and one rakhsasas, and each man or rakhsasas can row. But if at any time, on any bank, (including those who maybe are in the boat as it touches the bank) rakhsasas outnumber men, the former will eat up the latter. If all have to go to the other side without any mishap, what is the minimum number of times that the boat must cross the river?

  1. $7$
  2. $9$
  3. $11$
  4. $13$
  5. $15$
in Numerical Ability
edited by
572 views

3 Answers

8 votes
 
Best answer

r

So, boat crosses river 11 times.. Option (C)


selected by
0
is there a general procedure for this problem, for N men and N rakhasasas???
0
When u try it, u will get a similar sequence automatically, else Rakshas' can eat man..
0
This is correct, it has to be 11
2 votes
I am denoting $M$ for man and $R$ for rakhsas.

Step 1 : Two rakhsasas row the boat from one side to another. So, one rakshas will reach other side. and one rakhsas will have to row back. So, first side now $(3M + 2R)$ and second side $(1R)$.

So, boat crosses $2$ times.

Step $2 : 2R$ row to other side and leaves one $R$ there and comes back to first side. So, now first side has $(3M + 1R)$ and second side has $(2R)$.

So, boat crosses $2$ times.

Step $3: 2$ $M$ row to other side and gets down at other side. So, first side has $(1R + 1M)$ and second side has $(2M+2R).$
So, boat crosses $1$ time.

Step 4: Now, $1M$ and $1R$ will have to row back from second side, and they will take $1M + 1M$ to other side. So, in the first side, we now have $2R$ and second side $(1R + 3M)$

So, boat crosses $2$ times.

Step 5: $1R$ will row back and take $1$ more $R$ with him. First side $1R$, second side $(2R, 3M).$

So, boat crosses $2$ times.

Step 6: Same step $5$ repeated.

So, boat crosses $2$ times.

Total number of times the boat crosses $=10+1 = 11$ times.

Correct Answer: $C$

edited by
0
8+1 rt?
0

Arjun

Sorry sir , my mistake. Now edited.

1
actually finally we need 4 more crossings - as in 2 crossings only 1 new R can cross.
0
In steps 3 to 5 , u hv made some mistake ,I guess..
0
boat cannot row while it is empty...step 3 is not correct.
1
In step 4, how did the boat come back?

So, 3 M's on the other side and an R came rowing back.

Step 5: it will take 2 other R's one by one. That makes total 8+3 = 11

11 is the correct answer.
0
answer is clearly wrong it should be 11 steps. @Arjun sir, kindly remove the best tag from this answer.
0

The answer seems right till step 4. The modification there after is given below.

At the end of step 4 the boat is at the right bank with 3M and 1R. The boat has to return to the left bank to pick the rest of the Rakshasas. So the boat goes back to left bank with 1R and the count becomes 8 meanwhile at the right bank we've 3M. 

Now we've 3R in the left bank. We need to row with 2R in the boat to the right bank, leaving 1R with other 3M. The count now is 9. The last Rakshasa can be taken in 2 crosses with any R/M accompanying the last R.

Thus the final count is 9 + 2 = 11.

@Arjun sir please note!

2 votes
Answer:

Related questions

7 votes
2 answers
1
372 views
Let there be a pack of $100$ cards numbered $1$ to $100$. The $i^{th}$ card states: "There are at most $i - 1$ true cards in this pack". Then how many cards of the pack contain TRUE statements? $0$ $1$ $100$ $50$ None of the above.
asked Nov 4, 2015 in Numerical Ability makhdoom ghaya 372 views
5 votes
1 answer
2
258 views
Consider the following two types of elections to determine which of two parties $A$ and $B$ forms the next government in the 2014 Indian elections. Assume for simplicity an Indian population of size $545545 (=545 * 1001)$. There are only two parties $A$ and $B$ and every ... forms govt. by election TYPE P, then it will also form the govt. by election TYPE C. All of the above None of the above.
asked Nov 4, 2015 in Numerical Ability makhdoom ghaya 258 views
14 votes
1 answer
3
1k views
Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, fraction $b$ prefer Birendra to Chanchal and fraction $c$ ... $(a, b, c) = (0.49, 0.49, 0.49);$ None of the above.
asked Nov 4, 2015 in Mathematical Logic makhdoom ghaya 1k views
7 votes
5 answers
4
603 views
Consider a well functioning clock where the hour, minute and the seconds needles are exactly at zero. How much time later will the minutes needle be exactly one minute ahead ($1/60$ th of the circumference) of the hours needle and the seconds needle again exactly at zero? ... an integer multiple of $1/60$ th of the circumference. $144$ minutes $66$ minutes $96$ minutes $72$ minutes $132$ minutes
asked Nov 5, 2015 in Numerical Ability makhdoom ghaya 603 views
...