MathDB
Problems
Contests
International Contests
Benelux
2018 Benelux
4
4
Part of
2018 Benelux
Problems
(1)
Benelux Olympiad 2018, Problem 4
Source: BxMO 2018, Problem 4
4/28/2018
An integer
n
≥
2
n\geq 2
n
≥
2
having exactly
s
s
s
positive divisors
1
=
d
1
<
d
2
<
⋯
<
d
s
=
n
1=d_1<d_2<\cdots<d_s=n
1
=
d
1
<
d
2
<
⋯
<
d
s
=
n
is said to be good if there exists an integer
k
k
k
, with
2
≤
k
≤
s
2\leq k\leq s
2
≤
k
≤
s
, such that
d
k
>
1
+
d
1
+
⋯
+
d
k
−
1
d_k>1+d_1+\cdots+d_{k-1}
d
k
>
1
+
d
1
+
⋯
+
d
k
−
1
. An integer
n
≥
2
n\geq 2
n
≥
2
is said to be bad if it is not good. (a) Show that there are infinitely many bad integers. (b) Prove that, among any seven consecutive integers all greater than
2
2
2
, there are always at least four good integers. (c) Show that there are infinitely many sequences of seven consecutive good integers.
BxMO
Benelux
number theory