Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    BraMO09 PDF

    Uploaded by

    Faris Rafi Pramana
    The document contains 6 math problems from the 31st Brazilian Mathematical Olympiad in 2009. Problem 1 asks about summing the rows and columns of a 2009x2009 table of integers and whether the sums could all be perfect squares. Problem 2 involves finding a multiple of a prime number sum whose digits sum to 3 or less. Problem 3 is about moving pebbles between neighboring points on a grid until each has 3 or fewer pebbles. Problems 4-6 involve proofs related to partitioning cubes, triangle geometry, and summing fractions of positive real numbers.

    Copyright:

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

    BraMO09 PDF

    Uploaded by

    Faris Rafi Pramana
    36 views1 page
    The document contains 6 math problems from the 31st Brazilian Mathematical Olympiad in 2009. Problem 1 asks about summing the rows and columns of a 2009x2009 table of integers and whether the sums could all be perfect squares. Problem 2 involves finding a multiple of a prime number sum whose digits sum to 3 or less. Problem 3 is about moving pebbles between neighboring points on a grid until each has 3 or fewer pebbles. Problems 4-6 involve proofs related to partitioning cubes, triangle geometry, and summing fractions of positive real numbers.

    Original Description:

    Original Title

    BraMO09.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 6 math problems from the 31st Brazilian Mathematical Olympiad in 2009. Problem 1 asks about summing the rows and columns of a 2009x2009 table of integers and whether the sums could all be perfect squares. Problem 2 involves finding a multiple of a prime number sum whose digits sum to 3 or less. Problem 3 is about moving pebbles between neighboring points on a grid until each has 3 or fewer pebbles. Problems 4-6 involve proofs related to partitioning cubes, triangle geometry, and summing fractions of positive real numbers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    36 views1 page

    BraMO09 PDF

    Uploaded by

    Faris Rafi Pramana
    The document contains 6 math problems from the 31st Brazilian Mathematical Olympiad in 2009. Problem 1 asks about summing the rows and columns of a 2009x2009 table of integers and whether the sums could all be perfect squares. Problem 2 involves finding a multiple of a prime number sum whose digits sum to 3 or less. Problem 3 is about moving pebbles between neighboring points on a grid until each has 3 or fewer pebbles. Problems 4-6 involve proofs related to partitioning cubes, triangle geometry, and summing fractions of positive real numbers.

    Copyright:

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

    31-st Brazilian Mathematical Olympiad 2009

    Third Round
    First Day

    1. Emerald writes 20092 integers in a 2009 ×2009 table, one number in each cell. She sums all the numbers
    in each row and in each column, obtaining 4018 sums. She notices that all sums are distinct. Is it possible
    that all such sums are perfect squares?

    2. Assume that p and q are positive prime numbers such that q = 2p + 1. Prove that there exists a multiple
    of q whose sum of digits in decimal expansion is positive and at most 3.

    3. There are 2009 pebbles in some points (x, y) with both integer coordinates. An operation consists of
    choosing a point (a, b) with four or more pebbles, removing four pebbles from (a, b) and putting one
    pebble in each of the points

    (a, b − 1), (a, b + 1), (a − 1, b), (a + 1, b).

    Show that after a finite number of operations each point will have at most three pebbles. Prove that the
    final configuration doesn’t depend on the order of the operations.

    Second Day

    4. Prove that there exists a positive integer n0 with the following property: for each integer n ≥ n0 it is
    possible to partition a cube into n smaller cubes.

    5. Let ABC be a triangle and ) its circumcenter. The lines AB and AC meet the circumcircle of △OBC again
    at B1 and C1 , respectively. The lines BA and BC meet the circumcircle of △OAC again in A2 and C2 ,
    respectively. The lines CA and CB meet the circumcircle of △OAB in A3 and B3 , respectively. Prove that
    the lines A2 A3 , B1 B3 , and C1C2 have a common point.

    6. Let n > 3 be a fixed integer and x1 , x2 , . . . , xn positive real numbers. Find, in terms of n, all possible
    values of
    x1 x2 x3 xn−1 xn
    + + +···+ + .
    xn + x1 + x2 x1 + x2 + x3 x2 + x3 + x4 xn−2 + xn−1 + xn xn−1 + xn + x1

    The IMO Compendium Group,


    D. Djukić, V. Janković, I. Matić, N. Petrović
    www.imomath.com

    You might also like