Let $a, b, c$ be positive numbers such that $abc \le 8$. Prove that $$\frac{1}{a^2 - a + 1} +\frac{1}{b^2 - b + 1}++\frac{1}{c^2 - c + 1} \ge 1$$

For any sequence of real numbers $A=(a_1,a_2,a_3,\ldots)$, define $\Delta A$ to be the sequence $(a_2-a_1,a_3-a_2,a_4-a_3,\ldots)$, whose $n^\text{th}$ term is $a_{n+1}-a_n$. Suppose that all of the terms of the sequence $\Delta(\Delta A)$ are $1$, and that $a_{19}=a_{92}=0$. Find $a_1$.

Let $n$ be a positive integer, and $a_j$, for $j=1,2,\ldots,n$ are complex numbers. Suppose $I$ is an arbitrary nonempty subset of $\{1,2,\ldots,n\}$, the inequality $\left|-1+ \prod_{j\in I} (1+a_j) \right| \leq \frac 12$ always holds. Prove that $\sum_{j=1}^n |a_j| \leq 3$.

Find all polynomials with real coefficients, for which the equality \[ P(2P(x)) \equal{} 2P(P(x)) \plus{} 2(P(x))^{2}\] holds for any real number $ x$.

For real numbers $x$, $y$ and $z$, solve the system of equations: $$x^3+y^3=3y+3z+4$$ $$y^3+z^3=3z+3x+4$$ $$x^3+z^3=3x+3y+4$$

Find the number of different numbers of the form $\left\lfloor\frac{i^2}{2015} \right\rfloor$, with $i = 1,2, ..., 2015$.

Find all functions $f: \mathbb R \to \mathbb R$ such that \[ f( xf(x) + f(y) ) = f^2(x) + y \] for all $x,y\in \mathbb R$.

An $n$ by $n$ grid, where every square contains a number, is called an $n$-code if the numbers in every row and column form an arithmetic progression. If it is sufficient to know the numbers in certain squares of an $n$-code to obtain the numbers in the entire grid, call these squares a key. [b]a.) [/b]Find the smallest $s \in \mathbb{N}$ such that any $s$ squares in an $n-$code $(n \geq 4)$ form a key. [b]b.)[/b] Find the smallest $t \in \mathbb{N}$ such that any $t$ squares along the diagonals of an $n$-code $(n \geq 4)$ form a key.

For every natural number $ x$, let $ Q(x)$ be the sum and $ P(x)$ the product of the (decimal) digits of $ x$. Show that for each $ n \in \mathbb{N}$ there exist infinitely many values of $ x$ such that: $ Q(Q(x))\plus{}P(Q(x))\plus{}Q(P(x))\plus{}P(P(x))\equal{}n$.

The sum of the roots of the equation $ 4x^2\plus{}5\minus{}8x\equal{}0$ is equal to: $\textbf{(A)}\ 8 \qquad \textbf{(B)}\ -5 \qquad \textbf{(C)}\ -\dfrac{5}{4} \qquad \textbf{(D)}\ -2 \qquad \textbf{(E)}\ \text{None of these}$

Let $N=10^6$. For which integer $a$ with $0 \leq a \leq N-1$ is the value of \[\binom{N}{a+1}-\binom{N}{a}\] maximized? [i]Proposed by Lewis Chen[/i]

In the beginning, the number 1 is written on the board 9999 times. We are allowed to perform the following actions: [list] [*] Erase four numbers of the form $x,x,y,y$, and instead write the two numbers $x+y,x-y$. (The order or location of the erased numbers does not matter) [*] Erase the number 0 from the board, if it's there. [/list] Is it possible to reach a state where: [list=a] [*] Only one number remains on the board? [*] At most three numbers remain on the board? [/list]

Prove the inequality: $$\frac{A+a+B+b}{A+a+B+b+c+r}+\frac{B+b+C+c}{B+b+C+c+a+r}>\frac{C+c+A+a}{C+c+A+a+b+r}$$ where $A$, $B$, $C$, $a$, $b$, $c$ and $r$ are positive real numbers

Determine all the functions $f : \mathbb{R}\rightarrow\mathbb{R}$ that satisfies the following. $f(xf(x)+f(x)f(y)+y-1)=f(xf(x)+xy)+y-1$

Find the area of the domain of the system of inequality \[y(y-|x^{2}-5|+4)\leq 0,\ \ y+x^{2}-2x-3\leq 0. \]

Let $\omega$ be a nonreal $47$th root of unity. Suppose that $\mathcal{S}$ is the set of polynomials of degree at most $46$ and coefficients equal to either $0$ or $1$. Let $N$ be the number of polynomials $Q \in \mathcal{S}$ such that \[ \sum_{j = 0}^{46} \frac{Q(\omega^{2j}) - Q(\omega^{j})}{\omega^{4j} + \omega^{3j} + \omega^{2j} + \omega^j + 1} = 47. \] The prime factorization of $N$ is $p_1^{\alpha_1}p_2^{\alpha_2} \dots p_s^{\alpha_s}$ where $p_1, \ldots, p_s$ are distinct primes and $\alpha_1, \alpha_2, \ldots, \alpha_s$ are positive integers. Compute $\sum_{j = 1}^s p_j\alpha_j$.

Solve $|||||x^2-x-1| - 2| - 3| - 4| - 5| = x^2 + x - 30$.

Find all functions $f: \mathbb R \rightarrow \mathbb R$ such that \[f(x+xy+f(y)) = \left(f(x)+\frac{1}{2}\right) \left(f(y)+\frac{1}{2}\right)\] holds for all real numbers $x,y$.

Find all real numbers $k $ such that $x^2 - 2 x [x] + x - k = 0$ has at least two non-negative roots.

[b]p1.[/b] Alan leaves home when the clock in his cardboard box says $7:35$ AM and his watch says $7:41$ AM. When he arrives at school, his watch says $7:47$ AM and the $7:45$ AM bell rings. Assuming the school clock, the watch, and the home clock all go at the same rate, how many minutes behind the school clock is the home clock? [b]p2.[/b] Compute $$\left( \frac{2012^{2012-2013} + 2013}{2013} \right) \times 2012.$$ Express your answer as a mixed number. [b]p3.[/b] What is the last digit of $$2^{3^{4^{5^{6^{7^{8^{9^{...^{2013}}}}}}}}} ?$$ [b]p4.[/b] Let $f(x)$ be a function such that $f(ab) = f(a)f(b)$ for all positive integers $a$ and $b$. If $f(2) = 3$ and $f(3) = 4$, find $f(12)$. [b]p5.[/b] Circle $X$ with radius $3$ is internally tangent to circle $O$ with radius $9$. Two distinct points $P_1$ and $P_2$ are chosen on $O$ such that rays $\overrightarrow{OP_1}$ and $\overrightarrow{OP_2}$ are tangent to circle $X$. What is the length of line segment $P_1P_2$? [b]p6.[/b] Zerglings were recently discovered to use the same $24$-hour cycle that we use. However, instead of making $12$-hour analog clocks like humans, Zerglings make $24$-hour analog clocks. On these special analog clocks, how many times during $ 1$ Zergling day will the hour and minute hands be exactly opposite each other? [b]p7.[/b] Three Small Children would like to split up $9$ different flavored Sweet Candies evenly, so that each one of the Small Children gets $3$ Sweet Candies. However, three blind mice steal one of the Sweet Candies, so one of the Small Children can only get two pieces. How many fewer ways are there to split up the candies now than there were before, assuming every Sweet Candy is different? [b]p8.[/b] Ronny has a piece of paper in the shape of a right triangle $ABC$, where $\angle ABC = 90^o$, $\angle BAC = 30^o$, and $AC = 3$. Holding the paper fixed at $A$, Ronny folds the paper twice such that after the first fold, $\overline{BC}$ coincides with $\overline{AC}$, and after the second fold, $C$ coincides with $A$. If Ronny initially marked $P$ at the midpoint of $\overline{BC}$, and then marked $P'$ as the end location of $P$ after the two folds, find the length of $\overline{PP'}$ once Ronny unfolds the paper. [b]p9.[/b] How many positive integers have the same number of digits when expressed in base $3$ as when expressed in base $4$? [b]p10.[/b] On a $2 \times 4$ grid, a bug starts at the top left square and arbitrarily moves north, south, east, or west to an adjacent square that it has not already visited, with an equal probability of moving in any permitted direction. It continues to move in this way until there are no more places for it to go. Find the expected number of squares that it will travel on. Express your answer as a mixed number. PS. You had better use hide for answers.

Find the area of the domain expressed by the following system inequalities. \[x\geq 0,\ y\geq 0,\ x^{\frac{1}{p}}+y^{\frac{1}{p}} \leq 1\ (p=1,2,\cdots)\]

Prove that the equations $$x^2-3xy+2y^2+x-y=0 \text{ and } x^2-2xy+y^2-5x+7y=0$$ imply the equation $xy-12x+15y=0$.

Find all polynomials $P$ such that $P(x)+3P(x+2)=3P(x+1)+P(x+3)$ for all real numbers $x$.

The function $f:\mathbb{N} \rightarrow \mathbb{N}$ verifies: $1) f(n+2)-2022 \cdot f(n+1)+2021 \cdot f(n)=0, \forall n \in \mathbb{N};$ $2) f(20^{22})=f(22^{20});$ $3) f(2021)=2022$. Find all possible values of $f(2022)$.

The quadratic polynomials $f$ and $g$ with real coefficients are such that if $g(x)$ is an integer for some $x>0$, then so is $f(x)$. Prove that there exist integers $m,n$ such that $f(x)=mg(x)+n$ for all $x$.