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.
There is a river to cross using a river raft and there are eight people (father, mother, policeman, thief, 2 daughters and 2 sons). No one knows to operate the raft except the adults and also excluding the thief. Only two people can go in the raft at a time. The raft should keep coming back and forth in order to pick and drop the people.
Rules to be followed:
Father: the father cannot stay in the raft or outside the raft without the presence of the mother.
Mother: the mother cannot stay in the raft or outside the rat without the presence of the father.
Thief: the thief is not allowed to stay with any of the family members unless there is a policeman.
Policeman: the policeman can travel with anyone.
2 sons and 2 daughters: they are not allowed to travel in the raft without the presence of an adult. They cannot either travel in the presence of only thieves without the policeman. The sons cannot be with their mothers without their father's supervision. The daughters are not allowed to be there with their fathers without the supervision of their mothers. But the daughters and the sons can be left unsupervised (as long as the other rules are applied).
What is the sequence that the people should follow in order to cross the river through the raft keeping in mind all the rules?
The rules are applicable not only in the raft but also outside the raft.
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
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.