Given positive integers $a,b,c$ which are pairwise coprime. Let $f(n)$ denotes the number of the non-negative integer solution $(x,y,z)$ to the equation $$ax+by+cz=n.$$ Prove that there exists constants $\alpha, \beta, \gamma \in \mathbb{R}$ such that for any non-negative integer $n$, $$|f(n)- \left( \alpha n^2+ \beta n + \gamma \right) | < \frac{1}{12} \left( a+b+c \right).$$

Find all functions $f:\mathbb{Q}\rightarrow\mathbb{Q}$ and $g:\mathbb{Q}\rightarrow\mathbb{Q}$ such that $$f(f(x)+yg(x))=(x+1)g(y)+f(y)$$ for any $x;y\in\mathbb{Q}$

Let $f(x)$ be a function such that $f(x)+2f\left(\frac{x+2010}{x-1}\right)=4020 - x$ for all $x \ne 1$. Then the value of $f(2012)$ is (A) $2010$, (B) $2011$, (C) $2012$, (D) $2014$, (E) None of the above.

[b]Randy:[/b] "Hi Rachel, that's an interesting quadratic equation you have written down. What are its roots?'' [b]Rachel:[/b] "The roots are two positive integers. One of the roots is my age, and the other root is the age of my younger brother, Jimmy.'' [b]Randy:[/b] "That is very neat! Let me see if I can figure out how old you and Jimmy are. That shouldn't be too difficult since all of your coefficients are integers. By the way, I notice that the sum of the three coefficients is a prime number.'' [b]Rachel:[/b] "Interesting. Now figure out how old I am.'' [b]Randy:[/b] "Instead, I will guess your age and substitute it for $x$ in your quadratic equation $\dots$ darn, that gives me $-55$, and not $0$.'' [b]Rachel:[/b] "Oh, leave me alone!'' (1) Prove that Jimmy is two years old. (2) Determine Rachel's age.

Find all polynomials $P(x)$ , such that $$P(x^3+1)=\left(P (x+1)\right)^3$$

Three real numbers $ a,b,c$ satisfy the equations $ a\plus{}b\plus{}c\equal{}3, a^2\plus{}b^2\plus{}c^2\equal{}9, a^3\plus{}b^3\plus{}c^3\equal{}24.$ Find $ a^4\plus{}b^4\plus{}c^4$.

Vijay picks two random distinct primes $1\le p, q\le 10^4$. Let $r$ be the probability that $3^{2205403200}\equiv 1\bmod pq$. Estimate $r$ in the form $0.abcdef$, where $a, b, c, d, e, f$ are decimal digits.

Prove the following equalities of sets: \[ \text{i)} \{x\in \mathbb{R}\ |\ \log_2 \lfloor x \rfloor \equal{} \lfloor \log_2 x\rfloor \} \equal{} \bigcup_{m\in \mathbb{N}} \left[2^m,2^m \plus{} 1\right)\] \[ \text{ii)} \{x\in \mathbb{R}\ |\ 2^{\lfloor x\rfloor} \equal{} \left\lfloor 2^x\right\rfloor \} \equal{} \bigcup_{m\in \mathbb{N}} \left[m, \log_2 (2^m \plus{} 1) \right)\]

Let $m$ be equal to $1$ or $2$ and $n<10799$ be a positive integer. Determine all such $n$ for which $\sum_{k=1}^{n}\frac{1}{\sin{k}\sin{(k+1)}}=m\frac{\sin{n}}{\sin^{2}{1}}$.

For a function $f : [0,1] \to [0,1] $ we define $f^1 = f $ and $f^{n+1} (x) = f (f^n(x))$ for $0 \le x \le 1$ and $n \in N$. Given that there is a $n$ such that $|f^n(x) - f^n(y)| < |x - y| $ for all distinct $x, y \in [0,1]$, prove that there is a unique $x_0 \in [0,1]$ such that $f (x_0) = x_0$.

An integer $n>1$ is given . Find the smallest positive number $m$ satisfying the following conditions： for any set $\{a,b\}$ $\subset \{1,2,\cdots,2n-1\}$ ,there are non-negative integers $ x, y$ ( not all zero) such that $2n|ax+by$ and $x+y\leq m.$

Suppose for real numbers $a, b, c$ we know $a + \dfrac 1b = 3,$ and $b + \dfrac 3c = \dfrac 13.$ What is the value of $c + \dfrac{27}a?$ $$ \mathrm a. ~ 1\qquad \mathrm b.~3\qquad \mathrm c. ~8 \qquad \mathrm d. ~9 \qquad \mathrm e. ~21 $$

Find the integer represented by $\left[ \sum_{n=1}^{10^9} n^{-2/3} \right] $. Here $[x]$ denotes the greatest integer less than or equal to $x.$

Let $a, b,c$ satises the conditions $\begin{cases} 5 \ge a \ge b \ge c \ge 0 \\ a + b \le 8 \\ a + b + c = 10 \end{cases}$ Prove that $a^2 + b^2 + c^2 \le 38$

$a_1,a_2,a_3,\dots$ and $b_1,b_2,b_3,\dots$ are sequences of positive integers. Show that we can find $m < n$ such that $a_m \leq a_n$ and $b_m \leq b_n$.

For real numbers $a, b$, and $c$ the polynomial $p(x) = 3x^7 - 291x^6 + ax^5 + bx^4 + cx^2 + 134x - 2$ has $7$ real roots whose sum is $97$. Find the sum of the reciprocals of those $7$ roots.

Find all polynomials $P(x)$ with real coefficients having the following property: There exists a positive integer n such that the equality $$\sum_{k=1}^{2n+1}(-1)^k \left[\frac{k}{2}\right] P(x + k)=0$$ holds for infinitely many real numbers $x$.

What is the sum of cubes of real roots of the equation $x^3-2x^2-x+1=0$? $ \textbf{(A)}\ -6 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ \text{None of above} $

Given three non-negative real numbers $a$, $b$ and $c$. The sum of the modules of their pairwise differences is equal to $1$, i.e. $|a- b| + |b -c| + |c -a| = 1$. What can the sum $a + b + c$ be equal to?

Given a polynomial $P(x) = a_nx^n + a_{n-1}x^{n-1} + ...+ a_1x + a_0$ of real coefficients. Suppose that $P(x)$ has $n$ real roots (not necessarily distinct), and there exists a positive integer $k$ such that $a_k = a_{k-1} = 0$. Prove that $P(x)$ has a real root of multiplicity $k + 1$.

$100$ numbers $1$, $1/2$, $1/3$, $...$, $1/100$ are written on the blackboard. One may delete two arbitrary numbers $a$ and $b$ among them and replace them by the number $a + b + ab$. After $99$ such operations only one number is left. What is this final number? (D. Fomin, Leningrad)

Prove that:$a+b+c+d \geq \frac{2}{3}(ab+bc+ca+ad+ac+bd)$ where $a;b;c;d$ are positive real numbers satisfying $2(ab+bc+cd+da+ac+bd)+abc+bcd+cda+dab=16$

Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\] [i]Proposed by Warut Suksompong, Thailand[/i]

Consider the sets $A = \{0,1,2\},$ and $B = \{1,2,3,4,5\}.$ Find the number of functions $f: A \to B$ such that $x + f(x) + xf(x)$ is odd for all $x.$ (A function $f:A \to B$ is a rule that assigns to every number in $A$ a number in $B.$) \[\mathrm a. ~15\qquad \mathrm b. ~27 \qquad \mathrm c. ~30 \qquad\mathrm d. ~42\qquad\mathrm e. ~45\]

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers, and let $b_1, b_2, \ldots, b_m$ be $m$ positive integers such that $a_1 a_2 \cdots a_n = b_1 b_2 \cdots b_m$. Prove that a rectangular table with $n$ rows and $m$ columns can be filled with positive integer entries in such a way that * the product of the entries in the $i$-th row is $a_i$ (for each $i \in \left\{1,2,\ldots,n\right\}$); * the product of the entries in the $j$-th row is $b_j$ (for each $i \in \left\{1,2,\ldots,m\right\}$).