Forgot password? New user? Sign up
Existing user? Log in
From the set {1,2,3,...,n1,2,3,...,n1,2,3,...,n}, 101010 numbers are removed such that there is no Arithmetic Progression of length 111111 among the numbers left in the set.
Find the smallest nnn such that no matter which 101010 numbers are removed, there always is one Arithmetic Progression of length 111111.
Problem Loading...
Note Loading...
Set Loading...