A man told his son that he would give him $1000 if he could accomplish the following task. The father gave his son ten envelopes and a thousand dollars, all in one dollar bills. He told his son, "Place the money in the envelopes in such a manner that no matter what number of dollars I ask for, you can give me one or more of the envelopes, containing the exact amount I asked for without having to open any of the envelopes. If you can do this, you will keep the $1000."
When the father asked for a sum of money, the son was able to give him envelopes containing the exact amount of money asked for. How did the son distribute the money among the ten envelopes?
The contents or the ten envelopes (in dollar bills) hould be as follows: $1, 2, 4, 8, 16, 32, 64, 128, 256, 489. The first nine numbers are in geometrical progression, and their sum, deducted from 1,000, gives the contents of the tenth envelope.
I am first in Earth, second in Heaven, I appear two times in a week.
You can only see me once in a year, although I'm in the middle of sea.
Who am I?
Answer is E
The asnwer is E. As In spelling of Earth E comes first, in Heaven it comes second, in week it comes twice, in a year it comes once and finally in spelling of sea E stands in middle of the spelling.
On the game show et´s Make a Deal, Monty Hall shows you three doors. Behind one of the doors is a new car, the other two hide goats. You choose one door, perhaps #1. Now Monty shows you what´s behind door #2 and it´s a goat.He gives you the chance to stay with original pick or select door #3. What do you do?
You should always abandon your original choice in favor of the remaining door (#3). When you make your first choice the chance of winning is 1 in 3 or 33%. When you switch doors, you turn a 2 in 3 chance of losing in the first round into a 2 in 3 chance of winning in the second round.
Search: Monty Hall problem
In the land of Brainopia, there are three races of people: Mikkos, who tell the truth all the time, Kikkos, who always tell lies, and Zikkos, who tell alternate false and true statements, in which the order is not known (i.e. true, false, true or false, true, false). When interviewing three Brainopians, a foreigner received the following statements:
I am a Mikko.
I am a Kikko.
a. They are both lying.
b. I am a Zikko.
Can you help the very confused foreigner determine who is who, assuming each person represents a different race?
Person 1 is a Miko.
Person 2 is a Ziko.
Person 3 is a Kikko.
As I was going to St. Ives
I met a man with seven wives
The seven wives had seven sacks
The seven sacks had seven cats
The seven cats had seven kits
Kits, cats, sacks and wives
How many were going to St. Ives?
One person is going to St. Ives (the narrator). Because the narrator "met" all of the others mentioned in the poem, this implies that they walked past each other in opposite directions, and thus none of the wives, sacks, cats, or kits was actually headed to St. Ives.
If you (like many) think this answer is a bit silly, you can assume that all the people, sacks, and animals mentioned were heading for St. Ives. In this case, we would have 1 narrator + 1 man + 7 wives + 49 sacks + 343 cats + 2401 kits = 2802 total going to St. Ives. However, this isn't the traditional answer.
A king has 100 identical servants, each with a different rank between 1 and 100. At the end of each day, each servant comes into the king's quarters, one-by-one, in a random order, and announces his rank to let the king know that he is done working for the day. For example, servant 14 comes in and says "Servant 14, reporting in."
One day, the king's aide comes in and tells the king that one of the servants is missing, though he isn't sure which one.
Before the other servants begin reporting in for the night, the king asks for a piece of paper to write on to help him figure out which servant is missing. Unfortunately, all that's available is a very small piece that can only hold one number at a time. The king is free to erase what he writes and write something new as many times as he likes, but he can only have one number written down at a time.
The king's memory is bad and he won't be able to remember all the exact numbers as the servants report in, so he must use the paper to help him.
How can he use the paper such that once the final servant has reported in, he'll know exactly which servant is missing?
When the first servant comes in, the king should write down his number. For each other servant that reports in, the king should add that servant's number to the current number written on the paper, and then write this new number on the paper.
Once the final servant has reported in, the number on the paper should equal
(1 + 2 + 3 + ... + 99 + 100) - MissingServantsNumber
Since (1 + 2 + 3 + ... + 99 + 100) = 5050, we can rephrase this to say that the number on the paper should equal
5050 - MissingServantsNumber
So to figure out the missing servant's number, the king simply needs to subtract the number written on his paper from 5050:
MissingServantsNumber = 5050 - NumberWrittenOnThePaper