John is asked to stand behind Jacob and Jacob is asked to stand behind John. Both of them feel confused about it and don't know what to do?

But it is quite possible, do you know how?

A man is shown a portrait painting. He looks closely, then tells, “Brothers and sisters have I none, but that man’s father is my father’s son!” Who is the man in the portrait?

Vin Diesel is pulling a theft and has planned to run away with all the cash kept in the safe. But the only way to open the safe is the 13 character password. He has a set of five clues given to him by a trustworthy source.

Exactly two of the below statements are false.
The password is contained within this sentence.
The password is not in this hint.
The password is within only one of these statements.
At least one of the above statements is a lie.

Rob is taller than Edwin, and Jurgen is shorter than Rob.
Of only one of the following statements, we now certainly know it is correct:

A.Edwin is taller than Jurgen
B.Jurgen is taller than Edwin
C.It cannot be determined if Jurgen or Edwin is the tallest.

John is selling fruits.
He sells grapes at $30, Dates $25, and a Wolfberry $45.
At what price does he sell fig?

PS: Logical Thinking

One day Jenifer meets the Lion and the Tiger in the Forest of Forgetfulness. She knows that the Lion lies on Mondays, Tuesdays, and Wednesdays, and tells the truth on the other days of the week. The Tiger, on the other hand, lies on Thursdays, Fridays, and Saturdays, but tells the truth on the other days of the week. Now they make the following statements to Jenifer:

Lion: Yesterday was one of my lying days.

Tiger: Yesterday was one of my lying days too.

What day is it?

My location can be determined by the below rebus.
So where am i ?

Replace the question mark with the correct number.

2 + 2= 4
3 + 3= 18
4 + 4= 48
5 + 5= ?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.