MathDB

There are

2017

jars in a row on a table, initially empty. Each day, a nice man picks ten consecutive jars and deposits one coin in each of the ten jars. Later, Kelvin the Frog comes back to see that

N

of the jars all contain the same positive integer number of coins (i.e. there is an integer

d>0

such that

N

of the jars have exactly

d

coins). What is the maximum possible value of

N

Problem Statement