Problem

Source: IOM 2017 day2 p4

Tags: combinatorics



Find the largest positive integer $N $ for which one can choose $N $ distinct numbers from the set ${1,2,3,...,100}$ such that neither the sum nor the product of any two different chosen numbers is divisible by $100$. Proposed by Mikhail Evdokimov