MathDB
Problems
Contests
National and Regional Contests
China Contests
China National Olympiad
2005 China National Olympiad
2005 China National Olympiad
Part of
China National Olympiad
Subcontests
(6)
6
1
Hide problems
2^x * 3^y - 5^z * 7^w = 1
Find all nonnegative integer solutions
(
x
,
y
,
z
,
w
)
(x,y,z,w)
(
x
,
y
,
z
,
w
)
of the equation
2
x
⋅
3
y
−
5
z
⋅
7
w
=
1.
2^x\cdot3^y-5^z\cdot7^w=1.
2
x
⋅
3
y
−
5
z
⋅
7
w
=
1.
5
1
Hide problems
minimum number of triangles with the area not more than 1/4
There are 5 points in a rectangle (including its boundary) with area 1, no three of them are in the same line. Find the minimum number of triangles with the area not more than
1
4
\frac 1{4}
4
1
, vertex of which are three of the five points.
4
1
Hide problems
fractional sequence inequality
The sequence
{
a
n
}
\{a_n\}
{
a
n
}
is defined by:
a
1
=
21
16
a_1=\frac{21}{16}
a
1
=
16
21
, and for
n
≥
2
n\ge2
n
≥
2
,
2
a
n
−
3
a
n
−
1
=
3
2
n
+
1
.
2a_n-3a_{n-1}=\frac{3}{2^{n+1}}.
2
a
n
−
3
a
n
−
1
=
2
n
+
1
3
.
Let
m
m
m
be an integer with
m
≥
2
m\ge2
m
≥
2
. Prove that: for
n
≤
m
n\le m
n
≤
m
, we have
(
a
n
+
3
2
n
+
3
)
1
m
(
m
−
(
2
3
)
n
(
m
−
1
)
m
)
<
m
2
−
1
m
−
n
+
1
.
\left(a_n+\frac{3}{2^{n+3}}\right)^{\frac{1}{m}}\left(m-\left(\frac{2}{3}\right)^{{\frac{n(m-1)}{m}}}\right)<\frac{m^2-1}{m-n+1}.
(
a
n
+
2
n
+
3
3
)
m
1
m
−
(
3
2
)
m
n
(
m
−
1
)
<
m
−
n
+
1
m
2
−
1
.
1
1
Hide problems
trigonometric inequalities from china 2005
Suppose
θ
i
∈
(
−
π
2
,
π
2
)
,
i
=
1
,
2
,
3
,
4
\theta_{i}\in(-\frac{\pi}{2},\frac{\pi}{2}), i = 1,2,3,4
θ
i
∈
(
−
2
π
,
2
π
)
,
i
=
1
,
2
,
3
,
4
. Prove that, there exist
x
∈
R
x\in \mathbb{R}
x
∈
R
, satisfying two inequalities \begin{eqnarray*} \cos^2\theta_1\cos^2\theta_2-(\sin\theta\sin\theta_2-x)^2 &\geq& 0, \\ \cos^2\theta_3\cos^2\theta_4-(\sin\theta_3\sin\theta_4-x)^2 & \geq & 0 \end{eqnarray*} if and only if
∑
i
=
1
4
sin
2
θ
i
≤
2
(
1
+
∏
i
=
1
4
sin
θ
i
+
∏
i
=
1
4
cos
θ
i
)
.
\sum^4_{i=1}\sin^2\theta_i\leq2(1+\prod^4_{i=1}\sin\theta_i + \prod^4_{i=1}\cos\theta_i).
i
=
1
∑
4
sin
2
θ
i
≤
2
(
1
+
i
=
1
∏
4
sin
θ
i
+
i
=
1
∏
4
cos
θ
i
)
.
3
1
Hide problems
graph with 2n vertices - frogs at the pond
As the graph, a pond is divided into 2n (n
≥
\geq
≥
5) parts. Two parts are called neighborhood if they have a common side or arc. Thus every part has three neighborhoods. Now there are 4n+1 frogs at the pond. If there are three or more frogs at one part, then three of the frogs of the part will jump to the three neighborhoods repsectively. Prove that for some time later, the frogs at the pond will uniformily distribute. That is, for any part either there are frogs at the part or there are frogs at the each of its neighborhoods. http://www.mathlinks.ro/Forum/files/china2005_2_214.gif
2
1
Hide problems
circle that cuts side of a triangle in 6 points - china 2005
A circle meets the three sides
B
C
,
C
A
,
A
B
BC,CA,AB
BC
,
C
A
,
A
B
of a triangle
A
B
C
ABC
A
BC
at points
D
1
,
D
2
;
E
1
,
E
2
;
F
1
,
F
2
D_1,D_2;E_1,E_2; F_1,F_2
D
1
,
D
2
;
E
1
,
E
2
;
F
1
,
F
2
respectively. Furthermore, line segments
D
1
E
1
D_1E_1
D
1
E
1
and
D
2
F
2
D_2F_2
D
2
F
2
intersect at point
L
L
L
, line segments
E
1
F
1
E_1F_1
E
1
F
1
and
E
2
D
2
E_2D_2
E
2
D
2
intersect at point
M
M
M
, line segments
F
1
D
1
F_1D_1
F
1
D
1
and
F
2
E
2
F_2E_2
F
2
E
2
intersect at point
N
N
N
. Prove that the lines
A
L
,
B
M
,
C
N
AL,BM,CN
A
L
,
BM
,
CN
are concurrent.