olymmath

SE-SKOLORNAS 1969

Swedish Mathematical Competition 1969.

Other problems

Problem 1

Find all integers m, n such that m3=n3+nm^3 = n^3 + n .

Problem 2

Show that tan⁡π3n\tan \frac{\pi}{3n} is irrational for all positive integers nn .

Problem 3

a1≤a2≤...≤ana_1 \le a_2 \le ... \le a_n is a sequence of reals b1,b2,b3,...,bnb_1, _b2, b_3,..., b_n is any rearrangement of the sequence B1≤B2≤...≤BnB_1 \le B_2 \le ...\le B_n . Show that ∑aibi≤∑aiBi\sum a_ib_i \le \sum a_i B_i .

Problem 4

Define g(x)g(x) as the largest value of ∣y2−xy∣|y^2 - xy| for yy in [0,1][0, 1] . Find the minimum value of gg (for real xx ).

Problem 5

Let N=a1a2...anN = a_1a_2...a_n in binary. Show that if a1−a2+a3−...+(−1)n−1an=0a_1-a_2 + a_3 -... + (-1)^{n-1}a_n = 0 mod 33 , then N=0N = 0 mod 33 .

Problem 6

Given 3n3n points in the plane, no three collinear, is it always possible to form nn triangles (with vertices at the points), so that no point in the plane lies in more than one triangle?