MathDB
Problems
Contests
National and Regional Contests
Czech Republic Contests
Czech and Slovak Olympiad III A
1997 Czech And Slovak Olympiad IIIA
1997 Czech And Slovak Olympiad IIIA
Part of
Czech and Slovak Olympiad III A
Subcontests
(6)
6
1
Hide problems
locus of intersections of diagonals, cyclic quadrilateral and parallelogram
In a parallelogram
A
B
C
D
ABCD
A
BC
D
, triangle
A
B
D
ABD
A
B
D
is acute-angled and
∠
B
A
D
=
π
/
4
\angle BAD = \pi /4
∠
B
A
D
=
π
/4
. Consider all possible choices of points
K
,
L
,
M
,
N
K,L,M,N
K
,
L
,
M
,
N
on sides
A
B
,
B
C
,
C
D
,
D
A
AB,BC, CD,DA
A
B
,
BC
,
C
D
,
D
A
respectively, such that
K
L
M
N
KLMN
K
L
MN
is a cyclic quadrilateral whose circumradius equals those of triangles
A
N
K
ANK
A
N
K
and
C
L
M
CLM
C
L
M
. Find the locus of the intersection of the diagonals of
K
L
M
N
KLMN
K
L
MN
5
1
Hide problems
max of V_n = sin x_1 cos x_2 +sin x_2 cos x_3 +...+sin x_n cos x_1
For a given integer
n
≥
2
n \ge 2
n
≥
2
, find the maximum possible value of
V
n
=
sin
x
1
cos
x
2
+
sin
x
2
cos
x
3
+
.
.
.
+
sin
x
n
cos
x
1
V_n = \sin x_1 \cos x_2 +\sin x_2 \cos x_3 +...+\sin x_n \cos x_1
V
n
=
sin
x
1
cos
x
2
+
sin
x
2
cos
x
3
+
...
+
sin
x
n
cos
x
1
, where
x
1
,
x
2
,
.
.
.
,
x
n
x_1,x_2,...,x_n
x
1
,
x
2
,
...
,
x
n
are real numbers.
4
1
Hide problems
sequence k+a_n contains only finitely many primes
Show that there exists an increasing sequence
a
1
,
a
2
,
a
3
,
.
.
.
a_1,a_2,a_3,...
a
1
,
a
2
,
a
3
,
...
of natural numbers such that, for any integer
k
≥
2
k \ge 2
k
≥
2
, the sequence
k
+
a
n
k+a_n
k
+
a
n
(
n
∈
N
n \in N
n
∈
N
) contains only finitely many primes.
3
1
Hide problems
a tetrahedron is divided into five polyhedra
A tetrahedron
A
B
C
D
ABCD
A
BC
D
is divided into five polyhedra so that each face of the tetrahedron is a face of (exactly) one polyhedron, and that the intersection of any two of the polyhedra is either a common vertex, a common edge, or a common face. What is the smallest possible sum of the numbers of faces of the five polyhedra?
2
1
Hide problems
each side and diagonal of a regular n-gon is colored red or blue
Each side and diagonal of a regular
n
n
n
-gon (
n
≥
3
n \ge 3
n
≥
3
) for odd
n
n
n
is colored red or blue. One may choose a vertex and change the color of all segments emanating from that vertex. Prove that, no matter how the edges were colored initially, one can achieve that the number of blue segments at each vertex is even. Prove also that the resulting coloring depends only on the initial coloring.
1
1
Hide problems
triangle ABC, \alpha = 3\beta =>(a^2 -b^2)(a-b) = bc^2
Let
A
B
C
ABC
A
BC
be a triangle with sides
a
,
b
,
c
a,b,c
a
,
b
,
c
and corresponding angles
α
,
β
γ
\alpha,\beta\gamma
α
,
β
γ
. Prove that if
α
=
3
β
\alpha = 3\beta
α
=
3
β
then
(
a
2
−
b
2
)
(
a
−
b
)
=
b
c
2
(a^2 -b^2)(a-b) = bc^2
(
a
2
−
b
2
)
(
a
−
b
)
=
b
c
2
. Is the converse true?