Scribd Logo
Upload

Welcome to Scribd!

  • Balkan MO 1994: Novi Sad, Yugoslavia

    Uploaded by

    Okla
    3 views1 page
    The document is a list of 4 math problems from the Balkan Mathematical Olympiad held in 1994 in Novi Sad, Yugoslavia. Problem 1 asks to construct a line through a given point inside an angle such that the area of the resulting triangle equals the square of the distance from the point to the vertex. Problem 2 asks to prove that a given polynomial has at most one zero. Problem 3 asks to determine the largest possible sum of distances between consecutive elements of a permutation. Problem 4 asks to find the smallest number of people for which a specific acquaintance relationship is possible.

    Original Description:

    Original Title

    Balkan_MO-1994

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a list of 4 math problems from the Balkan Mathematical Olympiad held in 1994 in Novi Sad, Yugoslavia. Problem 1 asks to construct a line through a given point inside an angle such that the area of the resulting triangle equals the square of the distance from the point to the vertex. Problem 2 asks to prove that a given polynomial has at most one zero. Problem 3 asks to determine the largest possible sum of distances between consecutive elements of a permutation. Problem 4 asks to find the smallest number of people for which a specific acquaintance relationship is possible.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Balkan MO 1994: Novi Sad, Yugoslavia

    Uploaded by

    Okla
    The document is a list of 4 math problems from the Balkan Mathematical Olympiad held in 1994 in Novi Sad, Yugoslavia. Problem 1 asks to construct a line through a given point inside an angle such that the area of the resulting triangle equals the square of the distance from the point to the vertex. Problem 2 asks to prove that a given polynomial has at most one zero. Problem 3 asks to determine the largest possible sum of distances between consecutive elements of a permutation. Problem 4 asks to find the smallest number of people for which a specific acquaintance relationship is possible.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Balkan MO 1994

    Novi Sad, Yugoslavia

    1 An acute angle XAY and a point P inside the angle are given. Construct (using a ruler and a compass) a line that passes through P and intersects the rays AX and AY at B and C such that the area of the triangle ABC equals AP 2 . Greece 2 Let n be an integer. Prove that the polynomial f (x) has at most one zero, where f (x) = x4 1994x3 + (1993 + n)x2 11x + n. Greece 3 Let a1 , a2 , . . . , an be a permutation of the numbers 1, 2, . . . , n, with n 2. Determine the largest possible value of the sum S (n) = |a2 a1 | + |a3 a2 | + + |an an1 |. Romania 4 Find the smallest number n 5 for which there can exist a set of n people, such that any two people who are acquainted have no common acquaintances, and any two people who are not acquainted have exactly two common acquaintances. Bulgaria

    This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

    Page 1

    You might also like