olymmath

DANUBE 2007

Danube Mathematical Competition 2007.

Other problems

Problem 1

Let n≥2n\ge2 be a positive integer and denote by SnS_n the set of all permutations of the set {1,2,…,n}\{1,2,\ldots,n\} . For σ∈Sn\sigma\in S_n define l(σ)l(\sigma) to be min⁡1≤i≤n−1∣σ(i+1)−σ(i)∣\min_{1\le i\le n-1}\left|\sigma(i+1)-\sigma(i)\right| . Determine max⁡σ∈Snl(σ)\max_{\sigma\in S_n}l(\sigma) .

Problem 2

Let ABCDABCD be an inscribed quadrilateral and let EE be the midpoint of the diagonal BDBD . Let Γ1,Γ2,Γ3,Γ4\Gamma_1,\Gamma_2,\Gamma_3,\Gamma_4 be the circumcircles of triangles AEBAEB , BECBEC , CEDCED and DEADEA respectively. Prove that if Γ4\Gamma_4 is tangent to the line CDCD , then Γ1,Γ2,Γ3\Gamma_1,\Gamma_2,\Gamma_3 are tangent to the lines BC,AB,ADBC,AB,AD respectively.

Problem 3

For each positive integer nn , define f(n)f(n) as the exponent of the 22 in the decomposition in prime factors of the number n!n! . Prove that the equation n−f(n)=an-f(n)=a has infinitely many solutions for any positive integer aa .

Problem 4

Let a,na,n be positive integers such that a≥(n−1)!a\ge(n-1)! . Prove that there exist nn distinct prime numbers p1,…,pnp_1,\ldots,p_n so that pi∣a+ip_i|a+i , for all i=1,…,n‾i=\overline{1,\ldots,n} .