A generous owner of a company decided to give a bonus of $45 to every man and $60 to every woman on his birthday. But only one-ninth of the men and one-twelfth of the women were present to take the bonus.

Can you calculate the amount of money the owner spent if there were 3552 employees?

Many have heard it, but nobody has ever seen it, and it will not speak back until spoken to. What is it?

What country can make you shiver?

A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.

How can the swan successfully escape?

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

Four friends are sitting on a tree. Each one of them is wearing a hat. They don't know which coloured hat are they wearing but they do know that two of them have green hats and two of them have orange hats.

Adam is sitting on the top branch and he can see the hats of Billy and Cyrus. Billy is sitting on a branch above Cyrus and he can see Cyrus hat. Duke is sitting at the base of the tree. Branches are covering him fully and no one can see his hat.

Now they are not allowed to look upwards. Who do you think will shout the colour of his hat first?

Six glasses are in a row. The first three are filled with milk and the last three are empty. By moving only one glass, can you arrange them so that the full and the empty glasses alternate?

See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.

What has many keys but can’t open a single lock?

What number should come in place of the question mark below?