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

Welcome to Scribd!

  • Ioqm

    Uploaded by

    Sanjeev Kumar Das
    58 views2 pages
    This document contains 16 math problems divided into three sections based on difficulty: 1) 4 one-marker problems involving paths on a Cartesian plane, evaluating expressions with distinct digits, finding prime numbers, and measuring angles. 2) 4 two-marker problems involving finding positive integers satisfying an equation, evaluating trigonometric expressions, ratios of areas of similar triangles, and placing rooks on a chessboard. 3) 4 five-marker problems involving evaluating polynomials, finding products with ratios of areas, finding disjoint pairs of sums from a set, and simplifying a radical expression involving a factorial.

    Original Description:

    Original Title

    1. IOQM (4)

    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
    This document contains 16 math problems divided into three sections based on difficulty: 1) 4 one-marker problems involving paths on a Cartesian plane, evaluating expressions with distinct digits, finding prime numbers, and measuring angles. 2) 4 two-marker problems involving finding positive integers satisfying an equation, evaluating trigonometric expressions, ratios of areas of similar triangles, and placing rooks on a chessboard. 3) 4 five-marker problems involving evaluating polynomials, finding products with ratios of areas, finding disjoint pairs of sums from a set, and simplifying a radical expression involving a factorial.

    Copyright:

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

    Ioqm

    Uploaded by

    Sanjeev Kumar Das
    This document contains 16 math problems divided into three sections based on difficulty: 1) 4 one-marker problems involving paths on a Cartesian plane, evaluating expressions with distinct digits, finding prime numbers, and measuring angles. 2) 4 two-marker problems involving finding positive integers satisfying an equation, evaluating trigonometric expressions, ratios of areas of similar triangles, and placing rooks on a chessboard. 3) 4 five-marker problems involving evaluating polynomials, finding products with ratios of areas, finding disjoint pairs of sums from a set, and simplifying a radical expression involving a factorial.

    Copyright:

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

    Problem Stash

    piyush kumar jha


    May 30, 2023

    §1 2 markers
    Problem 1.1. Euler is walking around the Cartesian plane. From any point (x, y), Euler
    can move to (x + 1, y) or (x + 1, y + 3). How many paths can Euler take from (0, 0) to
    (9, 9)?
    E L
    Problem 1.2. If distinct digits D, E, L, M, Q (between 0 and 9 inclusive) satisfy + M E M
    QED
    If the maximum possible value of the three digit integer QED is Ω, find sum of digits
    of Ω.
    Problem 1.3. What is the smallest prime number p such that 1 + p + p2 + . . . + pp−1 is
    not prime
    Problem 1.4. Points P and Q are chosen on diagonal AC of square ABCD such that
    AB = AP = CQ = 1. What is the measure of ∠P BQ in degrees?

    §2 3 markers
    Problem 2.1. What is the smallest positive integer n such that there exists a choice of
    signs for which 12 ± 22 ± 32 . . . ± n2 = 0 is true?
    Problem 2.2. If an angle 0◦ < θ < 30◦ satisfies sin (90◦ − θ) sin (60◦ − θ) sin (30◦ − θ) =
    sin3 (θ), compute 57 sin (θ).
    Problem 2.3. Let ABC be a triangle with area K. Points A∗ , B ∗ , and C ∗ are chosen
    on AB, BC, and CA respectively such that △A∗ B ∗ C ∗ has area J. Suppose that
    AA∗ BB ∗ CC ∗ J
    = = = =x
    AB BC CA K
    for some 0 < x < 1. What is 9x?
    Problem 2.4. Two rooks on a chessboard are said to be attacking each other if they
    are placed in the same row or column of the board. Number of ways can eight mutually
    non-attacking rooks be placed on the 9 × 9 chessboard so that all eight rooks are on
    squares of the same color is of the form k! , find k.

    1
    piyush kumar jha — May 30, 2023 Problem Stash

    §3 5 markers
    Problem 3.1. polynomial P (x) with real coefficient satisfies (x3 +3x2 +3x+2)P (x−1) =
    (x3 − 3x2 + 3x − 2)P (x) such that , P (3) = 1560, compute ⌊ P1000
    (5)
    ⌋
    Problem 3.2. Find product of all possible values of k if P, Q, R, and S are points on
    the sides of quadrilateral ABCD so that
    AP BQ CR DS
    = = = = k,
    PB QC RD SA

    and the area of the quadrilateral P QRS is exactly 52% of the area of the quadrilateral
    ABCD.
    Problem 3.3. What are the maximum number of disjoint pairs of elements of the set
    {1, 2, . . . , 20} such that the sums of the different pairs are different integers not exceeding
    20?
    √
    Problem 3.4. Gauss is solving a math problem,√ and he encounters the expression 15!.
    He attempts to simplify this radical as a b where a and b are positive integers. The sum
    of all possible values of ab can be expressed in the form q · 15! for some rational number
    q. Find q.

    You might also like