olymmath

IT-CESENATICO 1989

Italian Mathematical Olympiad 1989.

Other problems

Problem 1

Determine whether the equation x2+xy+y2=2x^2 +xy+y^2 = 2 has a solution (x,y)(x,y) in rational numbers.

Problem 2

There are 3030 men with their 3030 wives sitting at a round table. Show that there always exist two men who are on the same distance from their wives. (The seats are arranged at vertices of a regular polygon.)

Problem 3

Prove that, for every tetrahedron ABCDABCD , there exists a unique point PP in the interior of the tetrahedron such that the tetrahedra PABC,PABD,PACD,PBCDPABC,PABD,PACD,PBCD have equal volumes.

Problem 4

Points A,M,B,C,DA,M,B,C,D are given on a circle in this order such that AA and BB are equidistant from MM . Lines MDMD and ACAC intersect at EE and lines MCMC and BDBD intersect at FF . Prove that the quadrilateral CDEFCDEF is inscridable in a circle.

Problem 5

A fair coin is repeatedly tossed. We receive one marker for every "head" and two markers for every "tail". We win the game if, at some moment, we possess exactly 100100 markers. Is the probability of winning the game greater than, equal to, or less than 2/32/3 ?

Problem 6

Given a real number α\alpha , a function ff is defined on pairs of nonnegative integers by f(0,0)=1,f(m,0)=f(0,m)=0f(0,0) = 1, f(m,0) = f(0,m) = 0 for m>0m > 0 , f(m,n)=αf(m,n−1)+(1−α)f(m−1,n−1)f(m,n) = \alpha f(m,n-1)+(1- \alpha)f(m -1,n-1) for m,n>0m,n > 0 . Find the values of α\alpha such that ∣f(m,n)∣<1989| f(m,n)| < 1989 holds for any integers m,n≥0m,n \ge 0 .