olymmath

TSTST 2012

USA TST for the TST 2012.

Other problems

Problem 1

Determine all infinite strings of letters with the following properties: (a) Each letter is either TT or SS, (b) If position ii and jj both have the letter TT, then position i+ji+j has the letter SS, (c) There are infinitely many integers kk such that position 2k−12 k-1 has the kk th TT.

Problem 3

Let N\mathbb{N} be the set of positive integers. Let f:N→Nf: \mathbb{N} \rightarrow \mathbb{N} be a function satisfying the following two conditions: (a) f(m)f(m) and f(n)f(n) are relatively prime whenever mm and nn are relatively prime. (b) n≤f(n)≤n+2012n \leq f(n) \leq n+2012 for all nn. Prove that for any natural number nn and any prime pp, if pp divides f(n)f(n) then pp divides nn.

Problem 4

In scalene triangle ABCA B C, let the feet of the perpendiculars from AA to BC‾,B\overline{B C}, B to CA‾\overline{C A}, CC to AB‾\overline{A B} be A1,B1,C1A_{1}, B_{1}, C_{1}, respectively. Denote by A2A_{2} the intersection of lines BCB C and B1C1B_{1} C_{1}. Define B2B_{2} and C2C_{2} analogously. Let D,E,FD, E, F be the respective midpoints of sides BC‾,CA‾,AB‾\overline{B C}, \overline{C A}, \overline{A B}. Show that the perpendiculars from DD to AA2‾,E\overline{A A_{2}}, E to BB2‾\overline{B B_{2}} and FF to CC2‾\overline{C C_{2}} are concurrent.

Problem 5

A rational number xx is given. Prove that there exists a sequence x0,x1,x2,…x_{0}, x_{1}, x_{2}, \ldots of rational numbers with the following properties: (a) x0=xx_{0}=x; (b) for every n≥1n \geq 1, either xn=2xn−1x_{n}=2 x_{n-1} or xn=2xn−1+1nx_{n}=2 x_{n-1}+\frac{1}{n}; (c) xnx_{n} is an integer for some nn.

Problem 6

Positive real numbers x,y,zx, y, z satisfy xyz+xy+yz+zx=x+y+z+1x y z+x y+y z+z x=x+y+z+1. Prove that 13(1+x21+x+1+y21+y+1+z21+z)≤(x+y+z3)5/8.\frac{1}{3}\left(\sqrt{\frac{1+x^{2}}{1+x}}+\sqrt{\frac{1+y^{2}}{1+y}}+\sqrt{\frac{1+z^{2}}{1+z}}\right) \leq\left(\frac{x+y+z}{3}\right)^{5 / 8} .

Problem 7

Triangle ABCA B C is inscribed in circle Ω\Omega. The interior angle bisector of angle AA intersects side BCB C and Ω\Omega at DD and LL (other than AA ), respectively. Let MM be the midpoint of side BCB C. The circumcircle of triangle ADMA D M intersects sides ABA B and ACA C again at QQ and PP (other than AA ), respectively. Let NN be the midpoint of segment PQP Q, and let HH be the foot of the perpendicular from LL to line NDN D. Prove that line MLM L is tangent to the circumcircle of triangle HMNH M N.

Problem 8

Let nn be a positive integer. Consider a triangular array of nonnegative integers as follows: Call such a triangular array stable if for every 0≤i<j<k≤n0 \leq i<j<k \leq n we have ai,j+aj,k≤ai,k≤ai,j+aj,k+1a_{i, j}+a_{j, k} \leq a_{i, k} \leq a_{i, j}+a_{j, k}+1 For s1,…,sns_{1}, \ldots, s_{n} any nondecreasing sequence of nonnegative integers, prove that there exists a unique stable triangular array such that the sum of all of the entries in row kk is equal to sks_{k}.

Problem 9

Given a set SS of nn variables, a binary operation ×\times on SS is called simple if it satisfies (x×y)×z=x×(y×z)(x \times y) \times z=x \times(y \times z) for all x,y,z∈Sx, y, z \in S and x×y∈{x,y}x \times y \in\{x, y\} for all x,y∈Sx, y \in S. Given a simple operation ×\times on SS, any string of elements in SS can be reduced to a single element, such as xyz→x×(y×z)x y z \rightarrow x \times(y \times z). A string of variables in SS is called full if it contains each variable in SS at least once, and two strings are equivalent if they evaluate to the same variable regardless of which simple ×\times is chosen. For example xxx,xxx x x, x x, and xx are equivalent, but these are only full if n=1n=1. Suppose TT is a set of full strings such that any full string is equivalent to exactly one element of TT. Determine the number of elements of TT.