olymmath

AUSTRIAN-POLISH 1996

Austrian-Polish Mathematics Competition 1996.

Other problems

Problem 1

Let k≥1k \ge 1 be a positive integer. Prove that there exist exactly 3k−13^{k-1} natural numbers nn with the following properties: (i) nn has exactly kk digits (in decimal representation), (ii) all the digits of nn are odd, (iii) nn is divisible by 55 , (iv) the number m=n/5m = n/5 has kk odd digits

Problem 2

A convex hexagon ABCDEFABCDEF satisfies the following conditions:

  1. AB∥DEAB\parallel DE , BC∥EFBC\parallel EF , and CD∥FACD\parallel FA .
  2. The distances between these pairs of parallel lines are the same.
  3. ∠FAB=∠CDE=90∘\angle FAB = \angle CDE = 90^\circ Prove that the diagonals BEBE and CFCF of the hexagon intersect with angle 4545 degrees.

∙\bullet Thank you dear Babis Stergiou for your translation. :P

Problem 3

The polynomials Pn(x)P_{n}(x) are defined by P0(x)=0,P1(x)=xP_{0}(x)=0,P_{1}(x)=x and Pn(x)=xPn−1(x)+(1−x)Pn−2(x)n≥2P_{n}(x)=xP_{n-1}(x)+(1-x)P_{n-2}(x) n\geq 2 For every natural number n≥1n\geq 1 , find all real numbers xx satisfying the equation Pn(x)=0P_{n}(x)=0 .

Problem 4

Real numbers x,y,z,tx,y,z, t satisfy x+y+z+t=0x + y + z +t = 0 and x2+y2+z2+t2=1x^2+ y^2+ z^2+t^2 = 1 .

Prove that −1≤xy+yz+zt+tx≤0- 1 \le xy + yz + zt + tx \le 0 .

Problem 5

A sphere SS divides every edge of a convex polyhedron PP into three equal parts. Show that there exists a sphere tangent to all the edges of PP .

Problem 6

Given natural numbers n>k>1n > k > 1 , find all real solutions x1,...,xnx_1,..., x_n of the system xi3(xi2+xi+12+...+xi+k−12)=xi−12x_i^3(x_i^2 + x_{i+1}^2+... +x_{i+k-1}^2) = x_{i-1}^2 for 1 ≤i≤n\le i \le n . Here xn+i=xix_{n+i} = x_i for all ii .

Problem 7

Prove there are no such integers k,mk, m which satisfy k≥0,m≥0k \ge 0, m \ge 0 and k!+48=48(k+1)mk!+48=48(k+1)^m .

Problem 8

Show that there is no polynomial P(x)P(x) of degree 998998 with real coefficients which satisfies P(x2+1)=P(x)2−1P(x^2 + 1) = P(x)^2 - 1 for all xx .

Problem 9

For any triple (a,b,c)(a, b, c) of positive integers, not all equal, We are given sufficiently many rectangular blocks of size a×b×ca \times b \times c . We use these blocks to fill up a cubic box of edge 1010 . (a) Assume we have used at least 100100 blocks. Show that there are two blocks, one of which is a translate of the other. (b) Find a number smaller than 100100 (the smaller, the better) for which the above statement still holds.