Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$

Find all real non-zero polynomials satisfying $P(x)^3+3P(x)^2=P(x^{3})-3P(-x)$ for all $x\in\mathbb{R}$.

[b]p1.[/b] Sometimes one finds in an old park a tetrahedral pile of cannon balls, that is, a pile each layer of which is a tightly packed triangular layer of balls. A. How many cannon balls are in a tetrahedral pile of cannon balls of $N$ layers? B. How high is a tetrahedral pile of cannon balls of $N$ layers? (Assume each cannon ball is a sphere of radius $R$.) [b]p2.[/b] A prime is an integer greater than $1$ whose only positive integer divisors are itself and $1$. A. Find a triple of primes $(p, q, r)$ such that $p = q + 2$ and $q = r + 2$ . B. Prove that there is only one triple $(p, q, r)$ of primes such that $p = q + 2$ and $q = r + 2$ . [b]p3.[/b] The function $g$ is defined recursively on the positive integers by $g(1) =1$, and for $n>1$ , $g(n)= 1+g(n-g(n-1))$ . A. Find $g(1)$ , $g(2)$ , $g(3)$ and $g(4)$ . B. Describe the pattern formed by the entire sequence $g(1) , g(2 ), g(3), ...$ C. Prove your answer to Part B. [b]p4.[/b] Let $x$ , $y$ and $z$ be real numbers such that $x + y + z = 1$ and $xyz = 3$ . A. Prove that none of $x$ , $y$ , nor $z$ can equal $1$. B. Determine all values of $x$ that can occur in a simultaneous solution to these two equations (where $x , y , z$ are real numbers). [b]p5.[/b] A round robin tournament was played among thirteen teams. Each team played every other team exactly once. At the conclusion of the tournament, it happened that each team had won six games and lost six games. A. How many games were played in this tournament? B. Define a [i]circular triangle[/i] in a round robin tournament to be a set of three different teams in which none of the three teams beat both of the other two teams. How many circular triangles are there in this tournament? C. Prove your answer to Part B. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

At least one of the coefficients of a polynomial $P(x)$ is negative. Can all of the coefficients of all of its powers $(P(x))^n$, $n > 1$, be positive? (0 Kryzhanovskij)

Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.

For a given integer $n \ge 2$, find the maximum possible value of $V_n = \sin x_1 \cos x_2 +\sin x_2 \cos x_3 +...+\sin x_n \cos x_1$, where $x_1,x_2,...,x_n$ are real numbers.

Solve in $ \mathbb{C} $ the following equation: $ |z|+|z-5i|=|z-2i|+|z-3i|. $

Let $a_1,a_2,...$ be a strictly increasing sequence of positive real numbers such that $a_1 = 1$,$a_2 = 4$, and that for every positive integer $k$, the subsequence $a_{4k-3}$,$a_{4k-2}$,$a_{4k-1}$,$a_{4k}$ is geometric and the subsequence $a_{4k-1}$,$a_{4k}$,$a_{4k+1}$,$a_{4k+2}$ is arithmetic. For each positive integer $k$, let rk be the common ratio of the geometric sequence $a_{4k-3}$,$a_{4k-2}$,$a_{4k-1}$,$a_{4k}$. Compute $$\sum_{k=1}^{\infty} (r_k -1)(r_{k+1} -1)$$

Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$? [i]By Omid Hatami[/i]

Determine all polynomials $P(x)$ with real coeffcients such that $(x^3+3x^2+3x+2)P(x-1)=(x^3-3x^2+3x-2)P(x)$.

Let $p(x)$ be a monic integer polynomial of degree $n$ that has $n$ real roots, $\alpha_1,\alpha_2,\ldots, \alpha_n$. Let $q(x)$ be an arbitrary integer polynomial that is relatively prime to polynomial $p(x)$. Prove that \[\sum_{i=1}^n \left|q(\alpha_i)\right|\ge n.\] [i]Submitted by Dávid Matolcsi, Berkeley[/i]

Let $a, b, c$ be positive real numbers and let $[x]$ denote the greatest integer that does not exceed the real number $x$. Suppose that $f$ is a function defined on the set of non-negative integers $n$ and taking real values such that $f(0) = 0$ and \[f(n) \leq an + f([bn]) + f([cn]), \qquad \text{ for all } n \geq 1.\] Prove that if $b + c < 1$, there is a real number $k$ such that \[f(n) \leq kn \qquad \text{ for all } n \qquad (1)\] while if $b + c = 1$, there is a real number $K$ such that $f(n) \leq K n \log_2 n$ for all $n \geq 2$. Show that if $b + c = 1$, there may not be a real number $k$ that satisfies $(1).$

Let $a$ and $b$ be real numbers bigger than $1$. Find maximal value of $c \in \mathbb{R}$ such that $$\frac{1}{3+\log _{a} b}+\frac{1}{3+\log _{b} a} \geq c$$

Let $f(x)$ be a polynomial. Prove that if $\int_0^1 f(x)g_n(x)\ dx=0\ (n=0,\ 1,\ 2,\ \cdots)$, then all coefficients of $f(x)$ are 0 for each case as follows. (1) $g_n(x)=(1+x)^n$ (2) $g_n(x)=\sin n\pi x$ (3) $g_n(x)=e^{nx}$

Consider the set $C$ of all $r$ -tuple whose components are $1$ or $-1$. Calculate the sum of all the components of all the elements of $C$ excluding the $ r$ -tuple $(1, 1, 1, . . . , 1)$.

What is the minimum $k{}$ for which among any three nonzero real numbers there are two numbers $a{}$ and $b{}$ such that either $|a-b|\leqslant k$ or $|1/a-1/b|\leqslant k$? [i]Maxim Didin[/i]

Let $f(x)=\frac{P(x)}{Q(x)}$. Where $P(x), Q(x)$ are two non constant polynomials with no common zeros and $P(0)=P(1)=0$. Suppose $f(x)f(\frac{1}{x})=f(x)+f(\frac{1}{x})$ for all infinitely many values of $x$. a. Show that $deg(P) <deg(Q).$ b. Show that $P'(1)=2Q'(1)- deg(Q). Q(1)$ Here $P'(x)$ denotes the derivatives of $P(x)$ as usual

Let $S$ be a set of positive integers satisfying the following two conditions: • For each positive integer $n$, at least one of $n, 2n, \dots, 100n$ is in $S$. • If $a_1, a_2, b_1, b_2$ are positive integers such that $\gcd(a_1a_2, b_1b_2) = 1$ and $a_1b_1, a_2b_2 \in S,$ then $a_2b_1, a_1b_2 \in S.$ Suppose that $S$ has natural density $r$. Compute the minimum possible value of $\lfloor 10^5r\rfloor$. Note: $S$ has natural density $r$ if $\tfrac{1}{n}|S \cap {1, \dots, n}|$ approaches $r$ as $n$ approaches $\infty$.

For positive numbers $ a $, $ b $ and $ c $ satisfying the equality $ a + b + c = 1 $, prove the inequality $$ \frac {a ^ 7 + b ^ 7} {a ^ 5 + b ^ 5} + \frac {b ^ 7 + c ^ 7} {b ^ 5 + c ^ 5} + \frac {c ^ 7 + a ^ 7} {c ^ 5 + a ^ 5} \geq \frac {1} {3}. $$

Let $Z_1,Z_2,\cdots ,Z_n$ be complex numbers satisfying $|Z_1|+|Z_2|+\cdots +|Z_n|=1$. Show that there exist some among the $n$ complex numbers such that the modulus of the sum of these complex numbers is not less than $1/6$.

Let $S = \{(x,y) | x = 1, 2, \ldots, 1993, y = 1, 2, 3, 4\}$. If $T \subset S$ and there aren't any squares in $T.$ Find the maximum possible value of $|T|.$ The squares in T use points in S as vertices.

The roots of the equation \[ x^3-3ax^2+bx+18c=0 \] form a non-constant arithmetic progression and the roots of the equation \[ x^3+bx^2+x-c^3=0 \] form a non-constant geometric progression. Given that $a,b,c$ are real numbers, find all positive integral values $a$ and $b$.

Find an integral solution of the equation \[ \left \lfloor \frac{x}{1!} \right \rfloor + \left \lfloor \frac{x}{2!} \right \rfloor + \left \lfloor \frac{x}{3!} \right \rfloor + \dots + \left \lfloor \frac{x}{10!} \right \rfloor = 2019. \] (Note $\lfloor u \rfloor$ stands for the greatest integer less than or equal to $u$.)

If the remainder is $2013$ when a polynomial with coefficients from the set $\{0,1,2,3,4,5\}$ is divided by $x-6$, what is the least possible value of the coefficient of $x$ in this polynomial? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 1 $

$4$ men stand at the entrance of a dark tunnel. Man $A$ needs $10$ minutes to pass through the tunnel, man $B$ needs $5$ minutes, man $C$ needs $2$ minutes and man $D$ needs $1$ minute. There is only one torch, that may be used from anyone that passes through the tunnel. Additionaly, at most $2$ men can pass through at the same time using the existing torch. Determine the smallest possible time the four men need to reach the exit of the tunnel.