This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 4275

Let us consider a polynomial $P(x)$ with integers coefficients satisfying $$P(-1)=-4,\ P(-3)=-40,\text{ and } P(-5)=-156.$$ What is the largest possible number of integers $x$ satisfying $$P(P(x))=x^2?$$
For each positive integer $n$, denote by $\omega(n)$ the number of distinct prime divisors of $n$ (for example, $\omega(1)=0$ and $\omega(12)=2$). Find all polynomials $P(x)$ with integer coefficients, such that whenever $n$ is a positive integer satisfying $\omega(n)>2023^{2023}$, then $P(n)$ is also a positive integer with \[\omega(n)\ge\omega(P(n)).\] Greece (Minos Margaritis - Iasonas Prodromidis)
The polynomial $ax^2 + bx + c$ crosses the $x$-axis at $x = 10$ and $x = -6$ and crosses the $y$-axis at $y = 10$. Compute $a + b + c$.
Suppose that $p>3$ is prime. Prove that the products of the primitive roots of $p$ between $1$ and $p-1$ is congruent to $1$ modulo $p$.
For each pair of integers \( j, k \geq 2 \), define the function \( f_{jk} : \mathbb{R} \to \mathbb{R} \) given by \[ f_{jk}(x) = 1 - (1 - x^j)^k. \] (a) Prove that for any integers \( j, k \geq 2 \), there exists a unique real number \( p_{jk} \in (0, 1) \) such that \( f_{jk}(p_{jk}) = p_{jk} \). Furthermore, defining \( \lambda_{jk} := f'_{jk}(p_{jk}) \), prove that \( \lambda_{jk} > 1 \). (b) Prove that \( p^j_{jk} = 1 - p_{kj} \) for any integers \( j, k \geq 2 \). (c) Prove that \( \lambda_{jk} = \lambda_{kj} \) for any integers \( j, k \geq 2 \).
Let $\Gamma$ consist of all polynomials in $x$ with integer coefficients. For $f$ and $g$ in $\Gamma$ and $m$ a positive integer, let $f \equiv g \pmod{m}$ mean that every coefficient of $f-g$ is an integral multiple of $m$. Let $n$ and $p$ be positive integers with $p$ prime. Given that $f,g,h,r$ and $s$ are in $\Gamma$ with $rf+sg\equiv 1 \pmod{p}$ and $fg \equiv h \pmod{p}$, prove that there exist $F$ and $G$ in $\Gamma$ with $F \equiv f \pmod{p}$, $G \equiv g \pmod{p}$, and $FG \equiv h \pmod{p^n}$.
Let $P_1(x) = ax^2 - bx - c$, $P_2(x) = bx^2 - cx - a$, $P_3(x) = cx^2 - ax - b$ be three quadratic polynomials. Suppose there exists a real number $\alpha$ such that $P_1(\alpha) = P_2(\alpha) = P_3(\alpha)$. Prove that $a = b = c$.
Denote by $F_0(x)$, $F_1(x)$, $\ldots$ the sequence of Fibonacci polynomials, which satisfy the recurrence $F_0(x)=1$, $F_1(x)=x$, and $F_n(x)=xF_{n-1}(x)+F_{n-2}(x)$ for all $n\geq 2$. It is given that there exist unique integers $\lambda_0$, $\lambda_1$, $\ldots$, $\lambda_{1000}$ such that \[x^{1000}=\sum_{i=0}^{1000}\lambda_iF_i(x)\] for all real $x$. For which integer $k$ is $|\lambda_k|$ maximized?
Find the remainder upon division by $x^2-1$ of the determinant $$\begin{vmatrix} x^3+3x & 2 & 1 & 0 \\ x^2+5x & 3 & 0 & 2 \\x^4 +x^2+1 & 2 & 1 & 3 \\x^5 +1 & 1 & 2 & 3 \\ \end{vmatrix}$$
Determine all non-constant monic polynomials $P(x)$ with integer coefficients such that no prime $p>10^{100}$ divides any number of the form $P(2^n)$
Describe the region $R$ consisting of the points $(a,b)$ of the cartesian plane for which both (possibly complex) roots of the polynomial $z^2+az+b$ have absolute value smaller than $1$.
Find all polynomials $f, g, h$ with real coefficients, such that $f(x)^2+(x+1)g(x)^2=(x^3+x)h(x)^2$
The degree of $(x^2+1)^4 (x^3+1)^3$ as a polynomial in $x$ is $\text{(A)} \ 5 \qquad \text{(B)} \ 7 \qquad \text{(C)} \ 12 \qquad \text{(D)} \ 17 \qquad \text{(E)} \ 72$
Find all polynomials $p(x)$ with real coefficients that satisfy $$4p(x^2) = 4(p(x))^2 + 4p(x)- 1$$
Do there exist $2000$ real numbers (not necessarily distinct) such that all of them are not zero and if we put any group containing $1000$ of them as the roots of a monic polynomial of degree $1000$, the coefficients of the resulting polynomial (except the coefficient of $x^{1000}$) be a permutation of the $1000$ remaining numbers? [i]Proposed by Morteza Saghafian[/i]
Which of the following four statements are true and which are false? a) If a polygon inscribed in a circle is equilateral, then it is also equiangular. b) If a polygon inscribed in a circle is equiangular, then it is also equilateral. c) If a polygon circumscribed to a circle is equilateral, then it is also equiangular. d) If a polygon circumscribed to a circle is equiangular, then it is also equilateral.
For any positive integer $n$, show that there exists a polynomial $P(x)$ of degree $n$ with integer coefficients such that $P(0),P(1), \ldots, P(n)$ are all distinct powers of $2$.
A polynomial $P(x)$ with integer coefficients takes odd values at $x = 0$ and $x = 1$. Prove that $P(x)$ has no integer roots.
Does every positive polynomial in two real variables attain its lower bound in the plane?
Let $ f, g$ and $ a$ be polynomials with real coefficients, $ f$ and $ g$ in one variable and $ a$ in two variables. Suppose \[ f(x) \minus{} f(y) \equal{} a(x, y)(g(x) \minus{} g(y)) \forall x,y \in \mathbb{R}\] Prove that there exists a polynomial $ h$ with $ f(x) \equal{} h(g(x)) \text{ } \forall x \in \mathbb{R}.$
Let $d\geq 13$ be an integer, and let $P(x) = a_dx^d + a_{d-1}x^{d-1} + \dots + a_1x+a_0$ be a polynomial of degree $d$ with complex coefficients such that $a_n = a_{d-n}$ for all $n\in\{0,1,\dots,d\}$. Prove that if $P$ has no double roots, then $P$ has two distinct roots $z_1$ and $z_2$ such that $|z_1-z_2|<1$.
Let $P=(x^4-40x^2+144)(x^3-16x)$. $a)$ Factor $P$ as a product of irreducible polynomials. $b)$ We write down the values of $P(10)$ and $P(91)$. What is the greatest common divisor of the two numbers?
Compute all real numbers $a$ such that the polynomial $x^4 + ax^3 + 1$ has exactly one real root.
Problem 2. Let $P(x) = ax^2 + bx + c$ where $a, b, c$ are real numbers. If $$P(a) = bc, \hspace{0.5cm} P(b) = ac, \hspace{0.5cm} P(c) = ab$$ then prove that $$(a - b)(b - c)(c - a)(a + b + c) = 0.$$