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?

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

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?

Before reading ahead, you must know the fact that only one of the people here is telling the truth.

A says that B is lying.
B says that C is lying.
C says both A and B are lying.

Can you find out who is speaking the truth?

Can you name three consecutive days without using the words Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, or Sunday?

A man is walking down a road with a basket of eggs. As he
is walking he meets someone who buys one-half of his eggs
plus one-half of an egg.
He walks a little further and meets another person who buys
one-half of his eggs plus one-half of an egg.
After proceeding further he meets another person who buys
one-half of his eggs plus one half an egg. At this point, he
has sold all of his eggs, and he never broke an egg.
How many eggs did the man have to start with?

You see a boat filled with people, yet there isn’t a single person on board. How is that possible?

Here is a mathematical expression that also secretly tells a movie name. What movie is that?

For an extra income, John decided to work at a Hotel for one hour daily. The manager offers him that they will pay him $11 after every 11 days.
However, John offered a different proposition to the manager. The offers stand as:
He will be paid just a penny on his first day.
Two pence will be paid on the second day,
Four pence will be paid on the third day.
And so on till the 11th day.

Should the Hotel manager accept his offer?

You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'

How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?