15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

Find the missing number in the image below.

Replace the question mark in the picture below.

Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.

On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?

A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

Find The Next Number in this series.
1, 2, 6, 42, 1806 ?

Can you replace the question mark with the correct number?

Complete the following series. It.s very logical:

1, 4, 5, 6, 7, 9, 11, __?

John buys rice at Rs.60/kg from Britain and then sells them at Rs.5/kg in India. As a result of this, he becomes a millionaire. How come?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.