MathDB
Problems
Contests
National and Regional Contests
China Contests
China National Olympiad
2021 China National Olympiad
2021 China National Olympiad
Part of
China National Olympiad
Subcontests
(6)
5
1
Hide problems
2021 China MO P5 -- A Neat Graph Theory Problem
P
P
P
is a convex polyhedron such that:(1) every vertex belongs to exactly
3
3
3
faces.(1) For every natural number
n
n
n
, there are even number of faces with
n
n
n
vertices.An ant walks along the edges of
P
P
P
and forms a non-self-intersecting cycle, which divides the faces of this polyhedron into two sides, such that for every natural number
n
n
n
, the number of faces with
n
n
n
vertices on each side are the same. (assume this is possible)Show that the number of times the ant turns left is the same as the number of times the ant turn right.
4
1
Hide problems
Sum of angles are equal
In acute triangle
A
B
C
(
A
B
>
A
C
)
ABC (AB>AC)
A
BC
(
A
B
>
A
C
)
,
M
M
M
is the midpoint of minor arc
B
C
BC
BC
,
O
O
O
is the circumcenter of
(
A
B
C
)
(ABC)
(
A
BC
)
and
A
K
AK
A
K
is its diameter. The line parallel to
A
M
AM
A
M
through
O
O
O
meets segment
A
B
AB
A
B
at
D
D
D
, and
C
A
CA
C
A
extended at
E
E
E
. Lines
B
M
BM
BM
and
C
K
CK
C
K
meet at
P
P
P
, lines
B
K
BK
B
K
and
C
M
CM
CM
meet at
Q
Q
Q
. Prove that
∠
O
P
B
+
∠
O
E
B
=
∠
O
Q
C
+
∠
O
D
C
\angle OPB+\angle OEB =\angle OQC+\angle ODC
∠
OPB
+
∠
OEB
=
∠
OQC
+
∠
O
D
C
.
6
1
Hide problems
China MO 2021 P6
Find
f
:
Z
+
→
Z
+
f: \mathbb{Z}_+ \rightarrow \mathbb{Z}_+
f
:
Z
+
→
Z
+
, such that for any
x
,
y
∈
Z
+
x,y \in \mathbb{Z}_+
x
,
y
∈
Z
+
,
f
(
f
(
x
)
+
y
)
∣
x
+
f
(
y
)
.
f(f(x)+y)\mid x+f(y).
f
(
f
(
x
)
+
y
)
∣
x
+
f
(
y
)
.
2
1
Hide problems
m divides linear sum of sequences
Let
m
>
1
m>1
m
>
1
be an integer. Find the smallest positive integer
n
n
n
, such that for any integers
a
1
,
a
2
,
…
,
a
n
;
b
1
,
b
2
,
…
,
b
n
a_1,a_2,\ldots ,a_n; b_1,b_2,\ldots ,b_n
a
1
,
a
2
,
…
,
a
n
;
b
1
,
b
2
,
…
,
b
n
there exists integers
x
1
,
x
2
,
…
,
x
n
x_1,x_2,\ldots ,x_n
x
1
,
x
2
,
…
,
x
n
satisfying the following two conditions: i) There exists
i
∈
{
1
,
2
,
…
,
n
}
i\in \{1,2,\ldots ,n\}
i
∈
{
1
,
2
,
…
,
n
}
such that
x
i
x_i
x
i
and
m
m
m
are coprimeii)
∑
i
=
1
n
a
i
x
i
≡
∑
i
=
1
n
b
i
x
i
≡
0
(
m
o
d
m
)
\sum^n_{i=1} a_ix_i \equiv \sum^n_{i=1} b_ix_i \equiv 0 \pmod m
∑
i
=
1
n
a
i
x
i
≡
∑
i
=
1
n
b
i
x
i
≡
0
(
mod
m
)
1
1
Hide problems
Inequality "behind" complex numbers
Let
{
z
n
}
n
≥
1
\{ z_n \}_{n \ge 1}
{
z
n
}
n
≥
1
be a sequence of complex numbers, whose odd terms are real, even terms are purely imaginary, and for every positive integer
k
k
k
,
∣
z
k
z
k
+
1
∣
=
2
k
|z_k z_{k+1}|=2^k
∣
z
k
z
k
+
1
∣
=
2
k
. Denote
f
n
=
∣
z
1
+
z
2
+
⋯
+
z
n
∣
,
f_n=|z_1+z_2+\cdots+z_n|,
f
n
=
∣
z
1
+
z
2
+
⋯
+
z
n
∣
,
for
n
=
1
,
2
,
⋯
n=1,2,\cdots
n
=
1
,
2
,
⋯
(1) Find the minimum of
f
2020
f_{2020}
f
2020
. (2) Find the minimum of
f
2020
⋅
f
2021
f_{2020} \cdot f_{2021}
f
2020
⋅
f
2021
.
3
1
Hide problems
China Mathematical Olympiad 2020 Q3
Let
n
n
n
be positive integer such that there are exactly 36 different prime numbers that divides
n
.
n.
n
.
For
k
=
1
,
2
,
3
,
4
,
5
,
k=1,2,3,4,5,
k
=
1
,
2
,
3
,
4
,
5
,
c
n
c_n
c
n
be the number of integers that are mutually prime numbers to
n
n
n
in the interval
[
(
k
−
1
)
n
5
,
k
n
5
]
.
[\frac{(k-1)n}{5},\frac{kn}{5}] .
[
5
(
k
−
1
)
n
,
5
kn
]
.
c
1
,
c
2
,
c
3
,
c
4
,
c
5
c_1,c_2,c_3,c_4,c_5
c
1
,
c
2
,
c
3
,
c
4
,
c
5
is not exactly the same.Prove that
∑
1
≤
i
<
j
≤
5
(
c
i
−
c
j
)
2
≥
2
36
.
\sum_{1\le i<j\le 5}(c_i-c_j)^2\geq 2^{36}.
1
≤
i
<
j
≤
5
∑
(
c
i
−
c
j
)
2
≥
2
36
.