Cheesy's math casino and probability
by pithon_with_an_i, May 14, 2025, 1:33 PM
There are
people are playing a game at Cheesy's math casino, where
is a prime number. Let
be a positive integer. A subset of length
from the set of integers from
to
inclusive is randomly chosen, with an equal probability (
and is fixed). The winner of Cheesy's game is person
, if the sum of the chosen numbers are congruent to
for
.
For each
, find all values of
such that no person will sue Cheesy for creating unfair games (i.e. all the winning outcomes are equally likely).
(Proposed by Jaydon Chieng, Yeoh Teck En)
Remark










For each


(Proposed by Jaydon Chieng, Yeoh Teck En)
Remark
It has also been discovered (thanks to one of the contestants) that the problem is by no means original: In fact, the problem statement is just a subcase of USATST 2024 P3 and is similar to IMO 1995 P6, of which both have the AoPS links attached below. The proposer of this specific problem would like to apologise and reassure people that this mistake was not intentional, merely an oversight by the proposer himself for not being diligent enough.
IMO 1995/6:
https://artofproblemsolving.com/community/c6h15112p107230
USATST 2024/3:
https://artofproblemsolving.com/community/c6h3214874p29409068
IMO 1995/6:
https://artofproblemsolving.com/community/c6h15112p107230
USATST 2024/3:
https://artofproblemsolving.com/community/c6h3214874p29409068