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?
You have $100 with you and you have to buy 100 balls with it. 100 is the exact figure and you can't go below or above the numbers and you have to use the entire $100. If there is no kind of tax applied how many of each of the following balls will you be able to buy:
Green Balls costing $6
Yellow Balls costing $3
Black Balls costing $0.10
Now, how many of each must you buy to fulfil the condition given?
Find out a multi-digit number that if multiplied by the number 9 or any of its multiplications products (i.e. 18, 27, 36, 45,..) will result in the multiplication factor repeated (n) number of times.
One night, a man runs away from home. He turns left and keeps running. After some time he turns left again and keeps running. Later, he turns left one more time and runs back home—but when he gets home, he finds a man in a mask. Who was the man in the mask?
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.
