Scribd
Upload
313 views2 pages

Mock Usajmo Shortlist

The document is a mock shortlist for the USAJMO containing 10 problems across 4 categories: Algebra, Geometry, Combinatorics, and Number Theory. The problems cover a range of mathematical topics including inequalities, functions, polynomials, geometry of circles and triangles, set theory, tiling problems, and number properties. The final problem asks to analyze a recursive numerical sequence defined by its last digit and use the given first term to determine the 2015th term.

Uploaded by

dhrubajyoti ghosh
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
313 views2 pages

Mock Usajmo Shortlist

The document is a mock shortlist for the USAJMO containing 10 problems across 4 categories: Algebra, Geometry, Combinatorics, and Number Theory. The problems cover a range of mathematical topics including inequalities, functions, polynomials, geometry of circles and triangles, set theory, tiling problems, and number properties. The final problem asks to analyze a recursive numerical sequence defined by its last digit and use the given first term to determine the 2015th term.

Uploaded by

dhrubajyoti ghosh
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/ 2

Mock USAJMO 2015 Shortlist

Tan, SMOJ, Chez, Gibby, Naysh

July 15, 2015

1 Algebra

Problem 1. Let x, y, z be positive real numbers. Prove that (x2 + y 2 + z 2 )2 ≥ 3xyz(x + y + z).
Problem 2. Find all functions f : R → R satisfying

f (f (x) + (f (x) + 1)y) = xy + x + f (2y + 1)

for all real numbers x and y.


Problem 3. Find all functions f : R → R satisfying

f (f (x)y + xy) = 2y(f (x) − 1) + f (y)

for all reals x and y.


Problem 4. Does there exist a polynomial f with degree at most 30 that maps integers to
integers, such that at least one of its coefficients is equal to 1/2015?

2 Geometry

Problem 5. Four points A, B, C, D lie on a circle with center O. Points X and Y are chosen
on AB and AD respectively so that CX⊥CD and CY ⊥BC. Prove that points O, X, Y are
collinear.
Problem 6. Let ABC be a triangle, and X, Y be points on the circumcircle of ABC such that
AX = AY . Let B 0 and C 0 be the intersections of XY with AB and AC, respectively. Let P
be an arbitrary point in the plane, and let Q be the second intersection of the circumcircles of
BB 0 P and CC 0 P . Prove that P Q passes through A.

3 Combinatorics

Problem 7. Take any arbitrary set A0 ⊂ N, and recursively define Aj+1 ⊆ N for each j ≥ 0
as the set containing the positive integer k if and only if

|Aj ∩ {1, 2, . . . , k}|

1
is odd. For each positive integer M , prove that there are infinitely many positive integers n so
that all elements of A0 that are less than M are also elements of An .

Problem 8. Define a STONER to be thehape composed of a 2 by 3 block of squares with one of


the two middle squares removed. On a 9 by 9 board of squares, every 5 squares which makes the
shape of a STONER has 2 or 3 black squares and the rest are white. Prove that such a board
exists and show that total number of black squares is between 36 and 45.

4 Number Theory

Problem 9. Does there exist a positive integer m such that there exists positive itnegers n1 , n2
and n3 such that the first 4 digits of mn1 , mn2 , mn3 are 1520, 2015 and 5201?

Problem 10. A sequence of numbers a1 , a2 , . . . has the following property: if the last digit of
10k − 1 an − k
an is k, an+1 = + . Given that a1 = 20155102, show that all numbers in this
9 10
sequence have at least 5 digits and find a2015 .

You might also like