MathDB
Problems
Contests
National and Regional Contests
Netherlands Contests
Dutch Mathematical Olympiad
2014 Dutch Mathematical Olympiad
2014 Dutch Mathematical Olympiad
Part of
Dutch Mathematical Olympiad
Subcontests
(6)
2 seniors
1
Hide problems
3 right isosceles triangles on sides of a triangle, parallelogram wanted
On the sides of triangle
A
B
C
ABC
A
BC
, isosceles right-angled triangles
A
U
B
,
C
V
B
AUB, CVB
A
U
B
,
C
V
B
, and
A
W
C
AWC
A
W
C
are placed. These three triangles have their right angles at vertices
U
,
V
U, V
U
,
V
, and
W
W
W
, respectively. Triangle
A
U
B
AUB
A
U
B
lies completely inside triangle
A
B
C
ABC
A
BC
and triangles
C
V
B
CVB
C
V
B
and
A
W
C
AWC
A
W
C
lie completely outside
A
B
C
ABC
A
BC
. See the figure. Prove that quadrilateral
U
V
C
W
UVCW
U
V
C
W
is a parallelogram. [asy] import markers;unitsize(1.5 cm);pair A, B, C, U, V, W;A = (0,0); B = (2,0); C = (1.7,2.5); U = (B + rotate(90,A)*(B))/2; V = (B + rotate(90,C)*(B))/2; W = (C + rotate(90,A)*(C))/2;draw(A--B--C--cycle); draw(A--W, StickIntervalMarker(1,1,size=2mm)); draw(C--W, StickIntervalMarker(1,1,size=2mm)); draw(B--V, StickIntervalMarker(1,2,size=2mm)); draw(C--V, StickIntervalMarker(1,2,size=2mm)); draw(A--U, StickIntervalMarker(1,3,size=2mm)); draw(B--U, StickIntervalMarker(1,3,size=2mm)); draw(rightanglemark(A,U,B,5)); draw(rightanglemark(B,V,C,5)); draw(rightanglemark(A,W,C,5));dot("
A
A
A
", A, S); dot("
B
B
B
", B, S); dot("
C
C
C
", C, N); dot("
U
U
U
", U, NE); dot("
V
V
V
", V, NE); dot("
W
W
W
", W, NW); [/asy]
2 juniors
1
Hide problems
isosceles wanted, parallelogram and equal segments given, for juniors
Let
A
B
C
D
ABCD
A
BC
D
be a parallelogram with an acute angle at
A
A
A
. Let
G
G
G
be a point on the line
A
B
AB
A
B
, distinct from
B
B
B
, such that
∣
C
G
∣
=
∣
C
B
∣
|CG| = |CB|
∣
CG
∣
=
∣
CB
∣
. Let
H
H
H
be a point on the line
B
C
BC
BC
, distinct from
B
B
B
, such that
∣
A
B
∣
=
∣
A
H
∣
|AB| =|AH|
∣
A
B
∣
=
∣
A
H
∣
. Prove that triangle
D
G
H
DGH
D
G
H
is isosceles.[asy] unitsize(1.5 cm);pair A, B, C, D, G, H;A = (0,0); B = (2,0); D = (0.5,1.5); C = B + D - A; G = reflect(A,B)*(C) + C - B; H = reflect(B,C)*(H) + A - B;draw(H--A--D--C--G); draw(interp(A,G,-0.1)--interp(A,G,1.1)); draw(interp(C,H,-0.1)--interp(C,H,1.1)); draw(D--G--H--cycle, dashed);dot("
A
A
A
", A, SW); dot("
B
B
B
", B, SE); dot("
C
C
C
", C, E); dot("
D
D
D
", D, NW); dot("
G
G
G
", G, NE); dot("
H
H
H
", H, SE); [/asy]
5
1
Hide problems
divide a 1 by 1 square into rectangles with the same circumference
We consider the ways to divide a
1
1
1
by
1
1
1
square into rectangles (of which the sides are parallel to those of the square). All rectangles must have the same circumference, but not necessarily the same shape. a) Is it possible to divide the square into 20 rectangles, each having a circumference of
2
:
5
2:5
2
:
5
? b) Is it possible to divide the square into 30 rectangles, each having a circumference of
2
2
2
?
4
1
Hide problems
Leiden quadruple (p, a, b, c) with p + 2 = (a+b+c)/3
A quadruple
(
p
,
a
,
b
,
c
)
(p, a, b, c)
(
p
,
a
,
b
,
c
)
of positive integers is called a Leiden quadruple if -
p
p
p
is an odd prime number, -
a
,
b
a, b
a
,
b
, and
c
c
c
are distinct and -
a
b
+
1
,
b
c
+
1
ab + 1, bc + 1
ab
+
1
,
b
c
+
1
and
c
a
+
1
ca + 1
c
a
+
1
are divisible by
p
p
p
. a) Prove that for every Leiden quadruple
(
p
,
a
,
b
,
c
)
(p, a, b, c)
(
p
,
a
,
b
,
c
)
we have
p
+
2
≤
a
+
b
+
c
3
p + 2 \le \frac{a+b+c}{3}
p
+
2
≤
3
a
+
b
+
c
. b) Determine all numbers
p
p
p
for which a Leiden quadruple
(
p
,
a
,
b
,
c
)
(p, a, b, c)
(
p
,
a
,
b
,
c
)
exists with
p
+
2
=
a
+
b
+
c
3
p + 2 = \frac{a+b+c}{3}
p
+
2
=
3
a
+
b
+
c
3
1
Hide problems
no of teams at a volleyball tournament can be 7, but cannot be 6
At a volleyball tournament, each team plays exactly once against each other team. Each game has a winning team, which gets
1
1
1
point. The losing team gets
0
0
0
points. Draws do not occur. In the nal ranking, only one team turns out to have the least number of points (so there is no shared last place). Moreover, each team, except for the team having the least number of points, lost exactly one game against a team that got less points in the final ranking. a) Prove that the number of teams cannot be equal to
6
6
6
. b) Show, by providing an example, that the number of teams could be equal to
7
7
7
.
1
1
Hide problems
diophantine abc = 2(a + b + c) with 0<a <=b <=c
Determine all triples
(
a
,
b
,
c
)
(a,b,c)
(
a
,
b
,
c
)
, where
a
,
b
a, b
a
,
b
, and
c
c
c
are positive integers that satisfy
a
≤
b
≤
c
a \le b \le c
a
≤
b
≤
c
and
a
b
c
=
2
(
a
+
b
+
c
)
abc = 2(a + b + c)
ab
c
=
2
(
a
+
b
+
c
)
.