Let be a positive integer. Megavan and Minivan are playing a game, where Megavan secretly chooses a real number in . At the start of the game, the only information Minivan has about is in . He needs to now learn about based on the following protocols: at each turn of his, Minivan chooses a number and submits to Megavan, where Megavan replies immediately with one of ,, or , subject to two rules:
The answers in the form of and must be truthful;
Define the score of a round, known only to Megavan, as follows: if the answer is in the form and , and if in the form . Then for every positive integer and every consecutive rounds, at least one round has score no more than .
Minivan's goal is to produce numbers such that and . Let be the minimum number of queries that Minivan needs in order to guarantee success, regardless of Megavan's strategy. Prove that Proposed by Anzo Teh Zhao Yang
Find the number of permutations of the set with the set such that each element in the permutations has at most one immediate neighbor greater than itself.
Let be a trapezoid with . A point is chosen inside the trapezoid, and a point is chosen inside the triangle such that ,. Prove that triangles and have equal areas.
Prove that there exist infinitely many positive integers m such that the equation (xz+1)(yz+1) = mz^3 + 1 has infinitely many positive integer solutions.
A positive real number sequence and a positive integer is given.
Let and for each Then for every integer the condition is satisfied. Prove that this sequence must be eventually constant.
Let be a triangle with circumcircle and circumcenter . Let and represent the -excircle and -excenter, respectively. Denote by the circle tangent to ,, and on the arc not containing , and similarly for . Let the tangency points of with line be , respectively. Let be the intersection point of and . Define as the point on segment such that . Suppose that intersects again at . Let be the touch point of the -mixtilinear incircle and , and let be the antipode of with respect to . Let be the intersection of and .
Find the smallest positive integer n such that n is a multiple of 11, n +1 is a multiple of 10, n + 2 is a
multiple of 9, n + 3 is a multiple of 8, n +4 is a multiple of 7, n +5 is a multiple of 6, n +6 is a multiple of
5, n + 7 is a multiple of 4, n + 8 is a multiple of 3, and n + 9 is a multiple of 2.
I tried doing the mods and simplifying it but I'm kinda confused.
(1) Let , and be points on circle divided into three equal parts. Construct three equal circles ,, and tangent to internally at points ,, and respectively. Let be any point on arc , and draw tangents ,, and to circles ,, and respectively. Prove that .
(2) Let ,,, be points on circle divided into equal parts. Construct equal circles ,,, tangent to internally at ,,,. Let be any point on circle , and draw tangents ,,, to circles ,,,. If the sum of of ,,, equals the sum of the remaining (where ), find all such .