olymmath

AT-OEMO-FED1 2006

Austrian Mathematical Olympiad, Federal Competition Part 1 2006.

Other problems

Problem 1

Let nn be a non-negative integer, which ends written in decimal notation on exactly kk zeros, but which is bigger than 10k10^k . For a nn is only k=k(n)≥2k=k(n)\geq2 known. In how many different ways (as a function of k=k(n)≥2k=k(n)\geq2 ) can nn be written as difference of two squares of non-negative integers at least?

Problem 2

Show that the sequence an=(n+1)nn2−n7n2+1a_n = \frac {(n + 1)^nn^{2 - n}}{7n^2 + 1} is strictly monotonically increasing, where n=0,1,2,…n = 0,1,2, \dots .

Problem 3

In the triangle ABCABC let DD and EE be the boundary points of the incircle with the sides BCBC and ACAC . Show that if AD=BEAD=BE holds, then the triangle is isoceles.

Problem 4

Given is the function f=⌊x2⌋+{x}f= \lfloor x^2 \rfloor + \{ x \} for all positive reals xx . ( ⌊x⌋\lfloor x \rfloor denotes the largest integer less than or equal xx and {x}=x−⌊x⌋\{ x \} = x - \lfloor x \rfloor .) Show that there exists an arithmetic sequence of different positive rational numbers, which all have the denominator 33 , if they are a reduced fraction, and don't lie in the range of the function ff .