Found problems: 4275
The polynomial $f(x) = x^3 + rx^2 + sx + t$ has $r, s$, and $t$ as its roots (with multiplicity), where $f(1)$ is rational and $t \ne 0$. Compute $|f(0)|$.
Find all prime number $p$ such that there exists an integer-coefficient polynomial $f(x)=x^{p-1}+a_{p-2}x^{p-2}+…+a_1x+a_0$ that has $p-1$ consecutive positive integer roots and $p^2\mid f(i)f(-i)$, where $i$ is the imaginary unit.
Let $P(x) \in \mathbb {Z}[X]$ be a polynomial of degree $2016$ with no rational roots. Prove that there exists a polynomial $T(x) \in \mathbb {Z}[X]$ of degree $1395$ such that for all distinct (not necessarily real) roots of $P(x)$ like $(\alpha ,\beta):$
$$T(\alpha)-T(\beta) \not \in \mathbb {Q}$$
Note: $\mathbb {Q}$ is the set of rational numbers.
Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .
Find all possible values of $a\in \mathbb{R}$ and $n\in \mathbb{N^*}$ such that $f(x)=(x-1)^n+(x-2)^{2n+1}+(1-x^2)^{2n+1}+a$
is divisible by $\phi (x)=x^2-x+1$
Let $t$ and $n$ be fixed integers each at least $2$. Find the largest positive integer $m$ for which there exists a polynomial $P$, of degree $n$ and with rational coefficients, such that the following property holds: exactly one of \[ \frac{P(k)}{t^k} \text{ and } \frac{P(k)}{t^{k+1}} \] is an integer for each $k = 0,1, ..., m$.
[i]Proposed by Michael Kural[/i]
Suppose that $P(z), Q(z)$, and $R(z)$ are polynomials with real coefficients, having degrees $2$, $3$, and $6$, respectively, and constant terms $1$, $2$, and $3$, respectively. Let $N$ be the number of distinct complex numbers $z$ that satisfy the equation $P(z) \cdot Q(z)=R(z)$. What is the minimum possible value of $N$?
$\textbf{(A)}\: 0\qquad\textbf{(B)} \: 1\qquad\textbf{(C)} \: 2\qquad\textbf{(D)} \: 3\qquad\textbf{(E)} \: 5$
Find all functions $f: \mathbb{N} \mapsto \mathbb{N}$ so that for any positive integer $n$ and finite sequence of positive integers $a_0, \dots, a_n$, whenever the polynomial $a_0+a_1x+\dots+a_nx^n$ has at least one integer root, so does \[f(a_0)+f(a_1)x+\dots+f(a_n)x^n.\]
[i]Proposed by Sutanay Bhattacharya[/i]
Let $P(x) = x^4 + x^3 + x^2 + x + 1$. Show that there exist two non-constant polynomials $Q(y)$ and $R(y)$ with integer coefficients such that for all $Q(y) \cdot R(y)= P(5y^2)$ for all $y$ .
Let $P,Q,R$ be polynomials with real coefficients, satisfying $P^4+Q^4 = R^2$. Prove that there exist real numbers $p, q, r$ and a polynomial $S$ such that $P = pS, Q = qS$ and $R = rS^2$.
[hide="Variants"]Variants. (1) $P^4 + Q^4 = R^4$; (2) $\gcd(P,Q) = 1$ ; (3) $\pm P^4 + Q^4 = R^2$ or $R^4.$[/hide]
Suppose $p$ is a prime number and $a,b,c \in \mathbb Q^+$ are rational numbers;
[b]a)[/b] Prove that $\mathbb Q(\sqrt[p]{a}+\sqrt[p]{b})=\mathbb Q(\sqrt[p]{a},\sqrt[p]{b})$.
[b]b)[/b] If $\sqrt[p]{b} \in \mathbb Q(\sqrt[p]{a})$, prove that for a nonnegative integer $k$ we have $\sqrt[p]{\frac{b}{a^k}}\in \mathbb Q$.
[b]c)[/b] If $\sqrt[p]{a}+\sqrt[p]{b}+\sqrt[p]{c} \in \mathbb Q$, then prove that numbers $\sqrt[p]{a},\sqrt[p]{b}$ and $\sqrt[p]{c}$ are rational.
Suppose that there are $16$ variables $\{a_{i,j}\}_{0\leq i,j\leq 3}$, each of which may be $0$ or $1$. For how many settings of the variables $a_{i,j}$ do there exist positive reals $c_{i,j}$ such that the polynomial \[f(x,y)=\sum_{0\leq i,j\leq 3}a_{i,j}c_{i,j}x^iy^j\] $(x,y\in\mathbb{R})$ is bounded below?
There are $8$ different quadratic trinomials written on the board, among them there are no two that add up to a zero polynomial. It turns out that if we choose any two trinomials $g_1(x), g_2(X)$ from the board, then the remaining $6$ trinomials can be denoted as $g_3(x),g_4(x),\dots,g_8(x)$ so that all four polynomials $g_1(x)+g_2(x),g_3(x)+g_4(x),g_5(x)+g_6(x)$ and $g_7(x)+g_8(x)$ have a common root. Do all trinomials on the board necessarily have a common root?
[i]Proposed by S. Berlov[/i]
Let $f(t)$ be the cubic polynomial for $t$ such that $\cos 3x=f(\cos x)$ holds for all real number $x$.
Evaluate
\[\int_0^1 \{f(t)\}^2 \sqrt{1-t^2}dt\]
It can be shown that there exists a unique polynomial $P$ in two variables such that for all positive integers $m$ and $n,$ $$P(m,n)=\sum_{i=1}^m\sum_{i=1}^n (i+j)^7.$$ Compute $P(3,-3).$
The polynomial $x^8 +x^7$ is written on a blackboard. In a move, Peter can erase the polynomial $P(x)$ and write down $(x+1)P(x)$ or its derivative $P'(x).$ After a while, the linear polynomial $ax+b$ with $a\ne 0$ is written on the board. Prove that $a-b$ is divisible by $49.$
Let $P(x) = x^4 + ax^3 + bx^2 + cx + d$ and $Q(x) = x^2 + px + q$be two real polynomials. Suppose that there exista an interval $(r,s)$ of length greater than $2$ SUCH THAT BOTH $P(x)$ AND $Q(x)$ ARE nEGATIVE FOR $X \in (r,s)$ and both are positive for $x > s$ and $x<r$. Show that there is a real $x_0$ such that $P(x_0) < Q(x_0)$
Let $P(x), Q(x)$ be distinct polynomials of degree $2020$ with non-zero coefficients. Suppose that they have $r$ common real roots counting multiplicity and $s$ common coefficients. Determine the maximum possible value of $r + s$.
[i]Demetres Christofides, Cyprus[/i]
Let $F = \max_{1 \leq x \leq 3} |x^3 - ax^2 - bx - c|$. When $a$, $b$, $c$ run over all the real numbers, find the smallest possible value of $F$.
Determine all polynomials $P(x)$ with real coefficients such that $(x+1)P(x-1)-(x-1)P(x)$ is a constant polynomial.
Let $ f(x)$ be a $ n \minus{}$degree polynomial all of whose coefficients are equal to $ \pm 1$, and having $ x \equal{} 1$ as its $ m$ multiple root. If $ m\ge 2^k (k\ge 2,k\in N)$, then $ n\ge 2^{k \plus{} 1} \minus{} 1.$
Prove that there is no non-constant polynomial $P(x)$ with integer coefficients such that $P(n)$ is a prime number for all positive integers $n$.
Factor the polynomial $x^3+x^2z+xyz+y^2z-y^3$.
[b]p1.[/b] Two robots race on the plane from $(0, 0)$ to $(a, b)$, where $a$ and $b$ are positive real numbers with $a < b$. The robots move at the same constant speed. However, the first robot can only travel in directions parallel to the lines $x = 0$ or $y = 0$, while the second robot can only travel in directions parallel to the lines $y = x$ or $y = -x$. Both robots take the shortest possible path to $(a, b)$ and arrive at the same time. Find the ratio $\frac{a}{b}$ .
[b]p2.[/b] Suppose $x + \frac{1}{x} + y + \frac{1}{y} = 12$ and $x^2 + \frac{1}{x^2} + y^2 + \frac{1}{y^2} = 70$. Compute $x^3 + \frac{1}{x^3} + y^3 + \frac{1}{y^3}$.
[b]p3.[/b] Find the largest non-negative integer $a$ such that $2^a$ divides $$3^{2^{2018}}+ 3.$$
[b]p4.[/b] Suppose $z$ and $w$ are complex numbers, and $|z| = |w| = z \overline{w}+\overline{z}w = 1$. Find the largest possible value of $Re(z + w)$, the real part of $z + w$.
[b]p5.[/b] Two people, $A$ and $B$, are playing a game with three piles of matches. In this game, a move consists of a player taking a positive number of matches from one of the three piles such that the number remaining in the pile is equal to the nonnegative difference of the numbers of matches in the other two piles. $A$ and $B$ each take turns making moves, with $A$ making the first move. The last player able to make a move wins. Suppose that the three piles have $10$, $x$, and $30$ matches. Find the largest value of $x$ for which $A$ does not have a winning strategy.
[b]p6.[/b] Let $A_1A_2A_3A_4A_5A_6$ be a regular hexagon with side length $1$. For $n = 1$,$...$, $6$, let $B_n$ be a point on the segment $A_nA_{n+1}$ chosen at random (where indices are taken mod $6$, so $A_7 = A_1$). Find the expected area of the hexagon $B_1B_2B_3B_4B_5B_6$.
[b]p7.[/b] A termite sits at the point $(0, 0, 0)$, at the center of the octahedron $|x| + |y| + |z| \le 5$. The termite can only move a unit distance in either direction parallel to one of the $x$, $y$, or $z$ axes: each step it takes moves it to an adjacent lattice point. How many distinct paths, consisting of $5$ steps, can the termite use to reach the surface of the octahedron?
[b]p8.[/b] Let $$P(x) = x^{4037} - 3 - 8 \cdot \sum^{2018}_{n=1}3^{n-1}x^n$$
Find the number of roots $z$ of $P(x)$ with $|z| > 1$, counting multiplicity.
[b]p9.[/b] How many times does $01101$ appear as a not necessarily contiguous substring of $0101010101010101$? (Stated another way, how many ways can we choose digits from the second string, such that when read in order, these digits read $01101$?)
[b]p10.[/b] A perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. For example, $28$ is a perfect number because $1 + 2 + 4 + 7 + 14 = 28$. Let $n_i$ denote the ith smallest perfect number. Define $$f(x) =\sum_{i|n_x}\sum_{j|n_i}\frac{1}{j}$$ (where $\sum_{i|n_x}$ means we sum over all positive integers $i$ that are divisors of $n_x$). Compute $f(2)$, given there are at least $50 $perfect numbers.
[b]p11.[/b] Let $O$ be a circle with chord $AB$. The perpendicular bisector to $AB$ is drawn, intersecting $O$ at points $C$ and $D$, and intersecting $AB$ at the midpoint $E$. Finally, a circle $O'$ with diameter $ED$ is drawn, and intersects the chord $AD$ at the point $F$. Given $EC = 12$, and $EF = 7$, compute the radius of $O$.
[b]p12.[/b] Suppose $r$, $s$, $t$ are the roots of the polynomial $x^3 - 2x + 3$. Find $$\frac{1}{r^3 - 2}+\frac{1}{s^3 - 2}+\frac{1}{t^3 - 2}.$$
[b]p13.[/b] Let $a_1$, $a_2$,..., $a_{14}$ be points chosen independently at random from the interval $[0, 1]$. For $k = 1$, $2$,$...$, $7$, let $I_k$ be the closed interval lying between $a_{2k-1}$ and $a_{2k}$ (from the smaller to the larger). What is the probability that the intersection of $I_1$, $I_2$,$...$, $I_7$ is nonempty?
[b]p14.[/b] Consider all triangles $\vartriangle ABC$ with area $144\sqrt3$ such that $$\frac{\sin A \sin B \sin C}{
\sin A + \sin B + \sin C}=\frac14.$$ Over all such triangles $ABC$, what is the smallest possible perimeter?
[b]p15.[/b] Let $N$ be the number of sequences $(x_1,x_2,..., x_{2018})$ of elements of $\{1, 2,..., 2019\}$, not necessarily distinct, such that $x_1 + x_2 + ...+ x_{2018}$ is divisible by $2018$. Find the last three digits of $N$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$?
[i]Proposed by Andre Arslan[/i]