MathDB
Problems
Contests
National and Regional Contests
Czech Republic Contests
Czech and Slovak Olympiad III A
2015 Czech and Slovak Olympiad III A
2015 Czech and Slovak Olympiad III A
Part of
Czech and Slovak Olympiad III A
Subcontests
(6)
6
1
Hide problems
Divisibility of sums of subsets
Integer
n
>
2
n>2
n
>
2
is given. Find the biggest integer
d
d
d
, for which holds, that from any set
S
S
S
consisting of
n
n
n
integers, we can find three different (but not necesarilly disjoint) nonempty subsets, such that sum of elements of each of them is divisible by
d
d
d
.
5
1
Hide problems
Geometric inequality with areas
In given triangle
△
A
B
C
\triangle ABC
△
A
BC
, difference between sizes of each pair of sides is at least
d
>
0
d>0
d
>
0
. Let
G
G
G
and
I
I
I
be the centroid and incenter of
△
A
B
C
\triangle ABC
△
A
BC
and
r
r
r
be its inradius. Show that
[
A
I
G
]
+
[
B
I
G
]
+
[
C
I
G
]
≥
2
3
d
r
,
[AIG]+[BIG]+[CIG]\ge\frac{2}{3}dr,
[
A
I
G
]
+
[
B
I
G
]
+
[
C
I
G
]
≥
3
2
d
r
,
where
[
X
Y
Z
]
[XYZ]
[
X
Y
Z
]
is (nonnegative) area of triangle
△
X
Y
Z
\triangle XYZ
△
X
Y
Z
.
4
1
Hide problems
Unhomogenous system of equations
Find all real triples
(
a
,
b
,
c
)
(a,b,c)
(
a
,
b
,
c
)
, for which
a
(
b
2
+
c
)
=
c
(
c
+
a
b
)
a(b^2+c)=c(c+ab)
a
(
b
2
+
c
)
=
c
(
c
+
ab
)
b
(
c
2
+
a
)
=
a
(
a
+
b
c
)
b(c^2+a)=a(a+bc)
b
(
c
2
+
a
)
=
a
(
a
+
b
c
)
c
(
a
2
+
b
)
=
b
(
b
+
c
a
)
.
c(a^2+b)=b(b+ca).
c
(
a
2
+
b
)
=
b
(
b
+
c
a
)
.
3
1
Hide problems
Axis of median
In triangle
△
A
B
C
\triangle ABC
△
A
BC
with median from
B
B
B
not perpendicular to
A
B
AB
A
B
nor
B
C
BC
BC
, we call
X
X
X
and
Y
Y
Y
points on
A
B
AB
A
B
and
B
C
BC
BC
, which lie on the axis of the median from
B
B
B
. Find all such triangles, for which
A
,
C
,
X
,
Y
A,C,X,Y
A
,
C
,
X
,
Y
lie on one circumrefference.
2
1
Hide problems
Number of paths of length 2n+2
Let
A
=
[
0
,
0
]
A=[0,0]
A
=
[
0
,
0
]
and
B
=
[
n
,
n
]
B=[n,n]
B
=
[
n
,
n
]
. In how many ways can we go from
A
A
A
to
B
B
B
, if we always want to go from lattice point to its neighbour (i.e. point with one coordinate the same and one smaller or bigger by one), we never want to visit the same point twice and we want our path to have length
2
n
+
2
2n+2
2
n
+
2
? (For example, path
[
0
,
0
]
,
[
0
,
1
]
,
[
−
1
,
1
]
,
[
−
1
,
2
]
,
[
0
,
2
]
,
[
1
,
2
]
,
[
2
,
2
]
,
[
2
,
3
]
,
[
3
,
3
]
[0,0],[0,1],[-1,1],[-1,2],[0,2],[1,2],[2,2],[2,3],[3,3]
[
0
,
0
]
,
[
0
,
1
]
,
[
−
1
,
1
]
,
[
−
1
,
2
]
,
[
0
,
2
]
,
[
1
,
2
]
,
[
2
,
2
]
,
[
2
,
3
]
,
[
3
,
3
]
is one of the paths for
n
=
3
n=3
n
=
3
)
1
1
Hide problems
Weird conditions on a number
Find all 4-digit numbers
n
n
n
, such that
n
=
p
q
r
n=pqr
n
=
pq
r
, where
p
<
q
<
r
p<q<r
p
<
q
<
r
are distinct primes, such that
p
+
q
=
r
−
q
p+q=r-q
p
+
q
=
r
−
q
and
p
+
q
+
r
=
s
2
p+q+r=s^2
p
+
q
+
r
=
s
2
, where
s
s
s
is a prime number.