There were three women in all the swimming costumes!
One was happy and the other two were sad!
The happy one was crying and the sad ones were smiling.
Why was this?

What two things can you never eat for breakfast?

In a contest, four fruits (an apple, a banana, an orange, and a pear) have been placed in four closed boxes (one fruit per box). People may guess which fruit is in which box. 123 people participate in the contest. When the boxes are opened, it turns out that 43 people have guessed none of the fruits correctly, 39 people have guessed one fruit correctly, and 31 people have guessed two fruits correctly.
How many people have guessed three fruits correctly, and how many people have guessed four fruits correctly

You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?

What is full of holes but still holds water?

When I got four, I have it none.
When I got two, I have it some.
When I got none, I have it all.

What is it?

If you're 8 feet away from a door and with each move you advance half the distance to the door. How many moves will it take to reach the door?

We have arranged an array of numbers below. What you have to do is use any kind of mathematical symbol you know excluding any symbol that contains a number like cube root. You can use any amount of symbols but you have to come up with a valid equation for all of them.

0 0 0 = 6
1 1 1 = 6
2 + 2 + 2 = 6
3 3 3 = 6
4 4 4 = 6
5 5 5 = 6
6 6 6 = 6
7 7 7 = 6
8 8 8 = 6
9 9 9 = 6

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?

A professor thinks of two consecutive numbers between 1 and 10.
'A' knows the 1st number and 'B' knows the second number

A: I do not know your number.
B: Nor do I know your number.
A: Now I know.

What are the four solutions for this?