olymmath

CZ-SK-MO 1986

Czech-Slovak Mathematical Olympiad 1986.

Other problems

Problem 1

Given n∈Nn \in N , let AA be a family of subsets of {1,2,...,n}\{1,2,...,n\} . If for every two sets B,C∈AB,C \in A the set (B∪C)−(B∩C)(B \cup C) -(B \cap C) has an even number of elements, find the largest possible number of elements of AA .

Problem 2

Let P(x)P(x) be a polynomial with integer coefficients of degree n≥3n \ge 3 . If x1,...,xmx_1,...,x_m ( n≥m≥3n\ge m\ge3 ) are different integers such that P(x1)=P(x2)=...=P(xm)=1P(x_1) = P(x_2) = ... = P(x_m) = 1 , prove that PP cannot have integer roots$.

Problem 3

Prove that the entire space can be partitioned into "crosses" made of seven unit cubes as shown in the picture. Image

Problem 4

Let C1,C2C_1,C_2 , and C3C_3 be points inside a bounded convex planar set MM . Rays l1,l2,l3l_1,l_2,l_3 emanating from C1,C2,C3C_1,C_2,C_3 respectively partition the complement of the set M∪l1∪l2∪l3M \cup l_1 \cup l_2 \cup l_3 into three regions D1,D2,D3D_1,D_2,D_3 . Prove that if the convex sets AA and BB satisfy A∩lj=∅=B∩ljA\cap l_j =\emptyset = B\cap l_j and A∩Dj≠∅≠B∩DjA\cap D_j \ne \emptyset \ne B\cap D_j for j=1,2,3j = 1,2,3 , then A∩B≠∅A\cap B \ne \emptyset

Problem 5

A sequence of natural numbers a1,a2,...a_1,a_2,... satisfies a1=1,an+2=2an+1−an+2a_1 = 1, a_{n+2} = 2a_{n+1} - a_n +2 for n∈Nn \in N . Prove that for every natural nn there exists a natural mm such that anan+1=ama_na_{n+1} = a_m .

Problem 6

Assume that M⊂NM \subset N has the property that every two numbers m,nm,n of MM satisfy ∣m−n∣≥mn/25|m-n| \ge mn/25 . Prove that the set MM contains no more than 99 elements. Decide whether there exists such set M.