As you can see that fifteen matches have been used to form an arrangement. What you have to do is remove any six of them to make them ten.

What does a man do only once in his lifetime, but women do once a year after they are 29?

We can be boring,Or interesting.
We can be long,Or short.
We can have pictures,Or just words.
Many love us,But many also hate us.
What are we?

Can you solve the below rebus?

Only one colour, 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?

A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?

In two decks of cards, what is the least amount of cards you must take to be *guaranteed* at least one four-of-a-kind?

You walk into a creepy house by yourself. There is no electricity, plumbing, or ventilation. Inside you notice 3 doors with numbers on them. Once you open the doors you will die a particular way. Door No.1 You’ll be eaten by a lion who is hungry. Door No.2 You’ll be stabbed to death. Door No.3 There is an electric chair waiting for you. Which door do you pick?

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?.

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?