Solution:

Daughter.

Solution:

9

Explanation:
2 < 3 < 5
To find out the required number of candies, take one in place of the least number (i.e. take one mango candy) and then add all the greater numbers (i.e. three strawberry and five pineapple candies) to it.

Required number of balls = 1 + 3 + 5 = 9.

Solution:

13 x 3 + 1 = 40

The number of decks is absolutely not relevant here which means whether we mix 5 or 500 cards still results would be same.
Any card drawn will be a Ace,2,3,4,5,6,7,8,9,10,Jack,Queen or King, so there are 13 possibilities each time a card is drawn.
If you are lucky just 5 cards of the same kind can be obtained in 4 steps

The unluckiest(worst) way is our solution as we need to guarantee a four of a kind.
Draw 3 of each kind =>now we have 39 cards. Next card will guarantee 4 of a kind.

Solution:

The node can be connected as shown.

Solution:

He simply suggested that one of the brothers will be allowed to divide the land but he must take into consideration that it will be the other one who will have a choice of selecting his land between the two halves first.

Thus both will be happy in such manner.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

Treasure Map Is Hidden Inside The Hanging Room Floor.

Explanation.
Just reverse the text "roolF mooR gnignaH ehT edisnI neddiH sI paM erusaerT".

Solution:

Yes, some people are going get really tiny pieces but you were allowed for that right. Also, there is another way of doing it. Can you think of it?

Solution:

Let m be initial number of flowers and n be the flowers offered at each temple by the man.
Initial flowers = m
After stepping into the first temple = 2m
Flowers offered at the first temple = n
Remaining flowers = 2m – n

After stepping into the second temple = 4m – 2n
Flowers offered at the second temple = n
Remaining flowers = 2m – n

After stepping into the third temple = 8m – 6n
Flowers offered at the third temple = n
Remaining flowers = 8m – 7n

Now as per the question (8m – 7n) must be equal to 0.
i.e. 8m – 7 n = 0
or 8m = 7y

Now the least numbers required to solve this equation are 7 and 8 for m and n respectively.

Thus m = 7; n = 8
Which means, the man had 7 flowers in the beginning and he offered 8 flowers at each temple.

Solution:

To do it, the marbles must be arranged as the vertices of an octahedron. If you are unsure, check the image below.

Solution:

The girl was born on 29 February. Thus her birthday came once in four years only while her sister was born on a normal day and celebrated her birthday every year. Thus the girl had a chance of depositing money only 10 times in 4 years through which she collected $2500 while her sister took $50 from the piggy bank every year making the total amount to be $2000. Thus when the piggy bank was opened, it had just $500.