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.

There is a box full of marbles,
all but two are blue,
all but two are green,
and all but two are red.

How many marbles are in the box?

Can you solve the photo plexer logic ?

A man died and leaves Rs.10,000 in his will. There are 6 beneficiaries- his 3 sons and their wives. The 3 wives receive Rs.3960 of which Priyanka gets Rs.100 more than Tanu and Neha gets Rs.100 more than Priyanka.
Pramod gets twice as much as his wife, Tushar gets the same as his wife, and Prashant gets 50% more than his wife.

Who is married to whom?

A woman is sitting in her hotel room and hears a knock at the door. She opens the door to see a man whom she’s never met before. He says, “I’m sorry, I have made a mistake, I thought this was my room.” He then goes down the corridor and into the elevator. The woman goes back into her room and calls security. What made the woman so suspicious of the man?

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?

What can you catch but never throw?

What is the largest amount of money that you can possess in change and still if someone asks you for a dollar, you won't be able to give?

A girl rode into a tourist spot out of the city on Thursday. She loved the place and decided to stay for a few days. She stayed for four days and then she left for back home on Thursday.

How can this be possible?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?