Scribd Logo
Upload

Welcome to Scribd!

  • 124 views

    2019 TSTST: Contributors: Markbcc168, Pinetree1, Tastymath75025

    Uploaded by

    Soumya Dasgupta
    1. The document describes the proceedings over 3 days of the TSTST 2019 mathematics competition. Problems were posed in binary operations, geometry, tiling problems, coin denominations, additional geometry problems, properties of polynomials, number theory, geometric constructions, and minimal line arrangements. 2. On day 1 problems involved binary operations on positive real numbers, properties of circles related to a triangle, and proving the existence of an infinite sequence of moves in a tiling problem. 3. Problems on day 2 centered around splitting coins of total value into equal stacks with low difference, properties relating angles and circles in a triangle, and properties of polynomials. 4. On the final day, questions pertained to a

    Copyright:

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

    2019 TSTST: Contributors: Markbcc168, Pinetree1, Tastymath75025

    Uploaded by

    Soumya Dasgupta
    124 views2 pages
    1. The document describes the proceedings over 3 days of the TSTST 2019 mathematics competition. Problems were posed in binary operations, geometry, tiling problems, coin denominations, additional geometry problems, properties of polynomials, number theory, geometric constructions, and minimal line arrangements. 2. On day 1 problems involved binary operations on positive real numbers, properties of circles related to a triangle, and proving the existence of an infinite sequence of moves in a tiling problem. 3. Problems on day 2 centered around splitting coins of total value into equal stacks with low difference, properties relating angles and circles in a triangle, and properties of polynomials. 4. On the final day, questions pertained to a

    Original Description:

    TST PROBLEMW

    Original Title

    898138

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document describes the proceedings over 3 days of the TSTST 2019 mathematics competition. Problems were posed in binary operations, geometry, tiling problems, coin denominations, additional geometry problems, properties of polynomials, number theory, geometric constructions, and minimal line arrangements. 2. On day 1 problems involved binary operations on positive real numbers, properties of circles related to a triangle, and proving the existence of an infinite sequence of moves in a tiling problem. 3. Problems on day 2 centered around splitting coins of total value into equal stacks with low difference, properties relating angles and circles in a triangle, and properties of polynomials. 4. On the final day, questions pertained to a

    Copyright:

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

    2019 TSTST: Contributors: Markbcc168, Pinetree1, Tastymath75025

    Uploaded by

    Soumya Dasgupta
    1. The document describes the proceedings over 3 days of the TSTST 2019 mathematics competition. Problems were posed in binary operations, geometry, tiling problems, coin denominations, additional geometry problems, properties of polynomials, number theory, geometric constructions, and minimal line arrangements. 2. On day 1 problems involved binary operations on positive real numbers, properties of circles related to a triangle, and proving the existence of an infinite sequence of moves in a tiling problem. 3. Problems on day 2 centered around splitting coins of total value into equal stacks with low difference, properties relating angles and circles in a triangle, and properties of polynomials. 4. On the final day, questions pertained to a

    Copyright:

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

    2019 TSTST

    TSTST 2019

    – Day 1

    1 Find all binary operations ♦ : R>0 × R>0 → R>0 (meaning ♦ takes pairs of
    positive real numbers to positive real numbers) such that for any real numbers
    a, b, c > 0,
    - the equation a ♦ (b ♦ c) = (a ♦ b) · c holds; and
    - if a ≥ 1 then a ♦ a ≥ 1.
    Evan Chen

    2 Let ABC be an acute triangle with circumcircle Ω and orthocenter H. Points D


    and E lie on segments AB and AC respectively, such that AD = AE. The lines
    through B and C parallel to DE intersect Ω again at P and Q, respectively.
    Denote by ω the circumcircle of △ADE.
    - Show that lines P E and QD meet on ω.
    - Prove that if ω passes through H, then lines P D and QE meet on ω as well.
    Merlijn Staps

    3 On an infinite square grid we place finitely many cars, which each occupy a
    single cell and face in one of the four cardinal directions. Cars may never
    occupy the same cell. It is given that the cell immediately in front of each car
    is empty, and moreover no two cars face towards each other (no right-facing car
    is to the left of a left-facing car within a row, etc.). In a move, one chooses a
    car and shifts it one cell forward to a vacant cell. Prove that there exists an
    infinite sequence of valid moves using each car infinitely many times.
    Nikolai Beluhov

    – Day 2

    4 Consider coins with positive real denominations not exceeding 1. Find the
    smallest C > 0 such that the following holds: if we are any 100 such coins with
    total value 50, then we can always split them into two stacks of 50 coins each
    such that the absolute difference between the total values of the two stacks is
    at most C.
    Merlijn Staps

    www.artofproblemsolving.com/community/c898138
    Contributors: MarkBcc168, pinetree1, tastymath75025
    2019 TSTST

    5 Let ABC be an acute triangle with orthocenter H and circumcircle Γ. A line


    through H intersects segments AB and AC at E and F , respectively. Let K be
    the circumcenter of △AEF , and suppose line AK intersects Γ again at a point
    D. Prove that line HK and the line through D perpendicular to BC meet on
    Γ.
    Gunmay Handa

    6 Suppose P is a polynomial with integer coefficients such that for every positive
    integer n, the sum of the decimal digits of |P (n)| is not a Fibonacci number.
    Must P be constant?
    (A Fibonacci number is an element of the sequence F0 , F1 , . . . defined recursively
    by F0 = 0, F1 = 1, and Fk+2 = Fk+1 + Fk for k ≥ 0.)
    Nikolai Beluhov

    – Day 3

    7 Let f : Z → {1, 2, . . . , 10100 } be a function satisfying

    gcd(f (x), f (y)) = gcd(f (x), x − y)

    for all integers x and y. Show that there exist positive integers m and n such
    that f (x) = gcd(m + x, n) for all integers x.
    Ankan Bhattacharya

    8 Let S be a set of 16 points in the plane, no three collinear. Let χ(S) denote the
    number of ways to draw 8 lines with endpoints in S, such that no two drawn
    segments intersect, even at endpoints. Find the smallest possible value of χ(S)
    across all such S.
    Ankan Bhattacharya

    9 Let ABC be a triangle with incenter I. Points K and L are chosen on segment
    BC such that the incircles of △ABK and △ABL are tangent at P , and the
    incircles of △ACK and △ACL are tangent at Q. Prove that IP = IQ.
    Ankan Bhattacharya

    www.artofproblemsolving.com/community/c898138
    Contributors: MarkBcc168, pinetree1, tastymath75025

    You might also like