olymmath

AUSTRIAN-POLISH 1983

Austrian-Polish Mathematics Competition 1983.

Other problems

Problem 1

Nonnegative real numbers a,b,x,ya, b,x,y satisfy a5+b5≤a^5 + b^5 \le 1 and x5+y5≤1x^5 + y^5 \le 1 . Prove that a2x3+b2y3≤1a^2x^3 + b^2y^3 \le 1 .

Problem 2

Find all triples of positive integers (p,q,n)(p, q, n) with pp and qq prime, such that p(p+1)+q(q+1)=n(n+1)p(p+1)+q(q+1) = n(n+1) .

Problem 3

A bounded planar region of area SS is covered by a finite family FF of closed discs. Prove that FF contains a subfamily consisting of pairwise disjoint discs, of joint area not less than S/9S/9 .

Problem 4

The set NN has been partitioned into two sets A and BB . Show that for every n∈Nn \in N there exist distinct integers a,b>na, b > n such that a,b,a+ba, b, a + b either all belong to AA or all belong to BB .

Problem 5

Let a1<a2<a3<a4a_1 < a_2 < a_3 < a_4 be given positive numbers. Find all real values of parameter cc for which the system {x1+x2+x3+x4=1a1x1+a2x2+a3x3+a4x4=ca12x1+a22x2+a32x3+a42x4=c2\begin{cases} x_1 + x_2 + x_3 + x_4 = 1 a_1x_1 + a_2 x_2 + a_3x_3 + a_4 x_4 = c a_1^2x_1 + a_2^2 x_2 + a_3^2x_3 + a_4^2 x_4 = c^2\end{cases} has a solution in nonnegative (x1,x2,x3,x4)(x_1,x_2,x_3,x_4) real numbers.

Problem 6

Six straight lines are given in space. Among any three of them, two are perpendicular. Show that the given lines can be labeled ℓ1,...,ℓ6\ell_1,...,\ell_6 in such a way that ℓ1,ℓ2,ℓ3\ell_1, \ell_2, \ell_3 are pairwise perpendicular, and so are ℓ4,ℓ5,ℓ6\ell_4, \ell_5, \ell_6 .

Problem 7

Let P1,P2,P3,P4P_1,P_2,P_3,P_4 be four distinct points in the plane. Suppose ℓ1,ℓ2,…,ℓ6\ell_1,\ell_2, … , \ell_6 are closed segments in that plane with the following property: Every straight line passing through at least one of the points PiP_i meets the union ℓ1∪ℓ2∪…∪ℓ6\ell_1 \cup \ell_2\cup … \cup\ell_6 in exactly two points. Prove or disprove that the segments ℓi\ell_i necessarily form a hexagon.

Problem 8

(a) Prove that (2n+1−1)!(2^{n+1}-1)! is divisible by ∏i=0n(2n+1−i−1)2i\prod_{i=0}^n (2^{n+1-i}-1)^{2^i } , for every natural number n (b) Define the sequence ( cnc_n ) by c1=1c_1=1 and cn=4n−6ncn−1c_{n}=\frac{4n-6}{n}c_{n-1} for n≥2n\ge 2 . Show that each cnc_n is an integer.

Problem 9

To each side of the regular pp -gon of side length 11 there is attached a 1×k1 \times k rectangle, partitioned into kk unit cells, where kk and pp are given positive integers and p an odd prime. Let PP be the resulting nonconvex star-like polygonal figure consisting of kp+1kp + 1 regions ( kpkp unit cells and the pp -gon). Each region is to be colored in one of three colors, adjacent regions having different colors. Furthermore, it is required that the colored figure should not have a symmetry axis. In how many ways can this be done?