Only one color, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?

Can you solve this tricky maths equation problem by replacing it? mark with the correct symbol?

19834 -----: 187
15921 -----: 153
17561 -----: 139
13734 -----: ???

I cry without having a voice.
I fly without having wings.
I bite without having teeth.
I whisper without a mouth.

Who am I?

What is both possible and impossible at the same time?

A Miser man decided to go on a vacation for a month. He goes to the bank and asks for a trip loan of $500. The bank officer asks the man that the loan can only be approved when he mortgage some valuable thing at the bank. Miser man mortgages his only car whose worth was a whopping $80000. The Bank officer laughed at him and approve the loan instantly. After vacation when the miser man returns, the bank officer asked him "Are you an idiot, why is your mortgage such an expensive car for such a short loan?".

Miser man replied with some reason and the bank officer agreed that the miser man is actually not an idiot.

What did miser man reply to the bank loan officer?.

Today is John's birthday.
A year ago, John had five candles and he lit all the candles except the one at the last.
Now he is going to light all the candles.

How old is John Today?

(He is not five today.....)

In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.

No one wants to have it, but if one got it, he does not want to lose it. What is It?

There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.

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?