Prove that for any integer $n$, there exists a unique polynomial $Q$ with coefficients in $\{0,1,\ldots,9\}$ such that $Q(-2) = Q(-5) = n$.

Let $p$ be a prime number and $k$ be a positive integer. Let \[t=\sum_{i=0}^\infty\bigg\lfloor\frac{k}{p^i}\bigg\rfloor.\]a) Let $f(x)$ be a polynomial of degree $k$ with integer coefficients such that its leading coefficient is $1$ and its constant is divisible by $p.$ prove that there exists $n\in\mathbb{N}$ for which $p\mid f(n),$ but $p^{t+1}\nmid f(n).$ b) Prove that the statement above is sharp, i.e. there exists a polynomial $g(x)$ of degree $k,$ integer coefficients, leading coefficient $1$ and constant divisible by $p$ such that if $p\mid g(n)$ is true for a certain $n\in\mathbb{N},$ then $p^t\mid g(n)$ also holds. [i]Proposed by Kristóf Szabó, Budapest[/i]

The reals $b>0$ and $a$ are such that the quadratic $x^2+ax+b$ has two distinct real roots, exactly one of which lies in the interval $[-1;1]$. Prove that one of the roots lies in the interval $(-b;b)$.

A polynomial \[ P(x) \equal{} c_{2004}x^{2004} \plus{} c_{2003}x^{2003} \plus{} ... \plus{} c_1x \plus{} c_0 \]has real coefficients with $ c_{2004}\not \equal{} 0$ and $ 2004$ distinct complex zeroes $ z_k \equal{} a_k \plus{} b_ki$, $ 1\leq k\leq 2004$ with $ a_k$ and $ b_k$ real, $ a_1 \equal{} b_1 \equal{} 0$, and \[ \sum_{k \equal{} 1}^{2004}{a_k} \equal{} \sum_{k \equal{} 1}^{2004}{b_k}. \]Which of the following quantities can be a nonzero number? $ \textbf{(A)}\ c_0 \qquad \textbf{(B)}\ c_{2003} \qquad \textbf{(C)}\ b_2b_3...b_{2004} \qquad \textbf{(D)}\ \sum_{k \equal{} 1}^{2004}{a_k} \qquad \textbf{(E)}\ \sum_{k \equal{} 1}^{2004}{c_k}$

A function $ f:\mathbb{Q}_{>0}\longrightarrow\mathbb{Q} $ has the following property: $$ f(xy)=f(x)+f(y),\quad x,y\in\mathbb{Q}_{>0} $$ [b]a)[/b] Demonstrate that there are no injective functions with this property. [b]b)[/b] Do exist surjective functions having this property?

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x^2 + y) \ge (\frac{1}{x} + 1)f(y)$$ holds for all $x \in \mathbb{R} \setminus \{0\}$ and all $y \in \mathbb{R}$.

For real numbers $a, b$ and $c$ we have \[(2b-a)^2 + (2b-c)^2 = 2(2b^2-ac).\] Prove that the numbers $a, b$ and $c$ are three consecutive terms in some arithmetic sequence.

Find the arithmetic sequences of $ 5 $ integers $ n_1,n_2,n_3,n_4,n_5 $ that verify $ 5|n_1,2|n_2,11|n_3,7|n_4,17|n_5. $

Find all positive integers $k<202$ for which there exist a positive integers $n$ such that $$\bigg {\{}\frac{n}{202}\bigg {\}}+\bigg {\{}\frac{2n}{202}\bigg {\}}+\cdots +\bigg {\{}\frac{kn}{202}\bigg {\}}=\frac{k}{2}$$

Let $a,b,c$ be real numbers such that \[ab^2+bc^2+ca^2=6\sqrt{3}+ac^2+cb^2+ba^2.\] Find the smallest possible value of $a^2 + b^2 + c^2$. [i]Binh Luan and Nhan Xet, Vietnam[/i]

The vertices of a regular $n$-gon are initially marked with one of the signs $+$ or $-$ . A [i]move[/i] consists in choosing three consecutive vertices and changing the signs from the vertices , from $+$ to $-$ and from $-$ to $+$. [b]a)[/b] Prove that if $n=2015$ then for any initial configuration of signs , there exists a sequence of [i]moves[/i] such that we'll arrive at a configuration with only $+$ signs. [b]b)[/b] Prove that if $n=2016$ , then there exists an initial configuration of signs such that no matter how we make the [i]moves[/i] we'll never arrive at a configuration with only $+$ signs.

Find all functions $f : R \to R$ such that $$f(x + zf(y)) = f(x) + zf(y), $$ for all $x, y, z \in R$.

Let $ n$ be the number of integer values of $ x$ such that $ P \equal{} x^4 \plus{} 6x^3 \plus{} 11x^2 \plus{} 3x \plus{} 31$ is the square of an integer. Then $ n$ is: $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 0$

Solve the inequation $\sqrt {3-x}-\sqrt {x+1}>\frac {1}{2}$.

Find all polynomials $P(x)$ with real coefficients such that \[xP\bigg(\frac{y}{x}\bigg)+yP\bigg(\frac{x}{y}\bigg)=x+y\] for all nonzero real numbers $x$ and $y$.

For positive integer n, define $a_n$ as the number of the triangles with integer length of every side and the length of the longest side being $2n.$ (1) Find $a_n$ in terms of $n;$ (2)If the sequence $\{ b_n\}$ satisfying for any positive integer $n,$ $\sum_{k=1}^n(-1)^{n-k}\binom {n}{k} b_k=a_n.$ Find the number of positive integer $n$ satisfying that $b_n\leq 2019a_n.$

Let $c_1, \ldots, c_n \in \mathbb{R}$ with $n \geq 2$ such that \[ 0 \leq \sum^n_{i=1} c_i \leq n. \] Show that we can find integers $k_1, \ldots, k_n$ such that \[ \sum^n_{i=1} k_i = 0 \] and \[ 1-n \leq c_i + n \cdot k_i \leq n \] for every $i = 1, \ldots, n.$ [hide="Another formulation:"] Let $x_1, \ldots, x_n,$ with $n \geq 2$ be real numbers such that \[ |x_1 + \ldots + x_n| \leq n. \] Show that there exist integers $k_1, \ldots, k_n$ such that \[ |k_1 + \ldots + k_n| = 0. \] and \[ |x_i + 2 \cdot n \cdot k_i| \leq 2 \cdot n -1 \] for every $i = 1, \ldots, n.$ In order to prove this, denote $c_i = \frac{1+x_i}{2}$ for $i = 1, \ldots, n,$ etc. [/hide]

Let $P(x)$ and $Q(x)$ be monic polynomials. Prove that the sum of the squares of the coeficients of the polynomial $P(x)Q(x)$ is not smaller than the sum of the squares of the free coefficients of $P(x)$ and $Q(x)$. [i]A. Galochkin, O. Ljashko[/i]

Solve the equation $$\sqrt{x(x+7)}+\sqrt{(x+7)(x+17)}+\sqrt{(x+17)(x+24)}=12+17\sqrt2$$

[u]Set 1[/u] [b]p1.[/b] Farmer John has $4000$ gallons of milk in a bucket. On the first day, he withdraws $10\%$ of the milk in the bucket for his cows. On each following day, he withdraws a percentage of the remaining milk that is $10\%$ more than the percentage he withdrew on the previous day. For example, he withdraws $20\%$ of the remaining milk on the second day. How much milk, in gallons, is left after the tenth day? [b]p2.[/b] Will multiplies the first four positive composite numbers to get an answer of $w$. Jeremy multiplies the first four positive prime numbers to get an answer of $j$. What is the positive difference between $w$ and $j$? [b]p3.[/b] In Nathan’s math class of $60$ students, $75\%$ of the students like dogs and $60\%$ of the students like cats. What is the positive difference between the maximum possible and minimum possible number of students who like both dogs and cats? [u]Set 2[/u] [b]p4.[/b] For how many integers $x$ is $x^4 - 1$ prime? [b]p5.[/b] Right triangle $\vartriangle ABC$ satisfies $\angle BAC = 90^o$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 60$ and $AB = 65$, find the area of $\vartriangle ABC$. [b]p6.[/b] Define $n! = n \times (n - 1) \times ... \times 1$. Given that $3! + 4! + 5! = a^2 + b^2 + c^2$ for distinct positive integers $a, b, c$, find $a + b + c$. [u]Set 3[/u] [b]p7.[/b] Max nails a unit square to the plane. Let M be the number of ways to place a regular hexagon (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Vincent, on the other hand, nails a regular unit hexagon to the plane. Let $V$ be the number of ways to place a square (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Find the nonnegative difference between $M$ and $V$ . [b]p8.[/b] Let a be the answer to this question, and suppose $a > 0$. Find $\sqrt{a +\sqrt{a +\sqrt{a +...}}}$ . [b]p9.[/b] How many ordered pairs of integers $(x, y)$ are there such that $x^2 - y^2 = 2019$? [u]Set 4[/u] [b]p10.[/b] Compute $\frac{p^3 + q^3 + r^3 - 3pqr}{p + q + r}$ where $p = 17$, $q = 7$, and $r = 8$. [b]p11.[/b] The unit squares of a $3 \times 3$ grid are colored black and white. Call a coloring good if in each of the four $2 \times 2$ squares in the $3 \times 3$ grid, there is either exactly one black square or exactly one white square. How many good colorings are there? Consider rotations and reflections of the same pattern distinct colorings. [b]p12.[/b] Define a $k$-[i]respecting [/i]string as a sequence of $k$ consecutive positive integers $a_1$, $a_2$, $...$ , $a_k$ such that $a_i$ is divisible by $i$ for each $1 \le i \le k$. For example, $7$, $8$, $9$ is a $3$-respecting string because $7$ is divisible by $1$, $8$ is divisible by $2$, and $9$ is divisible by $3$. Let $S_7$ be the set of the first terms of all $7$-respecting strings. Find the sum of the three smallest elements in $S_7$. [u]Set 5[/u] [b]p13.[/b] A triangle and a quadrilateral are situated in the plane such that they have a finite number of intersection points $I$. Find the sum of all possible values of $I$. [b]p14.[/b] Mr. DoBa continuously chooses a positive integer at random such that he picks the positive integer $N$ with probability $2^{-N}$ , and he wins when he picks a multiple of 10. What is the expected number of times Mr. DoBa will pick a number in this game until he wins? [b]p15.[/b] If $a, b, c, d$ are all positive integers less than $5$, not necessarily distinct, find the number of ordered quadruples $(a, b, c, d)$ such that $a^b - c^d$ is divisible by $5$. PS. You had better use hide for answers. Last 4 sets have been posted [url=https://artofproblemsolving.com/community/c4h2777362p24370554]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider all sums that add up to $2015$. In each sum, the addends are consecutive positive integers, and all sums have less than $10$ addends. How many such sums are there?

In $1748$, the great Russian mathematician Leonhard Euler published one of his most important works, Introduction to the Analysis of Infinites. In this work, in particular, Euler finds the values of two infinite sums $1 +\frac14 +\frac19+ \frac{1}{16}+...$ and $1 +\frac19+ \frac{1}{16}+...$ (the terms in the first sum are the inverses of the squares of the natural numbers, and in the second are the inverses of the squares of the odd numbers of the natural series). The value of the first sum, as Euler proved, equals $\frac{\pi^2}{6}$. Given this result, find the value of the second sum.

How to hang a picture? What a strange question? It's simple. We take a piece of rope, attach its ends to the picture frame on the back side, then drive it into the wall. nail and throw a rope over the nail. The picture is hanging. If you pull out the nail, then, of course, it will fall. But Professor No wonder acted differently. At first, he attached the rope to the painting in the same way, only he took it a little longer. Then he hammered two nails into the wall nearby and threw a rope over these nails in a special way. The painting hangs on these nails, but if you pull out any nail, the painting will fall. Moreover, the professor claims that he can hang a painting on three nails so that the painting hangs on all three, but if any nail is pulled out, the painting will fall. You have two tasks: indicate how you can hang the picture in the right way on a) two nails; b) three nails.

The set $ \{a_0, a_1, \ldots, a_n\}$ of real numbers satisfies the following conditions: [b](i)[/b] $ a_0 \equal{} a_n \equal{} 0,$ [b](ii)[/b] for $ 1 \leq k \leq n \minus{} 1,$ \[ a_k \equal{} c \plus{} \sum^{n\minus{}1}_{i\equal{}k} a_{i\minus{}k} \cdot \left(a_i \plus{} a_{i\plus{}1} \right)\] Prove that $ c \leq \frac{1}{4n}.$

The three roots of the cubic $ 30 x^3 \minus{} 50x^2 \plus{} 22x \minus{} 1$ are distinct real numbers between $ 0$ and $ 1$. For every nonnegative integer $ n$, let $ s_n$ be the sum of the $ n$th powers of these three roots. What is the value of the infinite series \[ s_0 \plus{} s_1 \plus{} s_2 \plus{} s_3 \plus{} \dots \, ?\]