I know there are two methods by using three time the same number with a plus(+) operator , you can make sum as 60.

One of them is 20+20+20.

whats the other way ?

A boy was driving a car, a girl took a lift from her. She asked his name. The boy said - my name is hidden in my car’s number, find it if you can. After this, she got down Car number was [ WV733N ] Can you guess the name now?

What is the unique property of the following words ?
* Revive
* Banana
* Grammar
* Voodoo
* Assess
* Potato
* Dresser
* Uneven

I have four wings but can't fly.
I express no emotions.
I am found on the exact spot every time you look.
I keep toiling away with a little sound.

Do you know what am I?

Let's play a word game. Following are some meaningless words that can be completed by adding random letters on either side of the word.

For example, the word "rdo" can be formed into "pardon".

Using the same technique, can you complete the given words?
ecalc
airb
rinci
tibac
uidel
gorit
igna
eyho

John was visiting his friend Jacob. He found out that his friend's wife had just killed a burglar in self-defense.
John asks Jacob about what happened and he told that "His wife was watching television when suddenly the bell rang. She thought that it is her husband Jacob but she found the burglar who attacked her instantly and she got so frightened that she killed the burglar immediately with the knife.
John asked the police to arrest his friend's wife. Why?

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?

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?

Place the numbers from 1 to 9 in the circles in a manner that each side of the triangle sums up to 17.

You need to pick one entry from pot A and one from pot B to have a perfect match. Can you do it?