A and B plays the following game: they choose randomly k integers from {1,2,…,100}; if their sum is even, A wins, else B wins. For what values of k does A and B have the same chance of winning? functionmodular arithmeticalgebrabinomial theoremcombinatorics unsolvedcombinatorics