olymmath

TSTST 2018

USA TST for the TST 2018.

Other problems

Problem 1

As usual, let Z[x]\mathbb{Z}[x] denote the set of single-variable polynomials in xx with integer coefficients. Find all functions θ:Z[x]→Z\theta: \mathbb{Z}[x] \rightarrow \mathbb{Z} such that for any polynomials p,q∈p, q \in Z[x]\mathbb{Z}[x], - θ(p+1)=θ(p)+1\theta(p+1)=\theta(p)+1, and - if θ(p)≠0\theta(p) \neq 0 then θ(p)\theta(p) divides θ(p⋅q)\theta(p \cdot q).

Problem 2

In the nation of Onewaynia, certain pairs of cities are connected by one-way roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges), and each pair of cities has at most one road between them. Moreover, every city has exactly two roads leaving it and exactly two roads entering it. We wish to close half the roads of Onewaynia in such a way that every city has exactly one road leaving it and exactly one road entering it. Show that the number of ways to do so is a power of 2 greater than 1 (i.e. of the form 2n2^{n} for some integer n≥1n \geq 1 ).

Problem 3

Let ABCA B C be an acute triangle with incenter II, circumcenter OO, and circumcircle Γ\Gamma. Let MM be the midpoint of AB‾\overline{A B}. Ray AIA I meets BC‾\overline{B C} at DD. Denote by ω\omega and γ\gamma the circumcircles of △BIC\triangle B I C and △BAD\triangle B A D, respectively. Line MOM O meets ω\omega at XX and YY, while line COC O meets ω\omega at CC and QQ. Assume that QQ lies inside △ABC\triangle A B C and ∠AQM=∠ACB\angle A Q M=\angle A C B. Consider the tangents to ω\omega at XX and YY and the tangents to γ\gamma at AA and DD. Given that ∠BAC≠60∘\angle B A C \neq 60^{\circ}, prove that these four lines are concurrent on Γ\Gamma.

Problem 4

For an integer n>0n>0, denote by F(n)\mathcal{F}(n) the set of integers m>0m>0 for which the polynomial p(x)=x2+mx+np(x)=x^{2}+m x+n has an integer root. (a) Let SS denote the set of integers n>0n>0 for which F(n)\mathcal{F}(n) contains two consecutive integers. Show that SS is infinite but ∑n∈S1n≤1\sum_{n \in S} \frac{1}{n} \leq 1 (b) Prove that there are infinitely many positive integers nn such that F(n)\mathcal{F}(n) contains three consecutive integers.

Problem 5

Let ABCA B C be an acute triangle with circumcircle ω\omega, and let HH be the foot of the altitude from AA to BC‾\overline{B C}. Let PP and QQ be the points on ω\omega with PA=PHP A=P H and QA=QHQ A=Q H. The tangent to ω\omega at PP intersects lines ACA C and ABA B at E1E_{1} and F1F_{1} respectively; the tangent to ω\omega at QQ intersects lines ACA C and ABA B at E2E_{2} and F2F_{2} respectively. Show that the circumcircles of △AE1F1\triangle A E_{1} F_{1} and △AE2F2\triangle A E_{2} F_{2} are congruent, and the line through their centers is parallel to the tangent to ω\omega at AA.

Problem 6

Let S={1,…,100}S=\{1, \ldots, 100\}, and for every positive integer nn define Tn={(a1,…,an)∈Sn∣a1+⋯+an≡0( mod 100)}T_{n}=\left\{\left(a_{1}, \ldots, a_{n}\right) \in S^{n} \mid a_{1}+\cdots+a_{n} \equiv 0 (\bmod 100)\right\} Determine which nn have the following property: if we color any 75 elements of SS red, then at least half of the nn-tuples in TnT_{n} have an even number of coordinates with red elements.

Problem 7

Let nn be a positive integer. A frog starts on the number line at 0 . Suppose it makes a finite sequence of hops, subject to two conditions: - The frog visits only points in {1,2,…,2n−1}\left\{1,2, \ldots, 2^{n}-1\right\}, each at most once. - The length of each hop is in {20,21,22,…}\left\{2^{0}, 2^{1}, 2^{2}, \ldots\right\}. (The hops may be either direction, left or right.) Let SS be the sum of the (positive) lengths of all hops in the sequence. What is the maximum possible value of SS ?

Problem 8

For which positive integers b>2b>2 do there exist infinitely many positive integers nn such that n2n^{2} divides bn+1b^{n}+1 ?

Problem 9

Show that there is an absolute constant c<1c<1 with the following property: whenever P\mathcal{P} is a polygon with area 1 in the plane, one can translate it by a distance of 1100\frac{1}{100} in some direction to obtain a polygon Q\mathcal{Q}, for which the intersection of the interiors of P\mathcal{P} and Q\mathcal{Q} has total area at most cc.