Found problems: 4275
Let $P(n)$ be a polynomial of degree $m$ with integer coefficients, where $m \le 10$. Suppose that $P(0)=0$, $P(n)$ has $m$ distinct integer roots, and $P(n)+1$ can be factored as the product of two nonconstant polynomials with integer coefficients. Find the sum of all possible values of $P(2)$.
[i]Proposed by Evan Chen[/i]
Let $f(x), g(x)$ be real polynomials of degrees $2$ and $3$, respectively. Could it happen that $f(g(x))$ has $6$ distinct roots, which are powers of $2$?
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$.
Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.
Let $a,b,c$ be distinct positive real numbers, and let $k$ be a positive integer greater than $3$. Show that
\[\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c)\]
and
\[\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).\]
[i]Calvin Deng.[/i]
Positive rational number $a$ and $b$ satisfy the equality
\[a^3 + 4a^2b = 4a^2 + b^4.\]
Prove that the number $\sqrt{a}-1$ is a square of a rational number.
Suppose $P(n) $ is a nonconstant polynomial where all of its coefficients are nonnegative integers such that
\[ \sum_{i=1}^n P(i) | nP(n+1) \]
for every $n \in \mathbb{N}$.
Prove that there exists an integer $k \ge 0$ such that
\[ P(n) = \binom{n+k}{n-1} P(1) \]
for every $n \in \mathbb{N}$.
Let $P_1(x)=\frac{1}{x}$ and $P_n(x)=P_{n-1}(x)+P_{n-1}(x-1)$ for every natural $ n$ greater than $1$. Find the value of $P_{2008}(2008)$.
[i](Mathophile)[/i]
Today was the 5th Kettering Olympiad - and here are the problems, which are very good intermediate problems.
1. Find all real $x$ so that $(1+x^2)(1+x^4)=4x^3$
2. Mark and John play a game. They have $100$ pebbles on a table. They take turns taking at least one at at most eight pebbles away. The person to claim the last pebble wins. Mark goes first. Can you find a way for Mark to always win? What about John?
3. Prove that
$\sin x + \sin 3x + \sin 5x + ... + \sin 11 x = (1-\cos 12 x)/(2 \sin x)$
4. Mark has $7$ pieces of paper. He takes some of them and splits each into $7$ pieces of paper. He repeats this process some number of times. He then tells John he has $2000$ pieces of paper. John tells him he is wrong. Why is John right?
5. In a triangle $ABC$, the altitude, angle bisector, and median split angle $A$ into four equal angles. Find the angles of $ABC.$
6. There are $100$ cities. There exist airlines connecting pairs of cities.
a) Find the minimal number of airlines such that with at most $k$ plane changes, one can go from any city to any other city.
b) Given that there are $4852$ airlines, show that, given any schematic, one can go from any city to any other city.
For a positive integer $n$ we denote by $s(n)$ the sum of the digits of $n$. Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a polynomial, where $n \geqslant 2$ and $a_i$ is a positive integer for all $0 \leqslant i \leqslant n-1$. Could it be the case that, for all positive integers $k$, $s(k)$ and $s(P(k))$ have the same parity?
The sequence $a_0$, $a_1$, $a_2$, $\ldots\,$ satisfies the recurrence equation
\[
a_n = 2 a_{n-1} - 2 a_{n - 2} + a_{n - 3}
\]
for every integer $n \ge 3$. If $a_{20} = 1$, $a_{25} = 10$, and $a_{30} = 100$, what is the value of $a_{1331}$?
Given are reals $a, b$. Prove that at least one of the equations $x^4-2b^3x+a^4=0$ and $x^4-2a^3x+b^4=0$ has a real root.
Proposed by N. Agakhanov
Find all polynomials $p(x)$ of degree $5$ such that $p(x) + 1$ is divisible by $(x-1)^3$ and $p(x) - 1$ is divisible by $(x+1)^3$.
Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$.
[i]Alternative formulation[/i]:
Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial
\[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}.
\]
Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$
[i]Proposed by Federico Ardila, Colombia[/i]
Fix an integer $n \geq 3$. Determine the smallest positive integer $k$ satisfying the following condition:
For any tree $T$ with vertices $v_1, v_2, \dots, v_n$ and any pairwise distinct complex numbers $z_1, z_2, \dots, z_n$, there is a polynomial $P(X, Y)$ with complex coefficients of total degree at most $k$ such that for all $i \neq j$ satisfying $1 \leq i, j \leq n$, we have $P(z_i, z_j) = 0$ if and only if there is an edge in $T$ joining $v_i$ to $v_j$.
Note, for example, that the total degree of the polynomial
$$
9X^3Y^4 + XY^5 + X^6 - 2
$$
is 7 because $7 = 3 + 4$.
[i]Proposed by Andrei Chiriță, Romania[/i]
Find all pairs of solutions $(x,y)$:
\[ x^3 + x^2y + xy^2 + y^3 = 8(x^2 + xy + y^2 + 1). \]
For a polynomial $P$ with integer coefficients, $P(5)$ is divisible by $2$ and $P(2)$ is divisible by $5$. Prove that $P(7)$ is divisible by $10$.
If $ P(x)$ is a polynomial with integer coefficients and $ a$, $ b$, $ c$, three distinct integers, then show that it is impossible to have $ P(a)\equal{}b$, $ P(b)\equal{}c$, $ P(c)\equal{}a$.
Let $a,b,a_2,\ldots,a_{n-2}$ be real numbers with $ab\ne0$ such that all the roots of the equation
$$ax^n-ax^{n-1}+a_2x^{n-2}+\ldots+a_{n-2}x^2-n^2bx+b=0$$are positive and real. Prove that these roots are all equal.
Let $n\ge 2$ be a positive integer. For any integer $a$, let $P_a(x)$ denote the polynomial $x^n+ax$. Let $p$ be a prime number and define the set $S_a$ as the set of residues mod $p$ that $P_a(x)$ attains. That is, $$S_a=\{b\mid 0\le b\le p-1,\text{ and there is }c\text{ such that }P_a(c)\equiv b \pmod{p}\}.$$Show that the expression $\frac{1}{p-1}\sum\limits_{a=1}^{p-1}|S_a|$ is an integer.
[i]Proposed by fattypiggy123[/i]
Find all values of $a$ for which the equation $x^3 - x + a = 0$ has three different integer solutions.
Show that there exists a degree $58$ monic polynomial
$$P(x) = x^{58} + a_1x^{57} + \cdots + a_{58}$$
such that $P(x)$ has exactly $29$ positive real roots and $29$ negative real roots and that $\log_{2017} |a_i|$ is a positive integer for all $1 \leq i \leq 58$.
A standard parabola is the graph of a quadratic polynomial $y = x^2 + ax + b$ with leading co\"efficient 1. Three standard parabolas with vertices $V1, V2, V3$ intersect pairwise at points $A1, A2, A3$. Let $A \mapsto s(A)$ be the reflection of the plane with respect to the $x$-axis.
Prove that standard parabolas with vertices $s (A1), s (A2), s (A3)$ intersect pairwise at the points $s (V1), s (V2), s (V3)$.
The coefficients of the polynomial $P(x)$ are nonnegative integers, each less than 100. Given that $P(10) = 331633$ and $P(-10) = 273373$, compute $P(1)$.
Let $ f ( x ) \in \mathbb { Z } [ x ] $ be a polynomial with integer coefficients such that $ f ( 1 ) = - 1 , f ( 4 ) = 2 $ and $f ( 8 ) = 34 $. Suppose $n\in\mathbb{Z}$ is an integer such that $ f ( n ) = n ^ { 2 } - 4 n - 18 $. Determine all possible values for $n$.