Smart questions on the Internet

 

1.5 pirates snatched 100 gems, each of which was of the same size and value. They decided:
(1) draw lots to determine your own number (1 ~ 5 );
(2) First, the allocation scheme is proposed by the first party, and then everyone votes. If more than half of the people agree to the allocation scheme, otherwise, they will be thrown into the sea to feed sharks;
(3) If the first day after the death of the first day, the second day will propose the allocation scheme, and then the remaining four people will vote. If and only when more than half of the people agree, allocate resources according to the plan; otherwise, they will be thrown into the sea to feed sharks;
(4) so on.
Condition: every pirate is a very intelligent person who can make reasonable judgments and make choices.
Q: What is the allocation scheme proposed by the first pirate to maximize the profits (and ensure that they do not die)

Answer: 1. When there are 4 or 5 people left, 5 will definitely vote against 4, because this can ensure the maximum benefit of 4. Therefore, when 3 is not dead, 4 is the most wise way to vote for 3, which can ensure that they do not die.

So for 3, the most wise method is:, 0, 0, which ensures that you do not die, and you can get the maximum benefit (here 4 is because you do not die to vote for 3)

2. when 2 is not dead, 1. as mentioned in, we only need to ensure that 2's own allocation method is better than 3's allocation method so that two people can gain more benefits, so we can ensure that they do not die, so for 2, the most wise thing is 98,0 ,.

3. when 1 is not dead, he only needs to ensure that 2 is better than the above. the allocation method of "2" mentioned in makes it possible for two people to gain more benefits and never die. For example:, 0, 0, 2.

The primary principle for everyone here is to ensure that they do not die, and then ensure that they have the most gems. When both of the above principles can be met, we must ensure that as many people are killed as possible. This article is embodied here. In 2., 2 can

In this way:, 0, so that for 5 and 2 after the death of, 0, 0 are not respectively, so 5 can vote against to kill 2, SO 2 only give 5 diamonds to save their lives.

2. there is a mountain with a temple on the mountain. There is only one way to go from the temple on the mountain to the foot of the mountain. Every Monday at, there is a clever little monk who goes down the mountain to save his fortune, at a.m. on Tuesday, I walked back to the temple on the mountain. The speed of the monk's mountain going up and down is arbitrary. In every round trip, he can always arrive at the same point on the mountain road at the same hour on Monday and Tuesday. For example, he once found that at on Monday and on Tuesday, he went to 3/4 on the foot of the mountain road and asked why?

A: The key is the red sentence. There is only one meeting in two days. At the beginning, I realized that I met each other from time to time and thought about it for a long time.

3. If you ask a worker to work for you for seven days, the return is a gold bar, which is evenly divided into seven connected segments. You must give them a gold bar at the end of each day. If you are only allowed to break the gold bars twice, how do you pay your workers?

A: It is divided into three segments: 1, 2, and 4:

Number of days in the hands of workers

1, 2, 4

2 2 1, 4

3 1, 2 4

4 4 1, 2

5, 4, 1 2

6, 4, 2 1

7 1, 2, 4

4. One train leaves Beijing at a rate of 15 kilometers per hour and goes straight to Guangzhou. Another train departs from Guangzhou to Beijing at a rate of 20 kilometers per hour. If there is a bird, the speed is 30 kilometers per hour.
Dudu and the two trains start at the same time. They depart from Beijing and return to the opposite direction when they encounter another train. In this way, they fly back and forth between the two trains in turn, until the two trains met. Excuse me, this bird flew together
How long is it?

A: It's called Waterloo, but it's clearly the best way of thinking.

5. you have two jars, each of which has several red balls and blue balls. The two are 50 red balls and 50 blue balls. A Random jar is selected and a ball is randomly selected, to enable

The probability of a red ball is the highest. How many red balls and blue balls should be put in the first two cans? In your plan, what is the exact chance of getting a red ball?

A: One can has one red ball (the total probability is higher than 50%), and the other can has 49 red balls and 50 blue balls (the highest probability of a red ball from the other can)

6. A manager has three daughters. The three daughters are 13 years old, and the three daughters are equal to the manager's age. One subordinate has known the manager's age, however, we still cannot determine the age of the three daughters of the manager,

At this time, the manager said that only one daughter had a black hair, and then the subordinate knew the age of the three daughters of the manager. What are the ages of the three daughters? Why?

A: The three daughters are respectively 9, 2, and 2 years old. Equal to 36. add up to 13.

Because only one is black hair. It indicates that only one is not a baby.
If one of them is 4 years old, there will be at least 2 more than 4 years old, there will be two black hair. It is inconsistent with the question.
The same is true if you are five years old, six years old, seven years old, or eight years old.
If you are ten years old, the other two are one and two years old. The manager is only 20 years old. Obviously not.
So the black hair is 9 years old.
The other two can also be one year and three years old. But the manager is only 27 years old. My eldest daughter is nine years old. Is the manager married at the age of 18? Obviously unreasonable .. So both are two years old.