MathDB
Problems
Contests
National and Regional Contests
Chile Contests
Chile Classification NMO
2006 Chile Classification NMO Seniors
2006 Chile Classification NMO Seniors
Part of
Chile Classification NMO
Subcontests
(1)
1
Hide problems
2006 Chile Classification / Qualifying NMO Seniors XVIII
p1. In a certain city, the bus system has
93
93
93
lines that pass, among all, through
2006
2006
2006
stops. This system allows you to travel by bus from each stop to each of the others, perhaps making transshipments. For two lines
A
,
B
A, B
A
,
B
there is at least one stop of
A
A
A
that is not of
B
B
B
, and vice versa. Could it happen in this system: a) if
58
58
58
lines are removed, preserving all stops, so that it is still possible to reach from each stop to each other? b) If
59
59
59
lines are removed, it doesn't matter which ones, then condition (a) is no longer true? p2. On the blackboard there was a trapezoid
A
B
C
D
ABCD
A
BC
D
with bases
A
B
AB
A
B
and
C
D
CD
C
D
, in which four points were marked points:
E
E
E
and
F
F
F
are the midpoints of the non-parallel sides
A
D
AD
A
D
and
B
C
BC
BC
,
O
O
O
the point of intersection of its diagonals and
P
P
P
an arbitrary point on the line
A
B
AB
A
B
. The entire figure was erased, except for the four dots. Describe a procedure to reconstruct the trapezium
A
B
C
D
ABCD
A
BC
D
. p3. Isabel has a candlestick with
n
n
n
equal candles. She likes to turn it on on Sundays with a curious system. The first Sunday light a candle for one hour, the second day she lights two candles for one hour and so on, until the
n
n
n
-th day she lights all the candles for one hour. For what values of
n
n
n
can Isabel get all the candles to be equally worn after of the last Sunday? In this case, show in what order they should be turned on. p4. Three cars
a
,
b
,
c
a, b, c
a
,
b
,
c
they leave at
6
6
6
am from three different towns
A
,
B
,
C
A, B, C
A
,
B
,
C
around three different peoples (and different from the first three)
D
,
E
,
F
D, E, F
D
,
E
,
F
, and they travel straight paths
A
D
AD
A
D
,
B
E
BE
BE
,
C
F
CF
CF
that are cut in pairs. Each car travels at a constant speed (can vary from car to car) such that each pair of cars reaches the intersection of their respective roads at the same time. The cars
a
,
b
a, b
a
,
b
intersect at
7
7
7
am, the cars
a
,
c
a, c
a
,
c
intersect at
9
9
9
am and cars
b
,
c
b, c
b
,
c
intersect at
10
10
10
am. Exactly at noon (at
12
12
12
am) the three cars arrive at their destinations. Distance
A
C
AC
A
C
is
99
99
99
Km. Determine the distance
E
F
EF
EF
. p5. A few days ago, in order to reestablish contact after separating their university companions, the Zweinstein-Curie couple organized a meeting at their home where they a total of
5
5
5
couples participated. During the greetings, very affectionate by the way, there was a great number of handshakes. Since the four marriages did not necessarily know each other. Then, Alberto, the host, decided to find out how many of them had greeted each other. To do this, once the greetings were over, Alberto asked each person, including his wife Marta, how many hands he had shaken. It is understood that no one shakes their own hand or that of their spouse; and that no one shakes another person's hand more than once. Much to Alberto's surprise, everyone has answered his question differently. How many hands did Marta shake? p6.
123
123
123
digits are ordered in a circular way. When reading the digits hourly from some point, a number with
123
123
123
digits is obtained. Show that if this number is divisible by
27
27
27
, then it does not matter since at which point we begin to read, all the resulting
123
123
123
-digit numbers will still be divisible by
127
127
127
.