# Variation of 100 prisoners [duplicate]

There are 100 prisoners, each prisoner is given a number between 1 and 100 without knowing which number, the number can repeat and not all of the numbers must be given.

Each prisoner in his turn can guess his number, if he succeed, all of the prisoners are freed (they cant hear the other guesses).

Each prisoner is also given a list of the other prisoners numbers.

The prisoners have a chance to plot their strategy before the list is given.

What is the optimal plan?

• Are they numbers between 1 and 100, or between 1 and 100 inclusive? Would they all be freed if just one prison gets their number right? Is it a requirement that no wrong guesses could be made? If the prisoners can't hear other guesses, can they see other prisoners? Dec 10 '20 at 22:35
• Number here refers to only whole numbers, correct? Like e, for instance, is between 1 and 100, but it is not a whole number. Is that allowed? Dec 11 '20 at 0:03
• @Chipster I don't think that's allowed. Dec 12 '20 at 19:40

Assign the $$n$$th prisoner to guess the number which would make the total sum (of all prisoners numbers) congruent to $$n$$ modulo $$100$$.