Scribd
Upload
550 views

Luke Math Olys

This document contains 6 sections summarizing mock math olympiad problems from 6 different days. Each section contains 3 multi-part math problems testing skills like proofs, number theory, geometry, and combinatorics. The document provides high-level overviews of 18 mock olympiad problems across a variety of mathematical topics to help prepare for competitions.

Uploaded by

Stefy Stefan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
550 views

Luke Math Olys

This document contains 6 sections summarizing mock math olympiad problems from 6 different days. Each section contains 3 multi-part math problems testing skills like proofs, number theory, geometry, and combinatorics. The document provides high-level overviews of 18 mock olympiad problems across a variety of mathematical topics to help prepare for competitions.

Uploaded by

Stefy Stefan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Mock Olympiads

Luke Robitaille, et. al.


December 18, 2020

Contents
1 Mock TSTST Day 1 2

2 Mock TSTST Day 2 3

3 Mock TSTST Day 3 4

4 Mock TSTST Day 4 5

5 Mock TSTST Day 5 6

6 Mock TSTST Day 6 7

1
Math Olympiads

1 Mock TSTST Day 1


1. Let n ≥ 3 be a positive integer. There is a set S of n points in the plane such that the
distances between pairs of points in S are pairwise distinct.
Janabel and Brandon play a game, alternating turns, with Janabel going first. On
Janabel’s first turn, she places a frog on some point of S. Then, on Brandon’s first
turn, he places another frog on some unoccupied point of S. Then, on every turn
thereafter, the player whose turn it is chooses an unoccupied point, chooses one of
the frogs, and moves the chosen frog to the chosen point subject to the following
constraint: the distance between the two frogs after the move is less than what the
distance between the frogs was before the move. If a player, on their turn, has no
legal move, then that player loses and their opponent wins.
Assuming both players play optimally, prove that Janabel wins if and only if n is odd.

2. Let ABCD be a convex quadrilateral such that AD is not parallel to BC. The midpoints
of AD and BC are denoted by M and N , respectively. The line MN intersects the
diagonals AC and BD in points K and L, respectively. Prove that the circumcircle of
AKM, the circumcircle of BN L, and line AB have a common point.

3. Prove that for every positive integer n, there is a sequence of integers a0 , a1 , . . . , a2020
with a0 = 0 and a2020 = n such that each term after a0 is either an earlier term plus
2k for some nonnegative integer k, or of the form b mod c for some earlier positive
terms b and c. [Here b mod c denotes the remainder when b is divided by c, so 0 ≤
(b mod c) < c.]

2
Math Olympiads

2 Mock TSTST Day 2


1. Find the largest real number c such that the following statement is true:
Let n be any integer greater than 1. Each cell of an n × n square grid is either colored
green or left uncolored. Suppose that for every cell S, there exists a green cell T , S
such that S and T share at least one corner. Then there must be at least cn2 green
cells.

2. Find all functions f : R → R such that, for all real numbers x and y,

f (f (x) − x + y 2 ) = yf (y).

3. Let ABC be an acute triangle with circumcenter O and orthocenter H. The line
through O parallel to BC intersects AB at D and intersects AC at E. Let X be the
midpoint of AH. Prove that the circumcircle of BDX, the circumcircle of CEX, and
line AO have a common point.

3
Math Olympiads

3 Mock TSTST Day 3


1. Let ABC be a triangle with AB , AC. Let M and N be the midpoints of AC and
AB, respectively. Suppose that the circumcircles of BCM and BCMN intersect the
circumcircle of AMN again at points P , M and Q , N , respectively. Prove that
AP = AQ.

2. Find all ordered pairs (a, b) of positive integers such that

aa+1 + a − 1 = b6 .

3. Let n be a nonnegative integer, and let Tn be the set of all points (x, y, z) in three-
dimensional space such that x, y, and z are nonnegative integers and x + y + z√= n.
Find all n such that there exists a set S of equilateral triangles of side length 2 in
three-dimensional space such that all vertices of every triangle in S are in Tn , and
every point of Tn is a vertex of exactly one triangle in S.

4
Math Olympiads

4 Mock TSTST Day 4


1. Find all functions f : Z → Z such that, for all integers z, f (f (z)) = z, and, for all
integers x and y such that x + y is odd, f (x) + f (y) ≥ x + y.

2. Let ABC be an acute triangle with AB , AC, and let D be the foot of the perpendicular
from A to side BC. Let K be a point on segment AD such that AD = 3KD. Let O be
the circumcenter of triangle ABC, and let M and N be the midpoints of sides AC
and AB, respectively. Lines KO and MN meet at a point Z, and the line through Z
perpendicular to OK meets lines AB and AC at X and Y , respectively. Prove that
∠XKY = ∠BKC.

3. Let n be a positive integer. Each cell of an n×n square grid either is empty or contains
either an arrow pointing up or an arrow pointing to the right. The arrangement is
said to be polite if no arrow points at another arrow; that is, for any cell containing an
arrow pointing up, all cells above that cell in the same column are empty, and for any
cell containing an arrow pointing to the right, all cells to the right of that cell in the
same row are empty.
Determine, in terms of n, the number of polite arrangements such that no cell on the
main diagonal (that is, the diagonal from the top left corner of the grid to the bottom
right corner of the grid) is empty.

5
Math Olympiads

5 Mock TSTST Day 5


1. Two circles, ω1 and ω2 , centered at O1 and O2 , respectively, meet at points A and
B. A line through B meets ω1 again at C , B and ω2 again at D , B. Assume that
C, D , A. The tangents to ω1 and ω2 at C and D, respectively, meet at E. Let ω be the
circumcircle of triangle AO1 O2 , and let the line AE meet ω again at F , A. Prove that
the length of the segment EF is equal to the diameter of ω.

2. Let a, b, and c be positive real numbers. Prove that

ab bc ca a+b+c
+ + ≤ .
3a + 4b + 5c 3b + 4c + 5a 3c + 4a + 5b 12

3. Let N denote the set of all positive integers. Find all functions f : N → N such that,
for all m, n ∈ N with m , n, we have that m−n divides f (m)−f (n), and, for all x, y ∈ N,
if gcd(x, y) = 1, then gcd(f (x), f (y)) = 1.

6
Math Olympiads

6 Mock TSTST Day 6


1. Let p be a prime number. Show that
p ! !
X p+i p
≡ 2p + 1 (mod p2 ).
i i
i=0

2. Let S be a finite set of integers, each greater than 1. Suppose that, for every positive
integer n, there exists some s ∈ S such that gcd(s, n) = 1 or gcd(s, n) = s. Prove that
there exist (not necessarily distinct) s, t ∈ S such that gcd(s, t) is prime.

3. Let P be the set of all points in the plane. Suppose that f : P → R is a function such
that, for any points A, B, C, D ∈ P such that ABCD is a square with side length 1, we
have that f (A) + f (B) + f (C) + f (D) = 0. Show that f (P ) = 0 for all P ∈ P.

You might also like