A math reasoning game problem A math problem in a game

0 sheets. A said, "At most, one of your estimates is right." It means that only one of the three people B, C, and D said it correctly or all said it wrong, then there are the following four situations:

1. Assuming that B is right, then C is wrong and D is right, which is not in line with what honest A says;

2. Assuming that C is right, B is wrong, and D can be right or not (D says at least 1 can exceed 100 or not).

3. Assuming that D is right, then both B and C may be right, but only one person is right and the other is wrong (B and C are contradictory), so at least two people are right (one of D, B and C).

4. Assuming that B, C, and D are all wrong, and B and C cannot be all wrong, this assumption is unreasonable.

From this it follows that the second case is correct, and D is incorrect. Then the final result is: the number of stamps for A is less than 100, the number of stamps for A is less than 100, and the number of stamps for A is less than 100, and the number of stamps for A is not right for D.

So, the answer is that A has 0 stamps.

0 sheets. Because A is an honest man, he must be right when he says it. So at most one of b, c, and d is right, that is, all of them are wrong, or only one is right.

If all three of them are wrong, it is not true. If B is right, then C must also be right, and it is not true. Therefore b must be wrong.

And b, c contradictory, so c must be right. If C is correct, D is required to be wrong, i.e. A has only 0 stamps.

D is right, A has at least 1 stamp in the set.

Reason: Assuming B is right, then D is wrong, and A should have at least 1 stamp. So that's wrong.

Assuming C is right, D is still wrong, and A should have at least one stamp.

The answer is as follows: A: 2 is Songshan, 3 is Huashan, B: 4 is Hengshan, 2 is Songshan, C: 1 is Hengshan, 5 is Hengshan, D: 4 is Hengshan, 3 is Songshan, E: 2 is Huashan, 5 is Taishan.

The teacher found that all five students were only half right, so what should be the correct statement?

Answer: Assuming that the first half of A's sentence is correct and the second half of the sentence is wrong, then 2 is Mount Tai and 3 is not Mount Hua; Because everyone said half a sentence correctly and half a sentence wrong, it can be deduced that the first half of the sentence is wrong, and the second half of the sentence is correct, that is, 2 is not Huashan, and 5 is Mount Tai. This is what A said"2 is Tarzan"Contradictions arise, so assumptions are wrong.

For every 6 bottles of soda, you can drink 7 bottles of soda + 1 empty bottle.

6+5 bottles of soda can drink 13 bottles of soda + 1 empty bottle.

For every 5 bottles of soda you buy, you can drink 6 bottles.

So it's 131 bottles.

6 empty bottles can be replaced with one bottle (note that this bottle includes the bottle) so:

5 empty bottles can be exchanged for one bottle'There are no bottles of soda'.

So buy a bottle, in fact, you can drink it is:

1 + 1 5 = 6 5 bottles.

So at least need to buy:

157 (6 5) = bottles, since there are no decimals, it is at least 131 bottles.

This is known as "Very 6+1".

157 6 = 26 remainder 1

26 6 = 4 remaining 2

Actually, I only bought 22*6=132 bottles.

Then 22 bottles were given away.

Swap back to 22 6 = 3 bottles (remainder not counted).

So drink a total of 132 + 22 + 3 = 157 bottles.

This is simple, that is, you can drink 6 bottles of soda if you buy 5 bottles, and the last bottle is just enough to make up so 157 6 = 26 and 1

So, it's like buying 5 bottles 26 times, plus 1

A total of 131, which is at least.

1, this equation is roughly like this: suppose you buy at least x bottles, x+x 6+x 36+x 216... =157, x is the bottle that started at the beginning, x 6 is the bottle that was bought after drinking for the first time, x 36 is the bottle that was bought after drinking for the second time, x 216 is the bottle that was bought after drinking for the third time...

2. It can be estimated that x will not be greater than 216, that is, the third time x 216 cannot be bought, so the effective part is x+x 6+x 36=157

3, x=, the bottle is 132.

If the value is 314, there are three cases: 314-20,314+(1198-314) 2,314*2, and the maximum value is 314+(1198-314) 2=756

If the value is 935, there are the following three scenarios: 935-20,935+(1198-935) 2,935*2, and the maximum value is 935*2=1870

Let the optimal values be x,x-20,x+(1198-x) 2,2x, and x is [314,935].

It can be seen that when x is larger x-20, x 2+599, 2x is larger, and x-20 is less than x 2+599 is less than 2x, x=935 is obtained

It should be 27, and the derivation process is as follows. Odd number columns.

The law is. 29+(12)=41, the number of the odd number series is added to 3, 6, 9, 12 is equal to the next number of the odd number, 3, 6, 9, 12 are multiples of 3, 2, 3, 4 respectively.

According to the law of odd number sequences, add 1, 2, and 3 times of 4 respectively, that is, 4, 8, and 12, and finally obtain the result 27, and the process is as follows.

There are no options, it may be that the question was copied incorrectly or incorrectly.

27 absolutely.

You need to check your options for errors.

The difference between 2 numbers is a common multiple of 4.

From 1x to 3x.

If you have any questions, you can ask them.

The Math Tutoring Team is here to help.

Each person paid 10 yuan, and each received 1 yuan back, for a total of 27 yuan.

Of the 27 yuan, 2 yuan was embezzled, so the boss only received 25 yuan.

The problem is in the 27+2 step. The 2 yuan that the waiter hid was originally from 27 yuan, and it could not be added to 27.

Since everyone only spent 9 yuan, it only cost 27 yuan in total, the boss got 25 yuan, and the waiter got 2 yuan, right.

The problem is that 3 x 9 = 27 yuan, everyone's meal money is 25 3 1=, infinite loop, and the correct solution is 3 rounded.

As shown in the figure below, it should be solved with an equal proportional sequence.

Game 1: There are 25 stones in a pile. You can take one, two, or three at a time, you can't take more, and whoever gets the last one loses.

Xiao Ming thinks: Whoever takes it first has a better chance of winning, so he rushes to take it first. Xiao Qiang didn't think so, so let Xiao Ming take it first.

Xiao Ming came out with a 3, Xiao Qiang also came out with a 3, Xiao Ming came out with 3, and Xiao Qiang also came out with a 3....Xiao Ming went out until 21, Xiao Qiang thought:

You're dead! came out with a 3, and Xiao Ming lost.

In the second game, Xiao Ming let Xiao Qiang go first. Xiao Qiang out of a 2, Xiao Ming out of 3, Xiao Qiang out of 1, Xiao Ming out of 2, Xiao Qiang out of 3, Xiao Ming out of 3, Xiao Qiang out of 1, Xiao Ming out of 2, Xiao Ming out of 1, Xiao Ming out of 3, as a result, Xiao Ming is 21 again (needless to say that Xiao Qiang won again). After losing two games in a row, Xiao Ming became suspicious of Xiao Qiang and said:

Is there any secret? "Do you know the secret?