0% found this document useful (0 votes)
16 views

Solution - 4 February 2011

This document contains solutions to problems from the first round of the Dutch Mathematical Olympiad held on February 4, 2011. The solutions involve topics like geometry, number theory, combinatorics, and algebra.

Uploaded by

Lia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

Solution - 4 February 2011

This document contains solutions to problems from the first round of the Dutch Mathematical Olympiad held on February 4, 2011. The solutions involve topics like geometry, number theory, combinatorics, and algebra.

Uploaded by

Lia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

First round

Dutch Mathematical Olympiad


Friday 4 Februari 2011

Solutions
2
0
A1. D) 5 Notice that all squares in the second row and second column 1
must be white. We consider two cases, depending on the color of the upper 1
left square. 2 0 1 1
If this square is white, then the last two squares in the first row and column
must be black. This determines the coloring. See the top figure.
If this square is black, both the frist row and first column require exactly
one more black square. For each of the resulting 2 × 2 = 4 choices, there
is exactly one solution. Indeed, one row and one column are left that need
an additional black square. Therefore the square at the intersection of this
row and column must be colored black, and the remaining squares must be
colored white, see bottom four figures.

A2. C) June The year of the date we are looking for, starts with a digit 2 or higher. We will
look for the first date of which the year starts with digit 2, and all eight digits are different. If
such a date exists, we are done.
For the month, both 11 (two equal digits) and 12 (digit 2 is already used) can be rejected.
Therefore, the month (01 to 10) contains digit 0. This implies that the day starts with digit
1 or 3. In the second case, it’s the 31st, since digit 0 is already taken. In both cases, the day
contains digit 1. Both digit 0 and 1 being taken, the smallest possible year is 2345. The smallest
number we can use for the month is then 06, that is, June. Finally, the day will be the 17th.
Observe that the constructed date 17-06-2345 consists of eight different digits, as required.


A3. B) 8 + 3 3 The heptagon can be partitioned into two squares and three B A
equilateral triangles, all with sides of length 2. We know that each of the
C G
squares has an area of 4. Using the √ Pythagorean √ theorem, we can compute M
2
the height of triangle√ABM√to be 2 − 1 = 3. Hence, the area of the
triangle equals 12 · 2 · 3 = 3. Summing up the areas of the squares and D F
√ √
triangles, we arrive at 2 · 4 + 3 · 3 = 8 + 3 3 for the area of the heptagon. E

A4. A) only Alice As Brian’s prediction was wrong, he has at least six correct answers. Alice’s
prediction was wrong as well, which implies that Brian answered at the most one more question
correctly than Alice. Hence, Alice has at least five correct answers. Since Carl made a wrong
prediction, he answered more questions correctly than Alice, hence at least six. Alice cannot
have more thatn five correct answers. Indeed, then Carl would have seven correct answers,
leading to a total of at least 6 + 6 + 7 = 19 correct answers, as the teacher (incorrectly)
predicted. We can conclude that Alice answered five questions correctly. Since the others have
at least six correct answers, Alice is the only one with the smallest number of correct answers.

A5. C) 62 Jack can certainly write down 62 numbers, for example: the numbers from 1 to
62 (since 62 + 61 < 125). More than 62 numbers will not be possible. Indeed, the numbers from
25 to 100 can be partitioned into pairs of sum 125: 25 + 100 = 125, 26 + 99 = 125, and so on
up to 62 + 63 = 125. Jack must skip at least one number from each of the 38 pairs. In total,
therefore, he can write down no more than 100 − 38 = 62 of the numbers.
A6. B) 1 Using long division to divide a = 11 · · · 11 (2011 digits) by 37, you will quickly
notice that 111 is divisible by 37. This is the fact that we will be using. It implies that the
number 1110 · · · 0 is divisible by 37, regardless of the number of trailing zeros. In particular, the
following numbers are divisible by 37: 1110 · · · 0 (2008 zeros), 1110 · · · 0 (2005 zeros), 1110 · · · 0
(2002 zeros), and so on up to 1110 (1 zero). The sum of these numbers equals 1 . . . 10 (2010
digits 1), which is again divisible by 37. In conlusion, the remainder of a when divided by 37 is
1, since a − 1 is divisible by 37.

A7. C) 35 After 140 seconds, Ann has made 7 rounds and Bob only 5. At that moment,
Ann leads by two full rounds. Hence after only 140
4 = 35 seconds, Anne leads by half a round.
That is exactly the first moment she and Bob are at maximal distance from each other.
B C
S
A8. B) 132◦ Denote the center of the 15-gon by M and the inter-
section of AC and BD by S (see figure). In quadrilateral M RST , R T
A D
we see that ∠M RS = 90◦ and ∠ST M = 90◦ . Furthermore, we
see that ∠T M R = 15 2
· 360◦ = 48◦ . As the angles of a quadrilat-
eral sum to 360 , we find: ∠RST = 360◦ − 2 · 90◦ − 48◦ = 132◦ .
◦ M

Observe that ∠RST and ∠BSC are opposite angles. Hence the
sought-after angle also equals 132◦ .

1
B1. −1 We are given that x = 1+x . Clearly, x 6= 0, since 0 6= 11 . Hence, on both sides
of the equation, we may flip the numerator and denominator of the fraction. This results in:
1 1
x = 1 + x. Combining both formulas, we obtain x − x = x − (1 + x) = −1.

B2. 20 Consider three escalators in a row: the first one going up, the second standing
still, and the third going down. If Dion walkes up the first escalator, he arrives at the top
after exactly 12 steps. Raymond, walking up the third escalator, takes 60 steps to reach the
top and reaches only 51 of the escalator after 12 steps. A third person, say Julian, takes the
second escalator and walks at the same pace as Dion and Raymond. After 12 steps, he will be
positioned exactly in between Dion and Julian, at ( 55 + 15 )/2 = 35 of the escalator. Therefore,
he will need 53 · 12 = 20 steps to reach the top.

B3. 120 Let’s call the eldest scout A. There are 5 possibilities for finding him a partner
B for the first day. Then, there are 4 possible partners C for B on the second day, because he
cannot be paired with A twice. Now for C, there are 3 possible partners D on the first day,
since he cannot go with B again, and A is already paired. For D, there are now 2 possible
partners E on the second day, since B and C are already paired, and A cannot be his partner
because that would leave two scouts that are forced to form a pair on both days. Finally, there
is one scout left. He has no choice but to team op with E on the first day, and with A on the
second. In total there are 5 × 4 × 3 × 2 = 120 possibilities.

C
3
B4. 8 Consider the inscribed circle. We denote its center by O and
R
its radius by r. The points where the circle is tangent to AB and BC are
denoted by M and R, respectively. O

Since A, O and R are on a line, we have: |AO| = |AR| − |OR| = 1 − r. We


also know that |OM | = r and |AM | = 12 |AB| = 12 . Using the Pythagorean
theorem, we find |AM |2 + |OM |2 = |AO|2 , and hence 14 + r2 = (1 − r)2 = A M B

r2 − 2r + 1. This implies that 2r = 43 and therefore r = 38 .

c 2011 Stichting Nederlandse Wiskunde Olympiade

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy