I have branches, but no fruit, trunk or leaves. What am I?

There is something which you can be arrested for attempting but not for successfully completing.

Find three numbers such that When we multiply three numbers, we will get the prime numbers. The difference between the second and the first number is equal to the third and second.

The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Take away my first letter, then take away my second letter. Then take away the rest of my letters, yet I remain the same. What am I?

There is a straight highway. Four different villages lie on that highway. The distance between them is different. The third village is 60km away from the first village; the fourth is 40 km away from the second; the third is 10 km near to the fourth that it is to the second.

Can you calculate the distance between the fourth and the first village ?

There was a competition where the contestants had to hold something. At the end of the event, the winner was a person who had no hands or feet. What was it that the contestants had to hold?

Jack and Joseph are well-known golf rivals. One Day during a match, they were level at a score of 30. Jack hit a bad shot and Joseph added 10 to his score. Joseph then hit an awesome shot and he won the game.

How ?

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.

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?