MathDB
Turkey NMO 2009 Q6

Source:

August 31, 2010
modular arithmeticfloor functionnumber theory proposednumber theory

Problem Statement

If 1<k1<k2<...<kn1<k_1<k_2<...<k_n and a1,a2,...,ana_1,a_2,...,a_n are integers such that for every integer N,N, kiNaik_i \mid N-a_i for some 1in,1 \leq i \leq n, find the smallest possible value of n.n.