MathDB
Problems
Contests
International Contests
EGMO
2014 EGMO
4
4
Part of
2014 EGMO
Problems
(1)
n divides 2i+j determines a sequence
Source: European Girls’ Mathematical Olympiad 2014 - Day 2 - P4
4/13/2014
Determine all positive integers
n
≥
2
n\geq 2
n
≥
2
for which there exist integers
x
1
,
x
2
,
…
,
x
n
−
1
x_1,x_2,\ldots ,x_{n-1}
x
1
,
x
2
,
…
,
x
n
−
1
satisfying the condition that if
0
<
i
<
n
,
0
<
j
<
n
,
i
≠
j
0<i<n,0<j<n, i\neq j
0
<
i
<
n
,
0
<
j
<
n
,
i
=
j
and
n
n
n
divides
2
i
+
j
2i+j
2
i
+
j
, then
x
i
<
x
j
x_i<x_j
x
i
<
x
j
.
modular arithmetic
number theory
EGMO
EGMO 2014
Divisibility