Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Aops Community 2004 Austrian-Polish Competition

    Uploaded by

    eulerfermat229
    Se33

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Aops Community 2004 Austrian-Polish Competition

    Uploaded by

    eulerfermat229
    5 views3 pages
    Se33

    Original Title

    103440

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Se33

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    5 views3 pages

    Aops Community 2004 Austrian-Polish Competition

    Uploaded by

    eulerfermat229
    Se33

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    AoPS Community 2004 Austrian-Polish Competition

    www.artofproblemsolving.com/community/c103440
    by randomusername, orl

    – Individual Competition, Day 1, June 24th 2004

    1 Let S(n) be the sum of digits for any positive integer n (in decimal notation).
    102004
    X−1
    Let N = S(k). Determine S(N ).
    k=102003

    2 In a triangle ABC let D be the intersection of the angle bisector of γ, angle at C, with the side
    AB. And let F be the area of the triangle ABC. Prove the following inequality:

     
    1 1
    2· F · − ≤ AB.
    AD BD

    3 Solve√the following
    √ system of equations in R where all square roots are non-negative:
    a − √ 1 − b + √ 1 − c2 = d
    2

    b − √1 − c2 + √1 − d2 = a
    c − √1 − d2 + √1 − a2 = b
    d − 1 − a2 + 1 − b2 = c

    – Individual Competition, Day 2, June 25th 2004

    4 Determine all n ∈ N for which n10 + n5 + 1 is prime.

    5 Determine all n for which the system with of equations can be solved in R:
    n
    X
    xk = 27
    k=1

    and
    n  24
    Y 3
    xk = .
    2
    k=1

    © 2019 AoPS Incorporated 1


    AoPS Community 2004 Austrian-Polish Competition

    6 For n = 2m (m is a positive integer) consider the set M (n) = {1, 2, ..., n} of natural numbers.
    Prove that there exists an order a1 , a2 , ..., an of the elements of M(n), so that for all 1 ≤ i < j <
    k ≤ n holds: aj − ai 6= ak − aj .

    – Team Competition, June 26th 2004

    7 Determine all functions f : Z+ → Z which satisfy the following condition for all pairs (x, y) of
    relatively prime positive integers:

    f (x + y) = f (x + 1) + f (y + 1).

    8 a.) Prove that for n = 4 or n ≥ 6 each triangle ABC can be decomposed in n similar (not
    necessarily congruent) triangles.

    b.) Show: An equilateral triangle can neither be composed in 3 nor 5 triangles.

    c.) Is there a triangle ABC which can be decomposed in 3 and 5 triangles, analogously to
    a.). Either give an example or prove that there is not such a triangle.

    9 Given are the sequences

    (..., a−2 , a−1 , a0 , a1 , a2 , ...); (..., b−2 , b−1 , b0 , b1 , b2 , ...); (..., c−2 , c−1 , c0 , c1 , c2 , ...)

    of positive real numbers. For each integer n the following inequalities hold:
    1
    an ≥ (bn+1 + cn−1 )
    2
    1
    bn ≥ (cn+1 + an−1 )
    2
    1
    cn ≥ (an+1 + bn−1 )
    2
    Determine a2005 , b2005 , c2005 , if a0 = 26, b0 = 6, c0 = 2004.

    10 For each polynomial Q(x) let M (Q) be the set of non-negative integers x with 0 < Q(x) < 2004.
    We consider polynomials Pn (x) of the form

    Pn (x) = xn + a1 · xn−1 + . . . + an−1 · x + 1

    with coefficients ai ∈ {±1} for i = 1, 2, . . . , n − 1.

    For each n = 3k , k > 0 determine:

    © 2019 AoPS Incorporated 2


    AoPS Community 2004 Austrian-Polish Competition

    a.) mn which represents the maximum of elements in M (Pn ) for all such polynomials Pn (x)

    b.) all polynomials Pn (x) for which |M (Pn )| = mn .

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

    © 2019 AoPS Incorporated 3


    Art of Problem Solving is an ACS WASC Accredited School.

    You might also like