Jack was having a candle light dinner with his girlfriend. Suddenly a cold gush of wind entered through the open window and three of the ten candles were extinguished. Assuming that none of the other candles were extinguished.
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
A girl was sitting in her hotel room when she heard a knock on the door. She opened the door and found that a man was standing outside.
The man said, "Oh! I am really sorry, I thought this was my room."
He then walked through the corridor to the elevator. The girl did not know the man. She closed her door and called security asking them to apprehend the man.
What made her suspicious of that man? He might have been genuinely mistaken.
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.
