MathDB
Problems
Contests
National and Regional Contests
USA Contests
Withdrawn USA Contests
Kettering Mathematics Olympiad
2004 Kettering HS MO
2004 Kettering HS MO
Part of
Kettering Mathematics Olympiad
Subcontests
(1)
1
Hide problems
2004 Kettering University Mathematics Olympiad for High School Students
p1. Find all real solutions of the system
x
5
+
y
5
=
1
x^5 + y^5 = 1
x
5
+
y
5
=
1
x
6
+
y
6
=
1
x^6 + y^6 = 1
x
6
+
y
6
=
1
p2. The centers of three circles of the radius
R
R
R
are located in the vertexes of equilateral triangle. The length of the sides of the triangle is
a
a
a
and
a
2
<
R
<
a
\frac{a}{2}< R < a
2
a
<
R
<
a
. Find the distances between the intersection points of the circles, which are outside of the triangle. p3. Prove that no positive integer power of
2
2
2
ends with four equal digits. p4. A circle is divided in
10
10
10
sectors.
90
90
90
coins are located in these sectors,
9
9
9
coins in each sector. At every move you can move a coin from a sector to one of two neighbor sectors. (Two sectors are called neighbor if they are adjoined along a segment.) Is it possible to move all coins into one sector in exactly
2004
2004
2004
moves? p5. Inside a convex polygon several points are arbitrary chosen. Is it possible to divide the polygon into smaller convex polygons such that every one contains exactly one given point? Justify your answer. p6. A troll tried to spoil a white and red
8
×
8
8\times 8
8
×
8
chessboard. The area of every square of the chessboard is one square foot. He randomly painted
1.5
%
1.5\%
1.5%
of the area of every square with black ink. A grasshopper jumped on the spoiled chessboard. The length of the jump of the grasshopper is exactly one foot and at every jump only one point of the chessboard is touched. Is it possible for the grasshopper to visit every square of the chessboard without touching any black point? Justify your answer. PS. You should use hide for answers.