Maths Problems Thread

[Flames]

#11

Spoiler

First number the prisoners from 0 to 9. Then the wine bottles from 0 to 999.
Then lets make the poor prisoner 0 sample every odd numbered wine bottle.
After that group the bottles into blocks of 2. Prisoner 1 must sample all the odd numbered groups, group the bottles into group of 4 and get priosoner 2
to sample the odd numbered groups. Then group them into 8's and so on until the last prisoner gets bottles numbered from 512 to 999. After the poison takes action many prisoners will die. Decode their numbers as a binary digit in a 10bit number. This will locate the bad bottle.