Current location - Training Enrollment Network - Mathematics courses - There is a king to entertain distinguished guests. There are 1 000 bottles of wine, of which 1 bottle has been poisoned. How many people do you need at least to find out where the poisoned wine is?
There is a king to entertain distinguished guests. There are 1 000 bottles of wine, of which 1 bottle has been poisoned. How many people do you need at least to find out where the poisoned wine is?
1 attempt requires 192 people. This is the method of number synthesis, and the prime number synthesis is the best and fastest. (There is enough wine)

Wine number 1- 1000

The number of people is a prime number within 1000.

We need 9 people on the 2nd, 6 people on the 3rd, 4 people on the 5th and 3 people on the 7th, (1 1 7, 19, 23, 29, 3 1) and 2 people each, (37, 4). 10 1, 103, 107, 109, 1 13, 127, 13 1, 137, 139, 149, 15 1, 157, 163, 167, 173, 179, 18 1, 19 1, 193, 197, 199,2 1 1,223,227,229,233,239,24 1, 25 1,257,263,269,27 1,277,28 1,283,293,307,3 1 1, 3 13,3 17,33 1,337,347,349,353,359,367,373,379,383,389,397, 40 1,409,4 19,42 1,43 1,433,439,443,449, 457,46 1,463,467,479,487,49 1,499,503,509,52 1,523,54 1,547,557,563, 569,57 1,577,587,593,599,60 1,607, 6 13,6 17,6 19,63 1,64 1,643,647,653,659,66 1,673,677,683,69 1, 70 1,709,7 19,727,733, 739,743,75 1,757,76 1,769,773,787,797,809,8 1 1,82 1,823,827,829,839,853,857,859,863,877, 88 1,883,887,907, 9 1 1,9 19,929,937,94 1,947,953,967,97 1.

The number of people with n is calculated as integer value 1og(n) 1000, so * * * 9+6+4+3+6 * 2+158 =192 people.

The drinking method is: break down the quantity of wine into the corresponding number of people to drink, for example, the number 12(2*2*3) wine is drunk by two No.2 people and 1 No.3 people.

Judgment method: find out all the poisoned people and multiply them to get the number of poisoned wine.

The best result is that 0 people are poisoned (No.65438 +0 is poisoned wine), and the worst result is that 9 people are poisoned (29 = No.565438 +02 is poisoned wine).