Problems(1)
Suppose Pat and Rick are playing a game in which they take turns writing numbers from {1,2,…,97} on a blackboard. In each round, Pat writes a number, then Rick writes a number; Rick wins if the sum of all the numbers written on the blackboard after n rounds is divisible by 100. Find the minimum positive value of n for which Rick has a winning strategy. 2017team