MathDB
Problems
Contests
International Contests
APMO
2007 APMO
2007 APMO
Part of
APMO
Subcontests
(5)
5
1
Hide problems
A regular $(5 \times 5)$-array of lights
A regular
(
5
×
5
)
(5 \times 5)
(
5
×
5
)
-array of lights is defective, so that toggling the switch for one light causes each adjacent light in the same row and in the same column as well as the light itself to change state, from on to off, or from off to on. Initially all the lights are switched off. After a certain number of toggles, exactly one light is switched on. Find all the possible positions of this light.
4
1
Hide problems
$\sqrt{x} + \sqrt{y} + \sqrt{z} = 1$.
Let
x
;
y
x; y
x
;
y
and
z
z
z
be positive real numbers such that
x
+
y
+
z
=
1
\sqrt{x}+\sqrt{y}+\sqrt{z}= 1
x
+
y
+
z
=
1
. Prove that
x
2
+
y
z
2
x
2
(
y
+
z
)
+
y
2
+
z
x
2
y
2
(
z
+
x
)
+
z
2
+
x
y
2
z
2
(
x
+
y
)
≥
1.
\frac{x^{2}+yz}{\sqrt{2x^{2}(y+z)}}+\frac{y^{2}+zx}{\sqrt{2y^{2}(z+x)}}+\frac{z^{2}+xy}{\sqrt{2z^{2}(x+y)}}\geq 1.
2
x
2
(
y
+
z
)
x
2
+
yz
+
2
y
2
(
z
+
x
)
y
2
+
z
x
+
2
z
2
(
x
+
y
)
z
2
+
x
y
≥
1.
3
1
Hide problems
$n$ disks in a plane
Consider
n
n
n
disks
C
1
;
C
2
;
.
.
.
;
C
n
C_{1}; C_{2}; ... ; C_{n}
C
1
;
C
2
;
...
;
C
n
in a plane such that for each
1
≤
i
<
n
1 \leq i < n
1
≤
i
<
n
, the center of
C
i
C_{i}
C
i
is on the circumference of
C
i
+
1
C_{i+1}
C
i
+
1
, and the center of
C
n
C_{n}
C
n
is on the circumference of
C
1
C_{1}
C
1
. Define the score of such an arrangement of
n
n
n
disks to be the number of pairs
(
i
;
j
)
(i; j )
(
i
;
j
)
for which
C
i
C_{i}
C
i
properly contains
C
j
C_{j}
C
j
. Determine the maximum possible score.
2
1
Hide problems
an acute angled triangle with $\angle{BAC}=60^0$
Let
A
B
C
ABC
A
BC
be an acute angled triangle with
∠
B
A
C
=
6
0
∘
\angle{BAC}=60^\circ
∠
B
A
C
=
6
0
∘
and
A
B
>
A
C
AB > AC
A
B
>
A
C
. Let
I
I
I
be the incenter, and
H
H
H
the orthocenter of the triangle
A
B
C
ABC
A
BC
. Prove that
2
∠
A
H
I
=
3
∠
A
B
C
2\angle{AHI}= 3\angle{ABC}
2∠
A
H
I
=
3∠
A
BC
.
1
1
Hide problems
a set of $9$ distinct integers
Let
S
S
S
be a set of
9
9
9
distinct integers all of whose prime factors are at most
3.
3.
3.
Prove that
S
S
S
contains
3
3
3
distinct integers such that their product is a perfect cube.