MathDB
Problems
Contests
National and Regional Contests
South Africa Contests
South Africa National Olympiad
2009 South africa National Olympiad
2009 South africa National Olympiad
Part of
South Africa National Olympiad
Subcontests
(6)
6
1
Hide problems
Functional equation on the real numbers between 0 and 1
Let
A
A
A
denote the set of real numbers
x
x
x
such that
0
≤
x
<
1
0\le x<1
0
≤
x
<
1
. A function
f
:
A
→
R
f:A\to \mathbb{R}
f
:
A
→
R
has the properties:(i)
f
(
x
)
=
2
f
(
x
2
)
f(x)=2f(\frac{x}{2})
f
(
x
)
=
2
f
(
2
x
)
for all
x
∈
A
x\in A
x
∈
A
;(ii)
f
(
x
)
=
1
−
f
(
x
−
1
2
)
f(x)=1-f(x-\frac{1}{2})
f
(
x
)
=
1
−
f
(
x
−
2
1
)
if
1
2
≤
x
<
1
\frac{1}{2}\le x<1
2
1
≤
x
<
1
.Prove that(a)
f
(
x
)
+
f
(
1
−
x
)
≥
2
3
f(x)+f(1-x)\ge \frac{2}{3}
f
(
x
)
+
f
(
1
−
x
)
≥
3
2
if
x
x
x
is rational and
0
<
x
<
1
0<x<1
0
<
x
<
1
.(b) There are infinitely many odd positive integers
q
q
q
such that equality holds in (a) when
x
=
1
q
x=\frac{1}{q}
x
=
q
1
.
5
1
Hide problems
How many pebbles end up in hole 0?
A game is played on a board with an infinite row of holes labelled
0
,
1
,
2
,
…
0, 1, 2, \dots
0
,
1
,
2
,
…
. Initially,
2009
2009
2009
pebbles are put into hole
1
1
1
; the other holes are left empty. Now steps are performed according to the following scheme:(i) At each step, two pebbles are removed from one of the holes (if possible), and one pebble is put into each of the neighbouring holes.(ii) No pebbles are ever removed from hole
0
0
0
.(iii) The game ends if there is no hole with a positive label that contains at least two pebbles.Show that the game always terminates, and that the number of pebbles in hole
0
0
0
at the end of the game is independent of the specific sequence of steps. Determine this number.
4
1
Hide problems
Inequality between product, sum and sum of reciprocals
Let
x
1
,
x
2
,
…
,
x
n
x_1,x_2,\dots,x_n
x
1
,
x
2
,
…
,
x
n
be a finite sequence of real numbersm mwhere
0
<
x
i
<
1
0<x_i<1
0
<
x
i
<
1
for all
i
=
1
,
2
,
…
,
n
i=1,2,\dots,n
i
=
1
,
2
,
…
,
n
. Put
P
=
x
1
x
2
⋯
x
n
P=x_1x_2\cdots x_n
P
=
x
1
x
2
⋯
x
n
,
S
=
x
1
+
x
2
+
⋯
+
x
n
S=x_1+x_2+\cdots+x_n
S
=
x
1
+
x
2
+
⋯
+
x
n
and
T
=
1
x
1
+
1
x
2
+
⋯
+
1
x
n
T=\frac{1}{x_1}+\frac{1}{x_2}+\cdots+\frac{1}{x_n}
T
=
x
1
1
+
x
2
1
+
⋯
+
x
n
1
. Prove that
T
−
S
1
−
P
>
2.
\frac{T-S}{1-P}>2.
1
−
P
T
−
S
>
2.
3
1
Hide problems
Ten girls sit around a table
Ten girls, numbered from 1 to 10, sit at a round table, in a random order. Each girl then receives a new number, namely the sum of her own number and those of her two neighbours. Prove that some girl receives a new number greater than 17.
2
1
Hide problems
Ratios in a rectangle
Let
A
B
C
D
ABCD
A
BC
D
be a rectangle and
E
E
E
the reflection of
A
A
A
with respect to the diagonal
B
D
BD
B
D
. If
E
B
=
E
C
EB = EC
EB
=
EC
, what is the ratio
A
D
A
B
\frac{AD}{AB}
A
B
A
D
?
1
1
Hide problems
Smallest n for which an expression is divisible by 2009
Determine the smallest integer
n
>
1
n > 1
n
>
1
with the property that
n
2
(
n
−
1
)
n^2(n - 1)
n
2
(
n
−
1
)
is divisible by 2009.