Scribd
Upload
74 views2 pages

Aops Community 2005 Austrian-Polish Competition: N N N N N N

Se2005

Uploaded by

eulerfermat229
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views2 pages

Aops Community 2005 Austrian-Polish Competition: N N N N N N

Se2005

Uploaded by

eulerfermat229
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

AoPS Community 2005 Austrian-Polish Competition

www.artofproblemsolving.com/community/c103441
by randomusername

– Individual Competition, Day 1, June 30th 2005

1 For a convex n-gon Pn , we say that a convex quadrangle Q is a diagonal-quadrangle of Pn , if its


vertices are vertices of Pn and its sides are diagonals of Pn . Let dn be the number of diagonal-
quadrangles of a convex n-gon. Determine dn for all n ≥ 8.

2 Determine all polynomials P with integer coefficients satisfying

P (P (P (P (P (x))))) = x28 · P (P (x)) ∀x ∈ R

3 Let a0 , a1 , a2 , ..., an be real numbers, which fulfill the following two conditions:
a) 0 = a0 ≤ a1 ≤ a2 ≤ ... ≤ an .
b) For all 0 ≤ i < j ≤ n holds: aj − ai ≤ j − i.
Prove that !2
n
X n
X
ai ≥ a3i .
i=0 i=0

– Individual Competition, Day 2, July 1st 2005

4 Determine the smallest natural number a ≥ 2 for which there exists a prime number p and a
natural number b ≥ 2 such that
ap − a
= b2 .
p

5 Given is a convex quadrilateral ABCD with AB = CD. Draw the triangles ABE and CDF
outside ABCD so that ∠ABE = ∠DCF and ∠BAE = ∠F DC. Prove that the midpoints of
AD, BC and EF are collinear.

6 Determine all monotone functions f : Z → Z, so that for all x, y ∈ Z

f (x2005 + y 2005 ) = (f (x))2005 + (f (y))2005

© 2019 AoPS Incorporated 1


AoPS Community 2005 Austrian-Polish Competition

– Team Competition, July 2nd 2005

7 For each natural number n ≥ 2, solve the following system of equations in the integers x1 , x2 , ..., xn :
 
Y
(n2 − n)xi +  xj  S = n3 − n2 , ∀1 ≤ i ≤ n
j6=i

where
S = x21 + x22 + · · · + x2n .

8 Given the sets Rmn = {(x, y) | x = 0, 1, . . . , m; y = 0, 1, . . . , n}, consider functions f : Rmn →


{−1, 0, 1} with the following property: for each quadruple of points A1 , A2 , A3 , A4 ∈ Rmn which
form a square with side length 0 < s < 3, we have

f (A1 ) + f (A2 ) + f (A3 ) + f (A4 ) = 0.

For each pair (m, n) of positive integers, determine F (m, n), the number of such functions f
on Rmn .

9 Consider the equation x3 + y 3 + z 3 = 2.


a) Prove that it has infinitely many integer solutions x, y, z.
b) Determine all integer solutions x, y, z with |x|, |y|, |z| ≤ 28.

10 Determine all pairs (k, n) of non-negative integers such that the following inequality holds
∀x, y > 0:
yn (1 + y)n
1+ k ≥ .
x (1 + x)k

– Source: http://www.artofproblemsolving.com/community/c6h49814p319242.

© 2019 AoPS Incorporated 2


Art of Problem Solving is an ACS WASC Accredited School.

You might also like