Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    GLCGM Sample Problems

    Uploaded by

    Priyanshu Bhagat

    Copyright:

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

    GLCGM Sample Problems

    Uploaded by

    Priyanshu Bhagat
    5 views6 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    GLCGM Sample Problems

    Uploaded by

    Priyanshu Bhagat

    Copyright:

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

    GlobalLevelCompetitionof

    GeneralMathematics
    Sample Problems
    1 Instructions for Candidates

    Series: GLCGMS/1 | Set: 01 | Code: 101/1/1

    1. This is a collection of problems intended to give an idea of the level of problems in


    GLCGM Round 1.
    2. This question paper has 12 questions in total i.e. three questions each from Algebra,
    Combinatorics, Geometry and Number Theory.
    3. Questions are arranged in increasing order of their marks i.e. for each section, the
    first question is worth 2 marks, the second question is worth 3 marks and the third
    question is 5 marks.
    4. Each question has an integer answer ranging from 00 to 99 (both inclusive).
    5. Each section is worth 10 marks for a total of 40 marks.

    6. The difficulty may not be the same for questions worth the same marks.
    7. No calculators or computational aids are allowed.
    8. The answers will be released soon on GLCGM OFFICIAL.
    9. If you haven’t registered yet, you can register here.

    1
    2 GLCGM Sample Problems
    2.1 Algebra
    Problem 1 (A1).

    Find the largest positive integer n for which there is a unique integer m such that
    9 n 11
    < < .
    17 n+m 20

    Problem 2 (A2).

    There are three pairs of real numbers (x1 , y1 ), (x2 , y2 ) and (x3 , y3 ) satisfying the
    equations x3 − 3xy 2 = 70 and y 3 − 3x2 y = 69. If
       
    x1 x2 x3 m
    1+ 1+ 1+ =−
    y1 y2 y3 n

    where m and n are coprime. Find m − 3n.

    Problem 3 (A3).

    Let x, y and z be positive reals with 1 < x < y < z such that

    logx y + logy z + logz x = 8

    25
    logy x + logz y + logx z =
    2
    √
    m+ n
    Then, logy z = where m, n and k are positive integers, and n is not divisible
    k
    by the square of any prime. Find m + n + 2k.

    2
    2.2 Combinatorics

    2.2 Combinatorics
    Problem 4 (C1).

    In Pascal’s Triangle, each entry is the sum of the two entries above it. In which row of
    Pascal’s Triangle do three consecutive entries occur that are in the ratio 3 : 4 : 5?

    Problem 5 (C2).

    In how many ways can 4 identical objects be put into 6 distinguishable boxes such that
    no box contains more than one object?

    Problem 6 (C3).

    Positive integers are written on all faces of a cube, one on each. At each corner (vertex)
    of the cube, the product of the numbers on the faces that meet at corner is written.
    The sum of the numbers written at all the corners is 2004. If T denotes the sum of the
    numbers on all the faces, find the number of possible values of T .

    3
    2 GLCGM Sample Problems

    2.3 Geometry
    Problem 7 (G1).

    Triangle ABC is right angled at B. Square S1 with area 169 is inscribed in it such
    that two of its adjacent edges lie on the sides AB and BC. Square S2 with area 168 is
    inscribed in the triangle
    √ such that one of its edge lies on the hypotenuse CA. If the
    length of CA is m n where n is not divisible by square of any prime, find m + n.

    Problem 8 (G2).

    Two medians of a triangle have length 21 and 35. If the maximum possible area of the
    triangle is expressed in the form 7b · k where k is not divisible by 7, find 7k + b.

    Problem 9 (G3).

    Points D, E and F lie on the sides BC, CA and AB respectively of a triangle △ABC
    AP BP CP
    such that AD, BE and CF concur at P . Find + + .
    AD BE CF

    4
    2.4 Number Theory

    2.4 Number Theory


    Problem 10 (N1).

    There are n pairs of primes (p, q) such that p − q = (p + q)3 . If S is the sum of all
    possible values of pq, find 2n + 3S. If there are no such pairs, enter the answer as 99.

    Problem 11 (N2).

    If n is a two digit number such that the last two digits of 20222020 and 2002n are
    identical, find the largest possible value of n.

    Problem 12 (N3).

    √
    Let f (x) = x2 − 102x + 2018 and say n1 , n2 , · · · are the integers for which f (ni ) is
    also an integer. If the smallest two values of f (ni ) are r and s and |r − s| = 3a 5b · m,
    find (a+b)!
    m! .

    You might also like