olymmath

AUSTRIAN-POLISH 1982

Austrian-Polish Mathematics Competition 1982.

Other problems

Problem 1

Find all pairs (n,m)(n, m) of positive integers such that gcd((n+1)m−n,(n+1)m+3−n)>1gcd ((n + 1)^m - n, (n + 1)^{m+3} - n) > 1 .

Problem 2

Let FF be a closed convex region inside a circle CC with center OO and radius 11 . Furthermore, assume that from each point of CC one can draw two rays tangent to FF which form an angle of 60o60^o . Prove that FF is the disc centered at OO with radius 1/21/2 .

Problem 3

If n≥2n \ge 2 is an integer, prove the equality ∏k=1ntan⁡π3(1+3k3n−1)=∏k=1ncot⁡π3(1−3k3n−1)\prod_{k=1}^n \tan \frac{\pi}{3}\left(1+\frac{3^k}{3^n-1}\right)=\prod_{k=1}^n \cot \frac{\pi}{3}\left(1-\frac{3^k}{3^n-1}\right)

Problem 4

Let P(x)P(x) denote the product of all (decimal) digits of a natural number xx . For any positive integer x1x_1 , define the sequence (xn)(x_n) recursively by xn+1=xn+P(xn)x_{n+1} = x_n + P(x_n) . Prove or disprove that the sequence (xn)(x_n) is necessarily bounded.

Problem 5

Show that [0,1] cannot be partitioned into two disjoints sets A and B such that B=A+a for some real a.

Problem 6

An integer aa is given. Find all real-valued functions f(x)f (x) defined on integers x≥ax \ge a , satisfying the equation f(x+y)=f(x)f(y)f (x+y) = f (x) f (y) for all x,y≥ax,y \ge a with x+y≥ax + y \ge a .

Problem 7

Find the triple of positive integers (x,y,z)(x,y,z) with zz least possible for which there are positive integers a,b,c,da, b, c, d with the following properties: (i) xy=ab=cdx^y = a^b = c^d and x>a>cx > a > c (ii) z=ab=cdz = ab = cd (iii) x+y=a+bx + y = a + b .

Problem 8

Let PP be a point inside a regular tetrahedron ABCD with edge length 11 . Show that d(P,AB)+d(P,AC)+d(P,AD)+d(P,BC)+d(P,BD)+d(P,CD)≥322d(P,AB)+d(P,AC)+d(P,AD)+d(P,BC)+d(P,BD)+d(P,CD) \ge \frac{3}{2} \sqrt2 , with equality only when PP is the centroid of ABCDABCD . Here d(P,XY)d(P,XY) denotes the distance from point PP to line XYXY .

Problem 9

Define Sn=∑j,k=1n1j2+k2S_n=\sum_{j,k=1}^{n} \frac{1}{\sqrt{j^2+k^2}} . Find a positive constant CC such that the inequality n≤Sn≤Cnn\le S_n \le Cn holds for all n≥3n \ge 3 . (Note. The smaller CC , the better the solution.)