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

Welcome to Scribd!

  • 40 views

    PGTM INMO Mock 1

    Uploaded by

    Mohammed Imran
    The document contains 6 math problems: 1) Prove that the number of squarefree integers in a set that are odd is always odd. 2) Prove a property about incircles and excircles of a triangle inscribed in a circle. 3) Find the smallest number of groups needed to partition a set of numbers summing to n, with each group summing to 1 or less. 4) Determine the average number of "within throwing distance" configurations for distributing stones among boxes. 5) Prove a relationship involving lengths of segments formed by midpoints of a quadrilateral. 6) Prove an inequality relating harmonic and arithmetic means of four positive numbers summing to 4.

    Copyright:

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

    PGTM INMO Mock 1

    Uploaded by

    Mohammed Imran
    40 views1 page
    The document contains 6 math problems: 1) Prove that the number of squarefree integers in a set that are odd is always odd. 2) Prove a property about incircles and excircles of a triangle inscribed in a circle. 3) Find the smallest number of groups needed to partition a set of numbers summing to n, with each group summing to 1 or less. 4) Determine the average number of "within throwing distance" configurations for distributing stones among boxes. 5) Prove a relationship involving lengths of segments formed by midpoints of a quadrilateral. 6) Prove an inequality relating harmonic and arithmetic means of four positive numbers summing to 4.

    Original Description:

    This is a Mock test

    Original Title

    PGTM_INMO_Mock_1

    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: 1) Prove that the number of squarefree integers in a set that are odd is always odd. 2) Prove a property about incircles and excircles of a triangle inscribed in a circle. 3) Find the smallest number of groups needed to partition a set of numbers summing to n, with each group summing to 1 or less. 4) Determine the average number of "within throwing distance" configurations for distributing stones among boxes. 5) Prove a relationship involving lengths of segments formed by midpoints of a quadrilateral. 6) Prove an inequality relating harmonic and arithmetic means of four positive numbers summing to 4.

    Copyright:

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

    PGTM INMO Mock 1

    Uploaded by

    Mohammed Imran
    The document contains 6 math problems: 1) Prove that the number of squarefree integers in a set that are odd is always odd. 2) Prove a property about incircles and excircles of a triangle inscribed in a circle. 3) Find the smallest number of groups needed to partition a set of numbers summing to n, with each group summing to 1 or less. 4) Determine the average number of "within throwing distance" configurations for distributing stones among boxes. 5) Prove a relationship involving lengths of segments formed by midpoints of a quadrilateral. 6) Prove an inequality relating harmonic and arithmetic means of four positive numbers summing to 4.

    Copyright:

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

    3rd November, 2022

    n
    Problem 1. Let n be a positive integer. Suppose there are exactly M squarefree integers k such that k
    is odd in the set {1, 2, . . . , n}. Prove M is odd.
    An integer is squarefree if it is not divisible by any square other than 1.

    Problem 2. Let ABC be a triangle inscribed in circle ω. Common tangent (other than BC) of mixtilinear
    incircles at the vertices B and C meet ω at M and N . Prove that bisector of ∠M AN goes through centroid
    of excentral triangle.

    Problem 3. Let n be a positive integer. Find the smallest integer k with the following property: Given
    any real numbers a1 , a2 , . . . , ad such that a1 + a2 + · · · + ad = n and 0 ≤ ai ≤ 1 for i = 1, 2, . . . , d, it is
    possible to partition these numbers into k groups (some of which may be empty) such that the sum of the
    numbers in each group is at most 1.

    Problem 4. Let n > 1 be an integer. In a row there are n boxes, and we have n + 1 identical stones.
    A distribution is a way to distribute the stones over the boxes, where every stone is in exactly one box.
    We say that two of such distributions are within a stone’s throw if we can get to one distribution from
    the other by moving exactly one stone to another box. The sociability of a distribution a is defined as
    the number of distributions that are within a stone’s throw of a. Determine the arithmetic mean over all
    possible distributions. (Two distributions are the same if there are an equal amount of stones in the ith
    box of both rows, for all i ∈ {1, 2, . . . , n}.)

    Problem 5. Consider the Quadrilateral ABCD. Suppose CA = BD = BC. Let M, N be the midpoints
    of AB, CD, respectively. If M N meets BD, AC at T, R respectively then prove that BT + CR = BC.

    Problem 6. Let a, b, c, d be positive real numbers with a + b + c + d = 4. Prove that


    1 1 1 1
    2
    + 2 + 2 + 2 ≥ a2 + b2 + c2 + d2
    a b c d

    Language: English Each problem is worth 17 points

    4 hours only

    You might also like