Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • INMO Mock 2

    Uploaded by

    Bhavin Desai
    47 views1 page
    The document contains 6 problems: 1) Showing that if there is exactly one 1 in a circular arrangement of positive integers dividing the sum of its neighbors, then for any positive integer n, there are at most φ(n) copies of n. 2) Proving a relationship between the orthocenter and circumcenter of two triangle configurations. 3) Proving an inequality relating reciprocals of least common multiples of increasing positive integers. 4) Determining if there exists a function such that applying it twice adds a constant. 5) Finding the winning strategy in a game where players alternately remove stones from a pile until one stone remains. 6) Finding all composite

    Original Description:

    Original Title

    INMO_Mock_2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains 6 problems: 1) Showing that if there is exactly one 1 in a circular arrangement of positive integers dividing the sum of its neighbors, then for any positive integer n, there are at most φ(n) copies of n. 2) Proving a relationship between the orthocenter and circumcenter of two triangle configurations. 3) Proving an inequality relating reciprocals of least common multiples of increasing positive integers. 4) Determining if there exists a function such that applying it twice adds a constant. 5) Finding the winning strategy in a game where players alternately remove stones from a pile until one stone remains. 6) Finding all composite

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    47 views1 page

    INMO Mock 2

    Uploaded by

    Bhavin Desai
    The document contains 6 problems: 1) Showing that if there is exactly one 1 in a circular arrangement of positive integers dividing the sum of its neighbors, then for any positive integer n, there are at most φ(n) copies of n. 2) Proving a relationship between the orthocenter and circumcenter of two triangle configurations. 3) Proving an inequality relating reciprocals of least common multiples of increasing positive integers. 4) Determining if there exists a function such that applying it twice adds a constant. 5) Finding the winning strategy in a game where players alternately remove stones from a pile until one stone remains. 6) Finding all composite

    Copyright:

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

    INMO Mock 2

    Sophie Fellowship
    November 13, 2022

    1. There are m ⩾ 3 positive integers, not necessarily distinct, that are arranged in a
    circle so that any positive integer divides the sum of its neighbors. Show that if there
    is exactly one 1, then for any positive integer n, there are at most ϕ(n) copies of n.

    2. Let O and H be the circumcenter and orthocenter of ABC. Given points D, E on seg-
    ments AB, AC and H ′ , O′ the orthocenter and circumcenter of ADE. Prove that

    HH ′ ∥ OO′ ⇐⇒ BD = CE

    3. For positive integers a1 < a2 < · · · < an , prove that

    1 1 1 1
    + + ··· + ⩽ 1 − n−1
    lcm(a1 , a2 ) lcm(a2 , a3 ) lcm(an−1 , an ) 2

    4. Given a positive integer k, is there a function f : N → N, such that

    f (x) + f (f (x)) = x + k

    for all x ∈ N?

    5. A game begins with a pile of n stones. Alice and Bob take turns removing either 1
    stone or one half (rounded down) of the stones from the pile, with Alice taking the
    first turn. The player who leaves exactly one stone at the end of their turn wins the
    game. Who has the winning strategy?

    6. Find all composite numbers n such that for every pair of positive integers x, y with
    product n, we have that x + y is a power of two.

    You might also like