Determine all infinite strings of letters with the following properties: (a) Each letter is either or , (b) If position and both have the letter , then position has the letter , (c) There are infinitely many integers such that position has the th .
TSTST 2012
USA TST for the TST 2012.
Other problems
Let be the set of positive integers. Let be a function satisfying the following two conditions: (a) and are relatively prime whenever and are relatively prime. (b) for all . Prove that for any natural number and any prime , if divides then divides .
In scalene triangle , let the feet of the perpendiculars from to to , to be , respectively. Denote by the intersection of lines and . Define and analogously. Let be the respective midpoints of sides . Show that the perpendiculars from to to and to are concurrent.
A rational number is given. Prove that there exists a sequence of rational numbers with the following properties: (a) ; (b) for every , either or ; (c) is an integer for some .
Positive real numbers satisfy . Prove that
Triangle is inscribed in circle . The interior angle bisector of angle intersects side and at and (other than ), respectively. Let be the midpoint of side . The circumcircle of triangle intersects sides and again at and (other than ), respectively. Let be the midpoint of segment , and let be the foot of the perpendicular from to line . Prove that line is tangent to the circumcircle of triangle .
Let be a positive integer. Consider a triangular array of nonnegative integers as follows:
Call such a triangular array stable if for every we have For 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 is equal to .
Given a set of variables, a binary operation on is called simple if it satisfies for all and for all . Given a simple operation on , any string of elements in can be reduced to a single element, such as . A string of variables in is called full if it contains each variable in at least once, and two strings are equivalent if they evaluate to the same variable regardless of which simple is chosen. For example , and are equivalent, but these are only full if . Suppose is a set of full strings such that any full string is equivalent to exactly one element of . Determine the number of elements of .