MathDB
Problems
Contests
National and Regional Contests
Netherlands Contests
Dutch Mathematical Olympiad
1984 Dutch Mathematical Olympiad
1984 Dutch Mathematical Olympiad
Part of
Dutch Mathematical Olympiad
Subcontests
(4)
3
1
Hide problems
a_n =\frac{1 x 4 x7 x ... (3n-2)}{2 x 5 x 8 x ... (3n-1)
For
n
=
1
,
2
,
3
,
.
.
.
n = 1,2,3,...
n
=
1
,
2
,
3
,
...
.
a
n
a_n
a
n
is defined by:
a
n
=
1
⋅
4
⋅
7
⋅
.
.
.
(
3
n
−
2
)
2
⋅
5
⋅
8
⋅
.
.
.
(
3
n
−
1
)
a_n =\frac{1 \cdot 4 \cdot 7 \cdot ... (3n-2)}{2 \cdot 5 \cdot 8 \cdot ... (3n-1)}
a
n
=
2
⋅
5
⋅
8
⋅
...
(
3
n
−
1
)
1
⋅
4
⋅
7
⋅
...
(
3
n
−
2
)
Prove that for every
n
n
n
holds that
1
3
n
+
1
≤
a
n
≤
1
3
n
+
1
3
\frac{1}{\sqrt{3n+1}}\le a_n \le \frac{1}{\sqrt[3]{3n+1}}
3
n
+
1
1
≤
a
n
≤
3
3
n
+
1
1
2
1
Hide problems
probability that the light is on, 5 switches, circuit diagram
The circuit diagram drawn (see figure ) contains a battery
B
B
B
, a lamp
L
L
L
and five switches
S
1
S_1
S
1
to
S
5
S_5
S
5
. The probability that switch
S
3
S_3
S
3
is closed (makes contact) is
2
3
\frac23
3
2
, for the other four switches that probability is
1
2
\frac12
2
1
(the probabilities are mutually independent). Calculate the probability that the light is on.[asy] unitsize (2 cm);draw((-1,1)--(-0.5,1)); draw((-0.25,1)--(1,1)--(1,0.25)); draw((1,-0.25)--(1,-1)--(0.05,-1)); draw((-0.05,-1)--(-1,-1)--(-1,0.25)); draw((-1,0.5)--(-1,1)); draw((-1,1)--(-0.5,0.5)); draw((-0.25,0.25)--(0,0)); draw((-1,0)--(-0.75,0)); draw((-0.5,0)--(0,0)); draw((0,1)--(0,0.75)); draw((0,0.5)--(0,0)); draw((-0.25,1)--(-0.5,1.25)); draw((-1,0.25)--(-1.25,0.5)); draw((-0.5,0.5)--(-0.25,0.5)); draw((0,0.75)--(0.25,0.5)); draw((-0.75,0)--(-0.5,-0.25)); draw(Circle((1,0),0.25)); draw(((1,0) + 0.25*dir(45))--((1,0) + 0.25*dir(225))); draw(((1,0) + 0.25*dir(135))--((1,0) + 0.25*dir(315))); draw((0.05,-0.9)--(0.05,-1.1)); draw((-0.05,-0.8)--(-0.05,-1.2));label("
L
L
L
", (1.25,0), E); label("
B
B
B
", (-0.1,-1.1), SW); label("
S
1
S_1
S
1
", (-0.5,1.25), NE); label("
S
2
S_2
S
2
", (-1.25,0.5), SW); label("
S
3
S_3
S
3
", (-0.5,0.5), SW); label("
S
4
S_4
S
4
", (0.25,0.5), NE); label("
S
5
S_5
S
5
", (-0.5,-0.25), SW); [/asy]
1
1
Hide problems
PR bisects <MPN, internally tangent circles
The circles
C
1
C_1
C
1
and
C
2
C_2
C
2
with radii
r
1
r_1
r
1
and
r
2
r_2
r
2
touch the line
p
p
p
at the point
P
P
P
.
C
1
C_1
C
1
lies entirely within
C
2
C_2
C
2
. Line
q
⊥
p
q \perp p
q
⊥
p
intersects
p
p
p
at
S
S
S
and touches
C
1
C_1
C
1
at
R
R
R
.
q
q
q
intersects
C
2
C_2
C
2
at
M
M
M
and
N
N
N
, where
N
N
N
is between
R
R
R
and
S
S
S
. a) Prove that line
P
R
PR
PR
bisects angle
∠
M
P
N
\angle MPN
∠
MPN
. b) Calculate the ratio
r
1
:
r
2
r_1 : r_2
r
1
:
r
2
if line
P
N
PN
PN
bisects angle
∠
R
P
S
\angle RPS
∠
RPS
.
4
1
Hide problems
man max number after parentheses in 1:2:3:4:5:6:7:8$
By placing parentheses in the expression
1
:
2
:
3
1:2:3
1
:
2
:
3
we can get two different number values:
(
1
:
2
)
:
3
=
1
6
(1 : 2) : 3 = \frac16
(
1
:
2
)
:
3
=
6
1
and
1
:
(
2
:
3
)
=
3
2
1 : (2 : 3) = \frac32
1
:
(
2
:
3
)
=
2
3
. Now brackets are placed in the expression
1
:
2
:
3
:
4
:
5
:
6
:
7
:
8
1:2:3:4:5:6:7:8
1
:
2
:
3
:
4
:
5
:
6
:
7
:
8
. Multiple bracket pairs are allowed, whether or not in nest form. (a) What is the largest numerical value we can get, and what is the smallest? (b) How many different number values can be obtained?