olymmath

SE-SKOLORNAS 2003

Swedish Mathematical Competition 2003.

Other problems

Problem 1

If x,y,z,wx, y, z, w are nonnegative real numbers satisfying {y=x−2003z=2y−2003w=3z−2003\left\{ \begin{array}{l}y = x - 2003 z = 2y - 2003 w = 3z - 2003 \end{array} \right. find the smallest possible value of xx and the values of y,z,wy, z, w corresponding to it.

Problem 2

In a lecture hall some chairs are placed in rows and columns, forming a rectangle. In each row there are 66 boys sitting and in each column there are 88 girls sitting, whereas 1515 places are not taken. What can be said about the number of rows and that of columns?

Problem 3

Find all real solutions xx of the equation ⌊x2−2⌋+2⌊x⌋=⌊x⌋2.\lfloor x^2-2 \rfloor +2 \lfloor x \rfloor = \lfloor x \rfloor ^2. .

Problem 4

Determine all polynomials PP with real coeffients such that 1+P(x)=12(P(x−1)+P(x+1))1 + P(x) = \frac12 (P(x -1) + P(x + 1)) for all real xx .

Problem 5

Given two positive numbers a,ba, b , how many non-congruent plane quadrilaterals are there such that AB=aAB = a , BC=CD=DA=bBC = CD = DA = b and ∠B=90o\angle B = 90^o ?

Problem 6

Consider an infinite square board with an integer written in each square. Assume that for each square the integer in it is equal to the sum of its neighbor to the left and its neighbor above. Assume also that there exists a row R0R_0 in the board such that all numbers in R0R_0 are positive. Denote by R1R_1 the row below R0R_0 , by R2R_2 the row below R1R_1 etc. Show that for each N≥1N \ge 1 the row RNR_N cannot contain more than NN zeroes.