MathDB
Problems
Contests
National and Regional Contests
Chile Contests
Chile Junior Math Olympiad
2007 Chile Junior Math Olympiad
2007 Chile Junior Math Olympiad
Part of
Chile Junior Math Olympiad
Subcontests
(1)
1
Hide problems
2007 Chile NMO Juniors XIX
p1. Pedro and Juan are still at opposite points in a roundabout. If Pedro turns
917
917
917
times the roundabout and Juan goes around
1090
1090
1090
times in the same time, but in the opposite direction, determine how many times they cross. [url=https://artofproblemsolving.com/community/c6h1845563p12424471]p2. From a triangle
T
=
△
A
B
C
T = \vartriangle ABC
T
=
△
A
BC
, we build the triangle
T
1
=
△
A
1
B
1
C
1
T_1 = \vartriangle A_1B_1C_1
T
1
=
△
A
1
B
1
C
1
whose vertices they are the midpoints of the sides of
T
T
T
. The triangle
T
2
=
△
A
2
B
2
C
2
T_2 = \triangle A_2B_2C_2
T
2
=
△
A
2
B
2
C
2
is constructed from
T
1
T_1
T
1
in a way analogue. We build the triangles
T
3
,
T
4
,
.
.
.
,
T
2007
T_3, T_4,..., T_{2007}
T
3
,
T
4
,
...
,
T
2007
. Prove that the center of gravity
G
G
G
of the triangle
T
T
T
is inside the triangle
T
2007
T_{2007}
T
2007
. [url=https://artofproblemsolving.com/community/c6h2927784p26188277]p3. Consider a non-convex polygon with
10
,
000
10,000
10
,
000
sides and a line that does not pass through any of the vertices of the polygon. Prove that the line cannot cut exactly
2007
2007
2007
sides of the polygon. [url=https://artofproblemsolving.com/community/c4h2917775p26063722]p4. Determine whether it is possible to draw a finite number of circles
S
1
,
S
2
,
.
.
.
,
S
n
S_1, S_2, ..., S_n
S
1
,
S
2
,
...
,
S
n
inside of a square with side 1 so that its interiors do not intersect and the sum of its radii is greater than
2007
2007
2007
. p5. Seven guests to a restaurant sit in chairs equally spaced around a round table, but they have not seen that in the points there are cards with the names of the guests. Assume they have sat down with such bad luck that none is in the place where they should.
∙
\bullet
∙
Show that it is possible to get at least two people in their correct position, without anyone getting up from their seat by turning the table.
∙
\bullet
∙
Show a configuration where exactly a guest is in his assigned place and where there is exactly no way that the table is turned to be possible to get at least two to fit. [hide=original wording]Siete invitados a una esta se sientan en sillas igualmente espaciadas alrededor de una mesa redonda, pero no se han jado que en los puntos hay tarjetas con los nombres de los invitados.
∙
\bullet
∙
Suponiendo que se han sentado con tan mala suerte que ninguno se encuentra en el lugar que le corresponde, muestre que es posible lograr que al menos dos personas queden en su puesto correcto, sin que nadie se pare de su asiento haciendo girar la mesa.
∙
\bullet
∙
Muestre una configuracion donde exactamente un invitado esta en su lugar asignado y donde de ninguna forma que se gire la mesa es posible lograr que al menos dos queden bien. p6. A
32
32
32
-page magazine has one page ripped off and has
2
2
2
lined pages. The product of the numbers of the hatched and missing pages is
6144
6144
6144
. Determine the missing pages.