Define a list of number with the following properties: - The first number of the list is a one-digit natural number. - Each number (since the second) is obtained by adding $9$ to the number before in the list. - The number $2012$ is in that list. Find the first number of the list.

For every positive integer $n$, determine the greatest possible value of the quotient $$\frac{1-x^{n}-(1-x)^{n}}{x(1-x)^n+(1-x)x^n}$$ where $0 < x < 1$.

Given two internally tangent circles; in the bigger one we inscribe an equilateral triangle. From each of the vertices of this triangle, we draw a tangent to the smaller circle. Prove that the length of one of these tangents equals the sum of the lengths of the two other tangents.

[i](5 pts)[/i] For some positive integer $n$, let $P(x)$ be an $n$th degree polynomial with real coefficients. [i]Note: you may cite, without proof, the Fundamental Theorem of Algebra, which states that every non-constant polynomial with complex coefficients has a complex root.[/i] (a) [i](2 pts)[/i] Show that there is an integer $k \ge \frac{n}{2}$ and a sequence of non-constant polynomials with real coefficients $Q_1(x), Q_2(x), \dots, Q_k(x)$ such that \[ P(x) = \prod_{i = 1}^k Q_i(x). \] (b) [i](1 pt)[/i] If $n$ is odd, then show that $P(x)$ has a real root. (c) [i](2 pts)[/i] Let $a$ and $b$ be real numbers, and let $m$ be a positive integer. If $\zeta = a + bi$ is a nonreal root of $P(x)$ of multiplicity $m$, then show that $\overline{\zeta} = a - bi$ is a nonreal root of $P(x)$ of multiplicity $m$.

Let $ \lfloor x \rfloor$ be the greatest integer less than or equal to $ x$. Then the number of real solutions to $ 4x^2 \minus{} 40 \lfloor x \rfloor \plus{} 51 \equal{} 0$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Consider the set $S=\{1,2,...,n\}$. For every $k\in S$, define $S_{k}=\{X \subseteq S, \ k \notin X, X\neq \emptyset\}$. Determine the value of the sum \[S_{k}^{*}=\sum_{\{i_{1},i_{2},...,i_{r}\}\in S_{k}}\frac{1}{i_{1}\cdot i_{2}\cdot...\cdot i_{r}}\] [hide]in fact, this problem was taken from an austrian-polish[/hide]

$100$ points are marked in the plane so that no three of marked points are collinear. One of marked points is red, and the others are blue. A triangle with vertices at blue points is called [i]good[/i] if the red point lies inside it. Determine if it is possible that the number of good triangles is not less than the half of the total number of traingles with vertices at blue points.

Find all real roots $x$ of the equation $$\sqrt{x^2-2x-1}+\sqrt{x^2+2x-1}=p,$$ where $p$ is a real parameter.

An irreducible polynomial is a not-constant polynomial that cannot be factored into product of two non-constant polynomials. Consider the following statements :- [b]Statement 1 :[/b] $p(x)$ be any monic irreducible polynomial with integer coefficients and degree $\geq 4$. Then $p(n)$ is a prime for at least one natural number $n$ [b]Statement 2 :[/b] $n^2+1$ is prime for infinitely many values of natural number $n$ Show that if [b]Statement 1[/b] is true then [b]Statement 2[/b] is also true

Zou and Chou are practicing their 100-meter sprints by running $6$ races against each other. Zou wins the first race, and after that, the probability that one of them wins a race is $\frac23$ if they won the previous race but only $\frac13$ if they lost the previous race. The probability that Zou will win exactly $5$ of the $6$ races is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Compute the number of two-digit numbers $\overline{ab}$ with nonzero digits $a$ and $b$ such that $a$ and $b$ are both factors of $\overline{ab}$. [i]Proposed by Nathan Xiong[/i]

Let $p > 10^9$ be a prime number such that $4p + 1$ is also prime. Prove that the decimal expansion of $\frac{1}{4p+1}$ contains all the digits $0,1, \ldots, 9$.

Let $n$ be a positive integer. Prove that if the number overbrace $\underbrace{\hbox{99...9}}_{\hbox{n}}$ is divisible by $n$, then the number $\underbrace{\hbox{11...1}}_{\hbox{n}}$ is also divisible by $n$. (H. Nestra)

Let $\tau(n)$ denote the number of positive integer divisors of a positive integer $n$ (for example, $\tau(2022) = 8$). Given a polynomial $P(X)$ with integer coefficients, we define a sequence $a_1, a_2,\ldots$ of nonnegative integers by setting \[a_n =\begin{cases}\gcd(P(n), \tau (P(n)))&\text{if }P(n) > 0\\0 &\text{if }P(n) \leq0\end{cases}\] for each positive integer $n$. We then say the sequence [i]has limit infinity[/i] if every integer occurs in this sequence only finitely many times (possibly not at all). Does there exist a choice of $P(X)$ for which the sequence $a_1$, $a_2$, . . . has limit infinity? [i]Jovan Vuković[/i]

Let $n\ge 2$ be positive integer. Find the least possible number of elements of tile set $A =\{1,2,...,2n-1,2n\}$ that should be deleted in order to the sum of any two different elements remained be a composite number.

There are more than $n^2$ stones on the table. Peter and Vasya play a game, Peter starts. Each turn, a player can take any prime number less than $n$ stones, or any multiple of $n$ stones, or $1$ stone. Prove that Peter always can take the last stone (regardless of Vasya's strategy). [i]S Berlov[/i]