olymmath

AT-OEMO-FED1 2005

Austrian Mathematical Olympiad, Federal Competition Part 1 2005.

Other problems

Problem 1

Prove that there are infinitely many multiples of 2005 that contain all the digits 0, 1, 2,...,9 an equal number of times.

Problem 2

For how many integers aa with ∣a∣≤2005|a| \leq 2005 , does the system x2=y+ax^2=y+a y2=x+ay^2=x+a have integer solutions?

Problem 3

For 3 real numbers a,b,ca,b,c let sn=an+bn+cns_n=a^{n}+b^{n}+c^{n} . It is known that s1=2s_1=2 , s2=6s_2=6 and s3=14s_3=14 . Prove that for all natural numbers n>1n>1 , we have ∣sn2−sn−1sn+1∣=8|s^2_n-s_{n-1}s_{n+1}|=8

Problem 4

We're given two congruent, equilateral triangles ABCABC and PQRPQR with parallel sides, but one has one vertex pointing up and the other one has the vertex pointing down. One is placed above the other so that the area of intersection is a hexagon A1A2A3A4A5A6A_1A_2A_3A_4A_5A_6 (labelled counterclockwise). Prove that A1A4A_1A_4 , A2A5A_2A_5 and A3A6A_3A_6 are concurrent.