• No results found

Second Round Dutch Mathematical Olympiad

N/A
N/A
Protected

Academic year: 2021

Share "Second Round Dutch Mathematical Olympiad"

Copied!
2
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Second Round

Dutch Mathematical Olympiad

Friday, March 26, 2010

• Time available: 2.5 hours.

• The competition consists of five B-problems and two C-problems.

• Formula sheets and calculators are not allowed. You can only use a pen, compass, ruler or set square and of course your mental skills.

• Good luck!

B-problems

The answer to each B-problem is a number. A correct answer is awarded 4 points, for a wrong answer no points are given. Please work very accurately: a minor error in a calculation may result in a wrong answer.

NOTE: all answers should be given in exact form, like 1181 or 58 or 14( 5 + π).

B1. Alice has got five real numbers a < b < c < d < e. She takes the sum of each pair of numbers and writes down the ten sums. The three smallest sums are 32, 36 and 37, while the two largest sums are 48 and 51. Determine e.

B2. Let AB be a diameter of a circle. Point C lies on line segment AB such that 2 · |AC| = |BC|. The points D and E lie on the circle such that CD is perpendi- cular to AB and such that DE is also a diameter of the circle. Write the areas of the triangles ABD and CDE as O(ABD) and O(CDE). Determine the value of O(ABD)O(CDE).

B3. A 24-hour digital clock displays the times from 00:00:00 till 23:59:59 during the day. You can add the digits of the time on every second of the day; this will give you an integer. For example, at 13:07:14 you will get 1 + 3 + 0 + 7 + 1 + 4 = 16.

When you write down this sum for every possible state of the clock and then take the average of all these numbers, what will be the result?

B4. For the infinite sequence of numbers

0, 1, 2, 2, 1, −1, −2, −1, 1, 3, . . .

the following rule holds. For each four consecutive numbers . . . , a, b, c, d, . . . of the sequence the number d is equal to c minus the smallest of the two numbers a and b. For example, the ninth number of the sequence is equal to −1 − (−2) = 1 and the tenth number is equal to 1 − (−2) = 3. Calculate the 100th number of this sequence.

B5. Raymond has got five coins. On the heads side of each coin is the number 1. On the tails sides of the coins are the fractions 12, 13, 14, 15 and 16 respectively. Because every coin has got either its heads side or its tails side facing up, there are 32 ways to put the five coins on the table. Raymond multiplies the five numbers facing up for each of these 32 situations and writes down all results.

If Raymond adds up these 32 numbers, what will be the final result?

Please continue on the other side.

(2)

C-problems

For the C-problems not only the answer is important; you also have to describe the way you solved the problem. Use separate sheets of paper for each C-problem. A correct and well-explained answer is awarded 10 points.

Partial solutions may also be worth some points. Therefore, write neatly and hand in your drafts (for each problem).

C1. Determine all positive integers n consisting of four digits for which it holds that n plus the sum of the digits of n is equal to 2010.

C2. Line segment AB has length 10. A point C lies on line segment AB such that

|AC| = 6 and |CB| = 4. Two points X and Y lie on the same side of the line AB, such that |Y B| = |Y C| = 3, |XA| = 8 and |XC| = 6. Determine the length of line segment XY .

Stichting Nederlandse Wiskunde Olympiadec

Referenties

GERELATEERDE DOCUMENTEN

a) Kees starts out with three different numbers. He adds each pair of these numbers to obtain three outcomes. According to Jan, these three outcomes can be evenly spread only if

A number of students took a test for which the maximum possible score was 100 points?. Every- one had a score of at least

Dirk says: “Anne is a liar.” and “Bert or Chris stole the gold.”.. How many of these eight statements

The number of girls that have chosen French, plus the number of boys that have chosen German, is equal to 16?. What is the number of girls that have

Only at the moment when all cards of type 2 are gone and Thomas takes the last card of type 1 (case (i)), Nils cannot execute his planned move.. However, in that case Nils cannot

Indeed, if we place the digits in any order, we obtain an even number (since it is divisible by 12) because of property (3).. Since we can put any of the digits in the last

Since there are 999 numbers written on the pavement, of which 500 are red and 500 are blue, we have at least one bicoloured number by the pigeonhole principle.. Consider such

(b) Using six available numbers, there are only six possible groups of five numbers (each obtained by leaving out one of the six numbers).. Those six groups do satisfy the