olymmath

DE-MO 2001

German Mathematical Olympiad 2001.

Other problems

Problem 1

Determine all real numbers qq for which the equation x4−40x2+q=0x^4 -40x^2 +q = 0 has four real solutions which form an arithmetic progression

Problem 2

Determine the maximum possible number of points you can place in a rectangle with lengths 1414 and 2828 such that any two of those points are more than 1010 apart from each other.

Problem 3

Wiebke and Stefan play the following game on a rectangular sheet of paper. They start with a rectangle with 6060 rows and 4040 columns and cut it in turns into smaller rectangles. The cuttings must be made along the gridlines, and a player in turn may cut only one smaller rectangle. By that, Stefan makes only vertical cuts, while Wiebke makes only horizontal cuts. A player who cannot make a regular move loses the game. (a) Who has a winning strategy if Stefan makes the first move? (b) Who has a winning strategy if Wiebke makes the first move?

Problem 4

In how many ways can the "Nikolaus' House" (see the picture) be drawn? Edges may not be erased nor duplicated, and no additional edges may be drawn. Image

Problem 5

The Fibonacci sequence is given by x1=x2=1x_1 = x_2 = 1 and xk+2=xk+1+xkx_{k+2} = x_{k+1} + x_k for each k∈Nk \in N . (a) Prove that there are Fibonacci numbes that end in a 99 in the decimal system. (b) Determine for which nn can a Fibonacci number end in nn 99 -s in the decimal system.