## Rectangular house

A man builds a house rectangular in shape. All sides have southern exposure. A big bear walks by, what color is the bear? Why?

White. The house is at the North Pole, so the polar bear.

A man builds a house rectangular in shape. All sides have southern exposure. A big bear walks by, what color is the bear? Why?

White. The house is at the North Pole, so the polar bear.

See also best riddles or new riddles.

Three people check into a hotel. They pay $30 to the manager and go to their room. The manager finds out that the room rate is $25 and gives $5 to the bellboy to return. On the way to the room, the bellboy reasons that $5 would be difficult to share among three people, so he pockets $2 and gives $1 to each person. Now, each person paid $10 and got back $1. So they paid $9 each, totalling $27. The bellboy has $2, totalling $29. )
Where is the remaining dollar?

Each person paid $9, totalling $27. The manager has $25 and the bellboy has $2. The bellboy's $2 should be added to the manager's $25 or substracted from the tenant's $27, not added to the tenants' $27.

What is the least number of people that need to be in a room such that there is greater than a 50% chance that at least two of the people have the same birthday?

Only 23 people need to be in the room.
Our first observation in solving this problem is the following:
(the probability that at least 2 people have the same birthday + the probability that nobody has the same birthday) = 1.0
What this means is that there is a 100% chance that EITHER everybody in the room has a different birthday, OR at least two people in the room have the same birthday (and these probabilities don't add up to more than 1.0 because they cover mutually exclusive situations).
With some simple re-arranging of the formula, we get:
the probability that at least 2 people have the same birthday = (1.0 - the probability that nobody has the same birthday)
So now if we can find the probability that nobody in the room has the same birthday, we just subtract this value from 1.0 and we'll have our answer.
The probability that nobody in the room has the same birthday is fairly straightforward to calculate. We can think of this as a "selection without replacement" problem, where each person "selects" a birthday at random, and we then have to figure out the probability that no two people select the same birthday. The first selection has a 365/365 chance of being different than the other birthdays (since none have been selected yet). The next selection has a 364/365 chance of being different than the 1 birthday that has been selected so far. The next selection has a 363/365 chance of being different than the 2 birthdays that have been selected so far.
These probabilities are multiplied together since each is conditional on the previous. So for example, the probability that nobody in a room of 3 people have the same birthday is (365/365 * 364/365 * 363/365) =~ 0.9918
More generally, if there are n people in a room, then the probability that nobody has the same birthday is (365/365 * 364/365 * ... * (365-n+2)/365 * (365-n+1)/365)
We can plug in values for n. For n=22, we get that the probability that nobody has the same birthday is 0.524, and thus the probabilty that at least two people have the same birthday is (1.0 - 0.524) = 0.476 = 47.6%.
Then for n=23, we get that the probability that nobody has the same birthday is 0.493, and thus the probabilty that at least two people have the same birthday is 1.0 - 0.493) = 0.507 = 50.7%. Thus, once we get to 23 people we have reached the 50% threshold.

Re-arrange the letters, O O U S W T D N E J R to spell just one word.

"Just one word".

Give me food, and I will live. Give me water, and I will die. What am I?

Fire.

It was a Pink Island. There were 201 individuals lived in the island. Among them 100 people were blue eyed people, 100 were green eyed people and the leader was a black eyed one.
Except the leader, nobody knew how many individuals lived in the island. Neither have they known about the color of the eyes. The leader was a very strict person. Those people can never communicate with others. They even cannot make gestures to communicate. They can only talk and communicate with the leader. It was a prison for those 200 individuals.
However, the leader provided an opportunity to leave the island forever but on one condition. Every morning he questions the individuals about the color of the eyes! If any of the individuals say the right color, he would be released. Since they were unaware about the color of the eyes, all 200 individuals remained silent. When they say wrong color, they were eaten alive to death. Afraid of punishment, they remained silent.
One day, the leader announced that "at least 1 of you has green eyes! If you say you are the one, come and say, I will let you go if you are correct! But only one of you can come and tell me!"
How many green eyed individuals leave the island and in how many days?

All 100 green eyed individuals will leave in 100 days.
Consider, there is only one green eyed individual lived in the island. He will look at all the remaining individuals who have blue eyes. So, he can get assured that he has green eyes! If there were more than one green eyed people, when the first man looks at the second one with green eyes, the person didn’t leave on day the first day. It means he also has green eyes and the same rule applies to each green eyed man.

The person who built it sold it. The person who bought it never used it. The person who used it never saw it. What is it?

It's a coffin.

What word does this rebus represents?
meta meta
meta meta

Metaphor (Meta 4).

You have 25 horses. When they race, each horse runs at a different, constant pace. A horse will always run at the same pace no matter how many times it races.
You want to figure out which are your 3 fastest horses. You are allowed to race at most 5 horses against each other at a time. You don't have a stopwatch so all you can learn from each race is which order the horses finish in.
What is the least number of races you can conduct to figure out which 3 horses are fastest?

You need to conduct 7 races.
First, separate the horses into 5 groups of 5 horses each, and race the horses in each of these groups. Let's call these groups A, B, C, D and E, and within each group let's label them in the order they finished. So for example, in group A, A1 finished 1st, A2 finished 2nd, A3 finished 3rd, and so on.
We can rule out the bottom two finishers in each race (A4 and A5, B4 and B5, C4 and C5, D4 and D5, and E4 and E5), since we know of at least 3 horses that are faster than them (specifically, the horses that beat them in their respective races).
This table shows our remaining horses:
A1 B1 C1 D1 E1
A2 B2 C2 D2 E2
A3 B3 C3 D3 E3
For our 6th race, let's race the top finishers in each group: A1, B1, C1, D1 and E1. Let's assume that the order of finishers is: A1, B1, C1, D1, E1 (so A1 finished first, E1 finished last).
We now know that horse D1 cannot be in the top 3, because it is slower than C1, B1 and A1 (it lost to them in the 6th race). Thus, D2 and D3 can also not be in the to 3 (since they are slower than D1).
Similarly, E1, E2 and E3 cannot be in the top 3 because they are all slower than D1 (which we already know isn't in the top 3).
Let's look at our updated table, having removed these horses that can't be in the top 3:
A1 B1 C1
A2 B2 C2
A3 B3 C3
We can actually rule out a few more horses. C2 and C3 cannot be in the top 3 because they are both slower than C1 (and thus are also slower than B1 and A1). And B3 also can't be in the top 3 because it is slower than B2 and B1 (and thus is also slower than A1). So let's further update our table:
A1 B1 C1
A2 B2
A3
We actually already know that A1 is our fastest horse (since it directly or indirectly beat all the remaining horses). So now we just need to find the other two fastest horses out of A2, A3, B1, B2 and C1. So for our 7th race, we simply race these 5 horses, and the top two finishers, plus A1, are our 3 fastest horses.

Dean Sam and Castiel are three brothers.
Interestingly their current age is prime.
What's more interesting that difference between their ages is also prime.
How old are they?

Sam : 2
Dean : 5
Castiel : 7
Age diff
7 - 2 = '5' is prime
7 - 5 = '2' is prime
5 - 2 = '3' is prime

Presume that you do not know what a rhino looks like. Now the question goes like this: If one day while walking in a forest with two of your close friends, one friend shows you an elephant and tells that this is a rhino, and another friend shows you a hippopotamus and tells you that this is rhino, who would you believe and why?

I told you that you do not know what a rhino looks like, not that you are unaware of what a hippo and elephant look like. So you shouldn't believe either of them.