Find the hidden tiger in the given optical illusion ?

You were playing ping pong with your friend. Suddenly the ball fell into a narrow metal pipe that was imbedded in the concrete surface of the floor one foot deep. Now you don't have any other ball and you desperately want to take it out and play. You and your friend have your shoelaces, your tennis paddle and a plastic water bottle. However, the bottle cannot fit into the pipe.

How will you take the ball out?

A man is sitting in a bar when a rich man sits next to him. He turns to the rich man and says, “Did you know I know almost every song that has ever existed?”

The rich man laughs. The man then says, “I bet you all the money you have in your wallet that I can sing a genuine song with a lady’s name of your choice in it. The rich man laughs again and says, “OK, how about my daughter’s name, Jamie Armstrong-Miller?” Minutes later, the man collects his cash and the rich man goes home cashless. What song did the man sing?

Can you count the number of squares in the figure below?

A car meter reading shows 72927 miles a palindromic number.
what is the minimum number of miles you would need to travel to see another palindromic number on the car meter reading?

Can you solve the equation by finding the value of
A) Horse
B) Cowboy boot
C) Horseshoe

In the Picture?

One evening there was a murder in the home of a married couple, their son and daughter. One of these four people murdered one of the others. One of the members of the family witnessed the crime.

The other one helped the murderer.

These are the things we know for sure:

1. The witness and the one who helped the murderer were not of the same sex.

2. The oldest person and the witness were not of the same sex.

3. The youngest person and the victim were not of the same sex.

4. The one who helped the murderer was older than the victim.

5. The father was the oldest member of the family.

6. The murderer was not the youngest member of the family.

Who was the murderer?

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?

If I remove one from eleven it becomes Ten and if I remove one from nine also becomes Ten. How?

What jumps when it walks and sits when it stands?