Solution:

1/5

There are six possible pairings of the two balls withdrawn,
Yellow+Yellow
Yellow+Green
Green+Yellow
Yellow+Black
Black+Yellow
Green+Black.

We know the Green + Black combination has not been drawn.

This leaves five possible combinations remaining. Therefore the chances tbowl the Yellow + Yellow pairing has been drawn are 1 in 5.

Many people cannot accept tbowl the solution is not 1 in 3, and of course it would be, if the balls had been drawn out separately and the color of the first ball announced as Yellow before the second had been drawn out. However, as both balls had been drawn together, and then the color of one of the balls announced, then the above solution, 1 in 5, must be the correct one.

Solution:

Set the first switches on for abt 10min, and then switch on the second switch and then enter the room.
Three cases are possible
1.Bulb is on => second switch is the ans
2.Bulb is off and on touching bulb , you will find bulb to be warm
=>1st switch is the ans.
3.Bulb is off and on touching second bulb , you will find bulb to be normal(not warm)
=>3rd bulb is the ans.

Solution:

Sansa has the siamese (conjoined) twin sister.

Solution:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93

Solution:

Selfie
Explanation:
: Selfie = is six letter word
: Self = The first four letter is me.
: e = The second and last letter are the same.
: fee = The fourth second and last letter are payment.

Solution:

charles put the ring into the box, secure it with one of your locks, and send the box to the girl firend.
She should then attach one of his own locks and return it. When you receive it again, remove your lock and send it back with her lock. Now she can unlock his own lock and retrieve the object.

Solution:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town

Solution:

This problem can be solved with algebra as well as logical reasoning. We are going to tell you how it is logically possible.

Be it any quantity that was present in the beginning and any liquid as well. We know that we have taken a spoonful from one glass and put it into another. Then, we have taken a spoonful from the other glass and put it into the first glass. So, at the end of it, the quantity of liquid in either glass remains same as it was in the beginning.

Therefore, we can conclude the fact that any amount of coke that is missing in the glass with coke will be present in the lemonade glass. Also, the same quantity of lemonade will be missing from the lemonade glass and will be present in the coke glass.

Solution:

He should shoot at the ground.

If Kangwa shoots the ground, it is Rafael's turn. Rafael would rather shoot at Ferdinand than Kangwa, because he is better.
If Rafael kills Ferdinand, it is just Kangwa and Rafael left, giving Kangwa a fair chance of winning.
If Rafael does not kill Ferdinand, it is Ferdinand's turn. He would rather shoot at Rafael and will definitely kill him. Even though it is now Kangwa against Ferdinand, Kangwa has a better chance of winning than before.

Solution:

If you ask the guard who always tells the truth, he would tell you the other guard would point you to the door of death. If you ask the guard who always lies, he would tell you the opposite door of the truth-telling guard and point you to the door of death. In either case, both guards will point to the door of death so you should choose the other one.

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa