MathDB
Problems
Contests
National and Regional Contests
Netherlands Contests
Dutch Mathematical Olympiad
2016 Dutch Mathematical Olympiad
2016 Dutch Mathematical Olympiad
Part of
Dutch Mathematical Olympiad
Subcontests
(6)
4 seniors
1
Hide problems
midpoint wanted, right angles and angle bisectors given
In the acute triangle
A
B
C
ABC
A
BC
, the midpoint of side
B
C
BC
BC
is called
M
M
M
. Point
X
X
X
lies on the angle bisector of
∠
A
M
B
\angle AMB
∠
A
MB
such that
∠
B
X
M
=
9
0
o
\angle BXM = 90^o
∠
BXM
=
9
0
o
. Point
Y
Y
Y
lies on the angle bisector of
∠
A
M
C
\angle AMC
∠
A
MC
such that
∠
C
Y
M
=
9
0
o
\angle CYM = 90^o
∠
C
Y
M
=
9
0
o
. Line segments
A
M
AM
A
M
and
X
Y
XY
X
Y
intersect in point
Z
Z
Z
. Prove that
Z
Z
Z
is the midpoint of
X
Y
XY
X
Y
.[asy] import geometry;unitsize (1.2 cm);pair A, B, C, M, X, Y, Z;A = (0,0); B = (4,1.5); C = (0.5,3); M = (B + C)/2; X = extension(M, incenter(A,B,M), B, B + rotate(90)*(incenter(A,B,M) - M)); Y = extension(M, incenter(A,C,M), C, C + rotate(90)*(incenter(A,C,M) - M)); Z = extension(A,M,X,Y);draw(A--B--C--cycle); draw(A--M); draw(M--interp(M,X,2)); draw(M--interp(M,Y,2)); draw(B--X, dotted); draw(C--Y, dotted); draw(X--Y);dot("
A
A
A
", A, SW); dot("
B
B
B
", B, E); dot("
C
C
C
", C, N); dot("
M
M
M
", M, NE); dot("
X
X
X
", X, NW); dot("
Y
Y
Y
", Y, NE); dot("
Z
Z
Z
", Z, S); [/asy]
4 juniors
1
Hide problems
orthocenters inside a quadrilateral, parallelogram wanted
In a quadrilateral
A
B
C
D
ABCD
A
BC
D
the intersection of the diagonals is called
P
P
P
. Point
X
X
X
is the orthocentre of triangle
P
A
B
PAB
P
A
B
. (The orthocentre of a triangle is the point where the three altitudes of the triangle intersect.) Point
Y
Y
Y
is the orthocentre of triangle
P
C
D
PCD
PC
D
. Suppose that
X
X
X
lies inside triangle
P
A
B
PAB
P
A
B
and
Y
Y
Y
lies inside triangle
P
C
D
PCD
PC
D
. Moreover, suppose that
P
P
P
is the midpoint of line segment
X
Y
XY
X
Y
. Prove that
A
B
C
D
ABCD
A
BC
D
is a parallelogram. [asy] import geometry;unitsize (1.5 cm);pair A, B, C, D, P, X, Y;A = (0,0); B = (2,-0.5); C = (3.5,2.2); D = A + C - B; P = (A + C)/2; X = orthocentercenter(A,B,P); Y = orthocentercenter(C,D,P);draw(A--B--C--D--cycle); draw(A--C); draw(B--D); draw(A--extension(A,X,B,P), dotted); draw(B--extension(B,X,A,P), dotted); draw(P--extension(P,X,A,B), dotted); draw(C--extension(C,Y,D,P), dotted); draw(D--extension(D,Y,C,P), dotted); draw(P--extension(P,Y,C,D), dotted);dot("
A
A
A
", A, W); dot("
B
B
B
", B, S); dot("
C
C
C
", C, E); dot("
D
D
D
", D, N); dot("
P
P
P
", P, E); dot("
X
X
X
", X, NW); dot("
Y
Y
Y
", Y, SE); [/asy]
3
1
Hide problems
gcd(a, b) = gcd(a, c) = gcd(b, c) = 1 and a,b,c \ (a + b + c)
Find all possible triples
(
a
,
b
,
c
)
(a, b, c)
(
a
,
b
,
c
)
of positive integers with the following properties: •
g
c
d
(
a
,
b
)
=
g
c
d
(
a
,
c
)
=
g
c
d
(
b
,
c
)
=
1
gcd(a, b) = gcd(a, c) = gcd(b, c) = 1
g
c
d
(
a
,
b
)
=
g
c
d
(
a
,
c
)
=
g
c
d
(
b
,
c
)
=
1
, •
a
a
a
is a divisor of
a
+
b
+
c
a + b + c
a
+
b
+
c
, •
b
b
b
is a divisor of
a
+
b
+
c
a + b + c
a
+
b
+
c
, •
c
c
c
is a divisor of
a
+
b
+
c
a + b + c
a
+
b
+
c
.(Here
g
c
d
(
x
,
y
)
gcd(x,y)
g
c
d
(
x
,
y
)
is the greatest common divisor of
x
x
x
and
y
y
y
.)
2
1
Hide problems
smallest sum product value of a sequence of 2n numbers
For an integer
n
≥
1
n \ge 1
n
≥
1
we consider sequences of
2
n
2n
2
n
numbers, each equal to
0
,
−
1
0, -1
0
,
−
1
or
1
1
1
. The sum product value of such a sequence is calculated by first multiplying each pair of numbers from the sequence, and then adding all the results together. For example, if we take
n
=
2
n = 2
n
=
2
and the sequence
0
,
1
,
1
,
−
1
0,1, 1, -1
0
,
1
,
1
,
−
1
, then we find the products
0
⋅
1
,
0
⋅
1
,
0
⋅
−
1
,
1
⋅
1
,
1
⋅
−
1
,
1
⋅
−
1
0\cdot 1, 0\cdot 1, 0\cdot -1, 1\cdot 1, 1\cdot -1, 1\cdot -1
0
⋅
1
,
0
⋅
1
,
0
⋅
−
1
,
1
⋅
1
,
1
⋅
−
1
,
1
⋅
−
1
. Adding these six results gives the sum product value of this sequence:
0
+
0
+
0
+
1
+
(
−
1
)
+
(
−
1
)
=
−
1
0+0+0+1+(-1)+(-1) = -1
0
+
0
+
0
+
1
+
(
−
1
)
+
(
−
1
)
=
−
1
. The sum product value of this sequence is therefore smaller than the sum product value of the sequence
0
,
0
,
0
,
0
0, 0, 0, 0
0
,
0
,
0
,
0
, which equals
0
0
0
. Determine for each integer
n
≥
1
n \ge 1
n
≥
1
the smallest sum product value that such a sequence of
2
n
2n
2
n
numbers could have.Attention: you are required to prove that a smaller sum product value is impossible.
1
1
Hide problems
encircling 999 numbers with red, green, blue chalk
(a) On a long pavement, a sequence of
999
999
999
integers is written in chalk. The numbers need not be in increasing order and need not be distinct. Merlijn encircles
500
500
500
of the numbers with red chalk. From left to right, the numbers circled in red are precisely the numbers
1
,
2
,
3
,
.
.
.
,
499
,
500
1, 2, 3, ...,499, 500
1
,
2
,
3
,
...
,
499
,
500
. Next, Jeroen encircles
500
500
500
of the numbers with blue chalk. From left to right, the numbers circled in blue are precisely the numbers
500
,
499
,
498
,
.
.
.
,
2
,
1
500, 499, 498, ...,2,1
500
,
499
,
498
,
...
,
2
,
1
.Prove that the middle number in the sequence of
999
999
999
numbers is circled both in red and in blue. (b) Merlijn and Jeroen cross the street and find another sequence of
999
999
999
integers on the pavement. Again Merlijn circles
500
500
500
of the numbers with red chalk. Again the numbers circled in red are precisely the numbers
1
,
2
,
3
,
.
.
.
,
499
,
500
1, 2, 3, ...,499, 500
1
,
2
,
3
,
...
,
499
,
500
from left to right. Now Jeroen circles
500
500
500
of the numbers, not necessarily the same as Merlijn, with green chalk. The numbers circled in green are also precisely the numbers
1
,
2
,
3
,
.
.
.
,
499
,
500
1, 2, 3, ...,499, 500
1
,
2
,
3
,
...
,
499
,
500
from left to right.Prove: there is a number that is circled both in red and in green that is not the middle number of the sequence of
999
999
999
numbers.
5
1
Hide problems
Bas has several colours for each of the positive integers, and a few conditions
Bas has coloured each of the positive integers. He had several colours at his disposal. His colouring satises the following requirements: • each odd integer is coloured blue, • each integer
n
n
n
has the same colour as
4
n
4n
4
n
, • each integer
n
n
n
has the same colour as at least one of the integers
n
+
2
n+2
n
+
2
and
n
+
4
n + 4
n
+
4
. Prove that Bas has coloured all integers blue.