Which is the smallest number that you can write using all the vowels exactly once?

Take number 1000 and then add 20 to it.
Now add 1000 one more time.
Now add 30.
Now add 1000 one more time.
Now add 40.
Now add 1000 one more time.
Now add 10.

What is the total?

A lion and its tamer are standing inside a cage that measures 1 unit in radius. Both of them can effortlessly run at the speed of 1 unit maximum.

1) Suppose the lion is hungry, will he be able to eat up the tamer?
2) If yes, how long can the tamer survive?

Find the mistake in the below maths equations

A = 2
A(A-1) = 2(A-1)
A2-A = 2A-2
A2-2A = A-2
A(A-2) = A-2
A = 1

A police officer was passing by when he saw a guy hiding. He walked up to him and genially asked, "What is your name?"

"Shut up!" the boy responded.

"Where are your manners?" asked the outraged police officer.

"Up that tree," said the boy discourteously, directing to a neighbouring tree.

You're looking for trouble, aren't you?" said the police officer.

"No, trouble is looking for me!" the boy answered solemnly.

Why is the boy behaving like this?

There was a kingdom in which the king had no heir to take over his thrown. Even the queen was dead and he himself was on the verge of dying. He thought about it and then summoned all of the teenagers. He gave one seed each to all of them and asked them to grow the plant. He announced that the one with the most beautiful plant will become the king/queen of the empire after the death of the king.

After a month, all of them were called. The king looked at all of the plants but announced the girl with an empty pot as the queen of the empire. Why?

Can you start the fire using two pieces of wood?

What Deficiency does the below rebus represent?

VIT_MIN

John killed hundreds of people mercilessly and yet the police were not able to put her behind the bars. Why?

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?