Find The Next Number In The Sequence

30 10 15 13 0 16 -15 ?

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.

This is a famous paradox which has caused a great deal of argument and disbelief from many who cannot accept the correct answer. Four balls are placed in a hat. One is white, one is blue and the other two are red. The bag is shaken and someone draws two balls from the hat. He looks at the two balls and announces that at least one of them is red. What are the chances that the other ball he has drawn out is also red?

In case you were starting to feel confident, this one was meant for third graders in Vietnam. The answer is 66, but we don't blame you for scratching your head about how they got there.

In an Art Gallary, When the clock hit 11 am, Artist hung the painting number 30. When it struck 4 pm, he hung painting number 240 and when it struck 7:30 pm, he hung painting number 315.

Can you determine, which painting number will he hang when the time is 9:20 pm?

A four-digit number (not beginning with 0) can be represented by ABCD. There is one number such that ABCD=A^B*C^D, where A^B means A raised to the B power. Can you find it?

There is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.

You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?

Can you make a six-letter word using the letters N, A and B ?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

A mules travels the same distance daily.
I noticed that two of his legs travels 10km and the remaining two travels 12km.
Obviously two mules legs cannot be a 2km ahead of the other 2.

The mules is perfectly normal. So how come this be true ?