MathDB
Problems
Contests
National and Regional Contests
Turkey Contests
Turkey MO (2nd round)
2009 Turkey MO (2nd round)
3
Turkey NMO 2009 Q6
Turkey NMO 2009 Q6
Source:
August 31, 2010
modular arithmetic
floor function
number theory proposed
number theory
Problem Statement
If
1
<
k
1
<
k
2
<
.
.
.
<
k
n
1<k_1<k_2<...<k_n
1
<
k
1
<
k
2
<
...
<
k
n
and
a
1
,
a
2
,
.
.
.
,
a
n
a_1,a_2,...,a_n
a
1
,
a
2
,
...
,
a
n
are integers such that for every integer
N
,
N,
N
,
k
i
∣
N
−
a
i
k_i \mid N-a_i
k
i
∣
N
−
a
i
for some
1
≤
i
≤
n
,
1 \leq i \leq n,
1
≤
i
≤
n
,
find the smallest possible value of
n
.
n.
n
.
Back to Problems
View on AoPS