Solution:

Seven

Dividing the horses in a group of five, we will have five different groups of horses. A race will be conducted separately for each group which will help us find the fastest three horses in every group. We have used five different races till now.

Now we can have a race among the winners from every race which will help us determine the fastest of them all. We have used the sixth race.

The second fastest horse can be the one who came second in the sixth race or the second fastest horse in the finals winners' first race.

If we look at the first case, the third fastest horse can be the third fastest horse in the sixth race or the second fastest horse in either the fastest or second fastest horse first race.
If we look at the other case, the third fastest horse may be the second fastest in the sixth race or the third fastest in the final winners' first race.

If you calculate our assumptions, we have five more horses to race (seventh race) and determine the second fastest and the third fastest horse.

Solution:

There are 3 fruits (1 grapes, 1 apples, and 1 oranges).

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

You must put labels on the tablets as A and B before using. In that case, if you pour tablets together, you will get 3A, 2A 1B, 1A 2B or 3B. If they are from the same bottles you can take one from another bottle and save the remaining two for another day. If you get two from same and one from other, you can draw one from another bottle and you will have two pairs of which you can eat one and save the other.

Solution:

Steps:
1) Light fire on first bar from both the ends and second bar from one end.

2) After 30 seconds(when first bar gets completely burned out) , burn the second bar from second end as well.

3) When second run completely gets burned , you know its 45 seconds.

Solution:

LOTTO

Explanation:
Just flip the two rows 1 and 2 vertically, you will find the word "Lotto".

Solution:

It can be down as shown below.

Solution:

If you see the picture, they formed a pentagonal shape and achieved the required.

Solution:

If you are thinking to hold one chocolate from each box in hand and then balancing weight in bare hands, you are thinking all wrong.

Let us begin by labelling boxes as 1, 2, 3 and so on till 10.

Now pick one chocolate from box 1, two chocolates from box 2, three from box 3 and so on. In total, you will have 55 chocolates now. (1 + 2 + 3 + ..... + 10)

The ideal weight of the chocolates should be 55 * 20 = 1100. However, somewhere in there are the defected chocolate/s.

You can judge that clearly by noting down the result of 1100 - total weight of chocolates. If the weight is less than 1 gram, the defected box is box 1, if the weight is less than 2 grams, the defected box is box 2 and so on.

Solution:

45 minutes

Explanation :
All you have to do is burn the first rope from both the ends and the second rope from one end only simultaneously. The first rope will burn in 30 minutes (half of an hour since we burned from both sides) while the other rope would have burnt half. At this moment, light the second rope from the other end as well. Where, the second rope would have taken half an hour more to burn completely, it will take just 15 minutes as we have lit it from the other end too.

Thus you have successfully calculated 30+15 = 45 minutes with the help of the two given ropes.

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.