Solution:

McLaughlin

Solution:

One for all or all for one.

Solution:

151 (131+20)

Explanation:
1st 7 prime numbers post 100 are
101 , 103 , 107 , 109 , 113 , 127 , 131
...Adding 20 to numbers
121 , 123 , 127 , 129 , 133 , 147 , 151

Solution:

Peter will have to use a lock box that can hold two locks. He will put the ring in a box and will mail it to Mary. Upon receiving the box, Mary will put her own lock box inside and will send back to Peter. Peter can then-then take off his lock and send it off to Mary again.

Solution:

Let the distance between Peter's (hereafter referred as P) and Rhea's (hereafter referred as R) be D.
When P and R meet for the first time, P has traveled 500 miles.
In that case, R has traveled (D - 500) miles.
=> Speed of P / Speed of R = 500 / (D - 500) ...... (1)

When P and R meet for the second time, P has traveled (D - 500) + 300 miles
Now, R has traveled (500 + D - 300)
=> Speed of P / Speed of R = 5 / (D - 5) ..... (2)

Equating (1) and (2)
500 / (D - 500) = (D - 2) / (D + 2)
D = 1200 Miles.

Solution:

3383

Explanation

Value of pi to 100 digits
3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679

and 264 are next four numbers.

Solution:

The color of the hat which the man A is wearing is the white color hat.
It is clear with the question and the clue itself that neither B nor C has information regarding this and therefore they do not answer. For the explanation, let's start from C. the man C can see man A's hat and also man B's hat. He must be seeing at least one white hat on any one of them. If he sees two black hats, then he clearly knows that he is wearing a white colored hat. But the man B cannot give an answer. He might see a white hat on man A. if the man B saw a black hat on A, he would know that he is wearing a white one. The question itself says that the man A answers to the question and therefore, the man A shouts that he is wearing a white one.

Solution:

Three options possible :

1. Father and child.
2. paternal uncle-aunt.
3. nephew and niece

Solution:

megalomaniac.

Camel (2, 4, 7, 2, 5 are Eastern beast of burden)
Main (1, 8, 10, 9 are street made famous by Sinclair Lewis)
Ago (11, 3, 6 are past)

Solution:

The main idea for getting the solution for this puzzle is that the pirate should know that he will be getting the treasure for the acceptance of the proposal. And if he gets to know that the treasure he is getting is less than the others then he will not accept the proposal. If the last one who is left is the pirate 1 then he will be the one who will be getting all the golden coins.


If pirate 1 would be the only one left, he would get all the golden coins. If only pirates 1 and 2 would be left, pirate 2 would die for sure, since pirate 1 is bloodthirsty and will reject all proposals of pirate 2 (since he will get all coins anyway). So:
| Pirate 1 | Pirate 2
----------------+------------+------------
Number of coins | 1000 | 0
----------------+------------+------------
Pirate agrees | No | Yes
When also pirate 3 would still be alive, he needs the agreement of one of the other two. Pirate 2 will agree with every proposal since, as we have seen, he would die if he did not. Therefore, pirate 3 should propose to keep everything for himself.
| Pirate 1 | Pirate 2 | Pirate 3
----------------+------------+------------+------------
Number of coins | 0 | 0 | 1000
----------------+------------+------------+------------
Pirate agrees | No | Yes | Yes
When we have four pirates, pirate 4 should make two other pirates agree with his proposal. Therefore, he proposes to give one coin to pirate 1, one coin to pirate 2, and the rest to himself. Pirates 1 and 2 will accept the proposal, since they are greedy, and if they would not accept, they would get less.
| Pirate 1 | Pirate 2 | Pirate 3 | Pirate 4
----------------+------------+------------+------------+------------
Number of coins | 1 | 1 | 0 | 998
----------------+------------+------------+------------+------------
Pirate agrees | Yes | Yes | No | Yes
However, as we know, there are five pirates. If pirate 5 gives both pirate 1 (or 2) and pirate 3 one coin more than in the previous case, they are willing to accept the proposal. Then a majority (three out of five) of the pirates will support the proposal, and pirate 5 can keep the rest of the treasure to himself.
| Pirate 1 | Pirate 2 | Pirate 3 | Pirate 4 | Pirate 5
----------------+------------+------------+------------+------------+------------
Number of coins | 2 | 0 | 1 | 0 | 997
----------------+------------+------------+------------+------------+------------
Pirate agrees | Yes | No | Yes | No | Yes
Conclusion: Pirate 5 should propose to give two coins to pirate 1 (or 2), one coin to pirate 3, and the remaining 997 coins to himself.