Subcontests
(6)Most probable sum - 2015 PAMO Problem 5
There are seven cards in a hat, and on the card k there is a number 2k−1, k=1,2,...,7. Solarin picks the cards up at random from the hat, one card at a time, until the sum of the numbers on cards in his hand exceeds 124. What is the most probable sum he can get? Some sum is divisible by 2015 - 2015 PAMO Problem 3
Let a1,a2,...,a11 be integers. Prove that there are numbers b1,b2,...,b11, each bi equal −1,0 or 1, but not all being 0, such that the number
N=a1b1+a2b2+...+a11b11
is divisible by 2015.