Found problems: 4275
Find the smallest positive integer \( k \geq 2 \) for which there exists a polynomial \( f(x) \) of degree \( k \) with integer coefficients and a leading coefficient of \( 1 \) that satisfies the following condition:
(Condition) For any two integers \( m \) and \( n \), if \( f(m) - f(n) \) is a multiple of \( 31 \), then \( m - n \) is a multiple of \( 31 \).
Find all polynomials $p(x)\in\mathbb{R}[x]$ such that for all $x\in \mathbb{R}$:
$p(5x)^2-3=p(5x^2+1)$ such that:
$a) p(0)\neq 0$
$b) p(0)=0$
Find the values of $p$ for which the equation $x^5 - px-1 = 0$ has two roots $r$ and $s$ which are the roots of equation $x^2-ax+b= 0$ for some integers $a,b$.
Let us assume that each of the equations $x^7 + x^2 + 1= 0$ and $x^5- x^4 + x^2- x + 1.001 = 0$ has a single root. Which of these roots is larger?
Prove the following statement: If a polynomial $f(x)$ with real coefficients takes only nonnegative values, then there exists a positive integer $n$ and polynomials $g_1(x), g_2(x),\cdots, g_n(x)$ such that
\[f(x) = g_1(x)^2 + g_2(x)^2 +\cdots+ g_n(x)^2\]
Let $a$ and $b$ be complex non-zero numbers and $z_1,z_2$ the roots of the polynomials $X^2+aX+b$. Show that $|z_1+z_2|=|z_1|+|z_2|$ if and only if there exists a real number $\lambda\ge 4$ such that $a^2=\lambda b$.
$P(x)$ is a fifth degree polynomial. $P(2018)=1$, $P(2019)=2$ $P(2020)=3$, $P(2021)=4$, $P(2022)=5$. $P(2017)=?$
Let $P(x) = x^3 - px^2 + qx - r$ be a cubic polynomial with integer roots $a, b, c$.
[b](a)[/b] Show that the greatest common divisor of $p, q, r$ is equal to $1$ if the greatest common divisor of $a, b, c$ is equal to $1$.
[b](b)[/b] What are the roots of polynomial $Q(x) = x^3-98x^2+98sx-98t$ with $s, t$ positive integers.
Find all integers $k$ such that all roots of the following polynomial are also integers: $$f(x)=x^3-(k-3)x^2-11x+(4k-8).$$
For every positive $ \alpha$, natural number $ n$, and at most $ \alpha n$ points $ x_i$, construct a trigonometric polynomial $ P(x)$ of degree at most $ n$ for which \[ P(x_i) \leq 1, \; \int_0^{2 \pi} P(x)dx=0,\ \; \textrm{and}\ \; \max P(x) > cn\ ,\] where the constant $ c$ depends only on $ \alpha$.
[i]G. Halasz[/i]
Let $ f_1,f_2,f_3,f_4 $ be four polynomials with real coefficients, having the property that
$$ f_1 (1) =f_2 (0), \quad f_2 (1) =f_3 (0),\quad f_3 (1) =f_4 (0),\quad f_4 (1) =f_1 (0) . $$
Prove that there exists a polynomial $ f\in\mathbb{R}[X,Y] $ such that
$$ f(X,0)=f_1(X),\quad f(1,Y) =f_2(Y) ,\quad f(1-X,1) =f_3(X),\quad f(0,1-Y)=f_4(Y) . $$
If $a, b, c$ are positive integers such that \[0 < a^{2}+b^{2}-abc \le c,\] show that $a^{2}+b^{2}-abc$ is a perfect square.
Determine the set of all polynomials $P(x)$ with real coefficients such that the set $\{P(n) | n \in \mathbb{Z}\}$ contains all integers, except possibly finitely many of them.
For each $n \ge 2$ define the polynomial $$f_n(x)=x^n-x^{n-1}-\dots-x-1.$$ Prove that
(a) For each $n \ge 2$, $f_n(x)=0$ has a unique positive real root $\alpha_n$;
(b) $(\alpha_n)_n$ is a strictly increasing sequence;
(c) $\lim_{n \rightarrow \infty} \alpha_n=2.$
Find all the triples of integers $ (a, b,c)$ such that:
\[ \begin{array}{ccc}a\plus{}b\plus{}c &\equal{}& 24\\ a^{2}\plus{}b^{2}\plus{}c^{2}&\equal{}& 210\\ abc &\equal{}& 440\end{array}\]
Let $P$ be a polynomial with integer coefficients of degree $d$. For the set $A = \{ a_1, a_2, ..., a_k\}$ of positive integers we denote $S (A) = P (a_1) + P (a_2) + ... + P (a_k )$. The natural numbers $m, n$ are such that $m ^{d+ 1} | n$. Prove that the set $\{1, 2, ..., n\}$ can be subdivided into $m$ disjoint subsets $A_1, A_2, ..., A_m$ with the same number of elements such that $S (A_1) = S(A_2) = ... = S (A_m )$.
Let $P(x), Q(x)$ and $R(x)$ be polynomials satisfying the equation $2xP(x^3) + Q(-x -x^3) = (1 + x + x^2)R(x)$.
Show that $x - 1$ divides $P(x) - Q(x)$.
The polynomial
$$
Q(x_1,x_2,\ldots,x_4)=4(x_1^2+x_2^2+x_3^2+x_4^2)-(x_1+x_2+x_3+x_4)^2
$$
is represented as the sum of squares of four polynomials of four variables with integer coefficients.
[b]a)[/b] Find at least one such representation
[b]b)[/b] Prove that for any such representation at least one of the four polynomials isidentically zero.
[i](A. Yuran)[/i]
Find the smallest odd integer $ k$ such that: for every $ 3\minus{}$degree polynomials $ f$ with integer coefficients, if there exist $ k$ integer $ n$ such that $ |f(n)|$ is a prime number, then $ f$ is irreducible in $ \mathbb{Z}[n]$.
Given a polynomial with integer coefficients, which has at least one integer root. The greatest common divisor of all its integer roots equals $1$. Prove that if the leading coefficient of the polynomial equals $1$ then the greatest common divisor of the other coefficients also equals $1$.
Let $P(x)$ be the unique polynomial of degree four for which $P(165) = 20$, and \[ P(42) = P(69) = P(96) = P(123) = 13. \] Compute $P(1) - P(2) + P(3) - P(4) + \dots + P(165)$.
[i]Proposed by Evan Chen[/i]
The polynomial $P(x)$ is cubic. What is the largest value of $k$ for which the polynomials $Q_{1}(x) = x^{2}+(k-29)x-k$ and $Q_{2}(x) = 2x^{2}+(2k-43)x+k$ are both factors of $P(x)$?
How many pairs of positive integers $(a,b)$ are there such that the roots of polynomial $x^2-ax-b$ are not greater than $5$?
$
\textbf{(A)}\ 40
\qquad\textbf{(B)}\ 50
\qquad\textbf{(C)}\ 65
\qquad\textbf{(D)}\ 75
\qquad\textbf{(E)}\ \text{None of the preceding}
$
[b]p1.[/b] Consider a cube with side length $2$. Take any one of its vertices and consider the three midpoints of the three edges emanating from that vertex. What is the distance from that vertex to the plane formed by those three midpoints?
[b]p2.[/b] Digits $H$, $M$, and $C$ satisfy the following relations where $\overline{ABC}$ denotes the number whose digits in base $10$ are $A$, $B$, and $C$.
$$\overline{H}\times \overline{H} = \overline{M}\times \overline{C} + 1$$
$$\overline{HH}\times \overline{H} = \overline{MC}\times \overline{C} + 1$$
$$\overline{HHH}\times \overline{H} = \overline{MCC}\times \overline{C} + 1$$
Find $\overline{HMC}$.
[b]p3.[/b] Two players play the following game on a table with fair two-sided coins. The first player starts with one, two, or three coins on the table, each with equal probability. On each turn, the player flips all the coins on the table and counts how many coins land heads up. If this number is odd, a coin is removed from the table. If this number is even, a coin is added to the table. A player wins when he/she removes the last coin on the table. Suppose the game ends. What is the probability that the first player wins?
[b]p4.[/b] Cyclic quadrilateral $[BLUE]$ has right $\angle E$. Let $R$ be a point not in $[BLUE]$. If $[BLUR] =[BLUE]$, $\angle ELB = 45^o$, and $\overline{EU} = \overline{UR}$, find $\angle RUE$.
[b]p5.[/b] There are two tracks in the $x, y$ plane, defined by the equations
$$y =\sqrt{3 - x^2}\,\,\, \text{and} \,\,\,y =\sqrt{4- x^2}$$
A baton of length $1$ has one end attached to each track and is allowed to move freely, but no end may be picked up or go past the end of either track. What is the maximum area the baton can sweep out?
[b]p6.[/b] For integers $1 \le a \le 2$, $1 \le b \le 10$,$ 1 \le c \le 12$, $1 \le d \le 18$, let $f(a, b, c, d)$ be the unique integer between $0$ and $8150$ inclusive that leaves a remainder of a when divided by $3$, a remainder of $b$ when divided by $11$, a remainder of $c$ when divided by $13$, and a remainder of $d$ when divided by $19$. Compute $$\sum_{a+b+c+d=23}f(a, b, c, d).$$
[b]p7.[/b] Compute $\cos ( \theta)$ if $$\sum^{\infty}_{n=0} \frac{ \cos (n\theta)}{3^n} = 1.$$
[b]p8.[/b] How many solutions does this equation $$\left(\frac{a+b}{2}\right)^2=\left(\frac{b+c}{2019}\right)^2$$ have in positive integers $a, b, c$ that are all less than $2019^2$?
[b]p9.[/b] Consider a square grid with vertices labeled $1, 2, 3, 4$ clockwise in that order. Fred the frog is jumping between vertices, with the following rules: he starts at the vertex label $1$, and at any given vertex he jumps to the vertex diagonally across from him with probability $\frac12$ and the vertices adjacent to him each with probability $\frac14$ . After $2019$ jumps, suppose the probability that the sum of the labels on the last two vertices he has visited is $3$ can be written as $2^{-m} -2^{-n}$ for positive integers $m,n$. Find $m + n$.
[b]p10.[/b] The base ten numeral system uses digits $0-9$ and each place value corresponds to a power of $10$. For example, $$2019 = 2 \cdot 10^3 + 0 \cdot 10^2 + 1 \cdot 10^1 + 9 \cdot 10^0.$$
Let $\phi =\frac{1 +\sqrt5}{2}$. We can define a similar numeral system, base , where we only use digits $0$ and $1$, and each place value corresponds to a power of . For example, $$11.01 = 1 \cdot \phi^1 + 1 \cdot \phi^0 + 0 \cdot \phi^{-1} + 1 \cdot \phi^{-2}$$
Note that base representations are not unique, because, for example, $100_{\phi} = 11_{\phi}$ . Compute the base $\phi$ representation of $7$ with the fewest number of $1$s.
[b]p11.[/b] Let $ABC$ be a triangle with $\angle BAC = 60^o$ and with circumradius $1$. Let $G$ be its centroid and $D$ be the foot of the perpendicular from $A$ to $BC$. Suppose $AG =\frac{\sqrt6}{3}$ . Find $AD$.
[b]p12.[/b] Let $f(a, b)$ be a function with the following properties for all positive integers $a \ne b$:
$$f(1, 2) = f(2, 1)$$
$$f(a, b) + f(b, a) = 0$$
$$f(a + b, b) = f(b, a) + b$$
Compute: $$\sum^{2019}_{i=1} f(4^i - 1, 2^i) + f(4^i + 1, 2^i)$$
[b]p13.[/b] You and your friends have been tasked with building a cardboard castle in the two-dimensional Cartesian plane. The castle is built by the following rules:
1. There is a tower of height $2^n$ at the origin.
2. From towers of height $2^i \ge 2$, a wall of length $2^{i-1}$ can be constructed between the aforementioned tower and a new tower of height $2^{i-1}$. Walls must be parallel to a coordinate axis, and each tower must be connected to at least one other tower by a wall.
If one unit of tower height costs $\$9$ and one unit of wall length costs $\$3$ and $n = 1000$, how many distinct costs are there of castles that satisfy the above constraints? Two castles are distinct if there exists a tower or wall that is in one castle but not in the other.
[b]p14.[/b] For $n$ digits, $(a_1, a_2, ..., a_n)$ with $0 \le a_i < n$ for $i = 1, 2,..., n$ and $a_1 \ne 0$ define $(\overline{a_1a_2 ... a_n})_n$ to be the number with digits $a_1$, $a_2$, $...$, $a_n$ written in base $n$. Let $S_n = \{(a_1, a_2, a_3,..., a_n)| \,\,\, (n + 1)| (\overline{a_1a_2 ... a_n})_n, a_1 \ge 1\}$ be the set of $n$-tuples such that $(\overline{a_1a_2 ... a_n})_n$ is divisible by $n + 1$.
Find all $n > 1$ such that $n$ divides $|S_n| + 2019$.
[b]p15.[/b] Let $P$ be the set of polynomials with degree $2019$ with leading coefficient $1$ and non-leading coefficients from the set $C = \{-1, 0, 1\}$. For example, the function $f = x^{2019} - x^{42} + 1$ is in $P$, but the functions $f = x^{2020}$, $f = -x^{2019}$, and $f = x^{2019} + 2x^{21}$ are not in $P$.
Define a [i]swap [/i]on a polynomial $f$ to be changing a term $ax^n$ to $bx^n$ where $b \in C$ and there are no terms with degree smaller than $n$ with coefficients equal to $a$ or $b$. For example, a swap from $x^{2019} + x^{17} - x^{15} + x^{10}$ to $x^{2019} + x^{17} - x^{15} - x^{10}$ would be valid, but the following swaps would not be valid:
$$x^{2019} + x^3 \,\,\, \text{to} \,\,\, x^{2019}$$
$$x^{2019} + x^3 \,\,\, \text{to} \,\,\, x^{2019} + x^3 + x^2$$
$$x^{2019} + x^2 + x + 1 \,\,\, \text{to} \,\,\, x^{2019} - x^2 - x - 1$$
Let $B$ be the set of polynomials in $P$ where all non-leading terms have the same coefficient. There are $p$ polynomials that can be reached from each element of $B$ in exactly $s$ swaps, and there exist $0$ polynomials that can be reached from each element of $B$ in less than $s$ swaps.
Compute $p \cdot s$, expressing your answer as a prime factorization.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Is there any polynomial $P(x)$ with degree $n$ such that $ \underbrace{P(...(P(x))...)}_{m\,\, times \,\, P}$ has all roots from $1,2,..., mn$ ?