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 $p$ and $q$ be prime numbers. The sequence $(x_n)$ is defined by $x_1 = 1$, $x_2 = p$ and $x_{n+1} = px_n - qx_{n-1}$ for all $n \geq 2$. Given that there is some $k$ such that $x_{3k} = -3$, find $p$ and $q$.
For complex number constant $c$, and real number constants $p$ and $q$, there exist three distinct complex values of $x$ that satisfy $x^3 + cx + p(1 + qi) = 0$. Suppose $c$, $p$, and $q$ were chosen so that all three complex roots $x$ satisfy $\tfrac{5}{6} \leq \tfrac{\mathrm{Im}(x)}{\mathrm{Re}(x)} \leq \tfrac{6}{5}$, where $\mathrm{Im}(x)$ and $\mathrm{Re}(x)$ are the imaginary and real part of $x$, respectively. The largest possible value of $|q|$ can be expressed as a common fraction $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
Let $ a,b,c,d$ be rational numbers with $ a>0$. If for every integer $ n\ge 0$, the number $ an^{3} \plus{}bn^{2} \plus{}cn\plus{}d$ is also integer, then the minimal value of $ a$ will be $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac{1}{2} \qquad\textbf{(C)}\ \frac{1}{6} \qquad\textbf{(D)}\ \text{Cannot be found} \qquad\textbf{(E)}\ \text{None}$
[i](5 pts)[/i] For some positive integer $n$, let $P(x)$ be an $n$th degree polynomial with real coefficients. [i]Note: you may cite, without proof, the Fundamental Theorem of Algebra, which states that every non-constant polynomial with complex coefficients has a complex root.[/i] (a) [i](2 pts)[/i] Show that there is an integer $k \ge \frac{n}{2}$ and a sequence of non-constant polynomials with real coefficients $Q_1(x), Q_2(x), \dots, Q_k(x)$ such that \[ P(x) = \prod_{i = 1}^k Q_i(x). \] (b) [i](1 pt)[/i] If $n$ is odd, then show that $P(x)$ has a real root. (c) [i](2 pts)[/i] Let $a$ and $b$ be real numbers, and let $m$ be a positive integer. If $\zeta = a + bi$ is a nonreal root of $P(x)$ of multiplicity $m$, then show that $\overline{\zeta} = a - bi$ is a nonreal root of $P(x)$ of multiplicity $m$.
Let $ \lfloor x \rfloor$ be the greatest integer less than or equal to $ x$. Then the number of real solutions to $ 4x^2 \minus{} 40 \lfloor x \rfloor \plus{} 51 \equal{} 0$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$
An irreducible polynomial is a not-constant polynomial that cannot be factored into product of two non-constant polynomials. Consider the following statements :- [b]Statement 1 :[/b] $p(x)$ be any monic irreducible polynomial with integer coefficients and degree $\geq 4$. Then $p(n)$ is a prime for at least one natural number $n$ [b]Statement 2 :[/b] $n^2+1$ is prime for infinitely many values of natural number $n$ Show that if [b]Statement 1[/b] is true then [b]Statement 2[/b] is also true
Let $\tau(n)$ denote the number of positive integer divisors of a positive integer $n$ (for example, $\tau(2022) = 8$). Given a polynomial $P(X)$ with integer coefficients, we define a sequence $a_1, a_2,\ldots$ of nonnegative integers by setting \[a_n =\begin{cases}\gcd(P(n), \tau (P(n)))&\text{if }P(n) > 0\\0 &\text{if }P(n) \leq0\end{cases}\] for each positive integer $n$. We then say the sequence [i]has limit infinity[/i] if every integer occurs in this sequence only finitely many times (possibly not at all). Does there exist a choice of $P(X)$ for which the sequence $a_1$, $a_2$, . . . has limit infinity? [i]Jovan Vuković[/i]
Let $ x,y,z$ be positive real numbers, show that $ \frac {xy}{z} \plus{} \frac {yz}{x} \plus{} \frac {zx}{y} > 2\sqrt [3]{x^3 \plus{} y^3 \plus{} z^3}.$
Prove that, for all integer $a>1$, the prime divisors of $5a^4-5a^2+1$ have the form $20k\pm1,k\in\mathbb{Z}$. [i]Proposed by Géza Kós.[/i]
Can you find three polynomials $P,Q,R$ of three variables $x,y,z$, providing the condition: a)$P(x-y+z)^3 + Q(y-z-1)^3 +R(z-2x+1)^3 = 1$ b)$P(x-y+z)^3 + Q(y-z-1)^3 +R(z-x+1)^3 = 1$ for all $x,y,z$?
Show that for every polynomial $W$ in three variables there exist polynomials $U$ and $V$ such that: $$W(x,y,z) = U(x,y,z)+V(x,y,z),$$ $$U(x,y,z) = U(y,x,z),$$ $$V(x,y,z) = -V(x,z,y).$$
The sequence $(Q_{n}(x))$ of polynomials is defined by $$Q_{1}(x)=1+x ,\; Q_{2}(x)=1+2x,$$ and for $m \geq 1 $ by $$Q_{2m+1}(x)= Q_{2m}(x) +(m+1)x Q_{2m-1}(x),$$ $$Q_{2m+2}(x)= Q_{2m+1}(x) +(m+1)x Q_{2m}(x).$$ Let $x_n$ be the largest real root of $Q_{n}(x).$ Prove that $(x_n )$ is an increasing sequence and that $\lim_{n\to \infty} x_n =0.$
Let $f$ be the unique polynomial of degree at most $2026$ such that for all $n \in \{1,2, 3, \ldots, 2027\},$ $$f(n)=\begin{cases} 1 & \text{if } $n$ \text{ is a perfect square}, \\ 0 & \text{otherwise.} \end{cases}$$ Suppose that $\tfrac{a}{b}$ is the coefficient of $x^{2025}$ in $f,$ where $a$ and $b$ are integers such that $\gcd(a,b)=1.$ Compute the unique integer $r$ between $0$ and $2026$ (inclusive) such that $a-rb$ is divisible by $2027.$ (Note that $2027$ is prime.)
$(USS 3)$ $(a)$ Prove that if $0 \le a_0 \le a_1 \le a_2,$ then $(a_0 + a_1x - a_2x^2)^2 \le (a_0 + a_1 + a_2)^2\left(1 +\frac{1}{2}x+\frac{1}{3}x^2+\frac{1}{2}x^3+x^4\right)$ $(b)$ Formulate and prove the analogous result for polynomials of third degree.
Let $A$ be a $n\times n$ diagonal matrix with characteristic polynomial $$(x-c_1)^{d_1}(x-c_2)^{d_2}\ldots (x-c_k)^{d_k}$$ where $c_1, c_2, \ldots, c_k$ are distinct (which means that $c_1$ appears $d_1$ times on the diagonal, $c_2$ appears $d_2$ times on the diagonal, etc. and $d_1+d_2+\ldots + d_k=n$). Let $V$ be the space of all $n\times n$ matrices $B$ such that $AB=BA$. Prove that the dimension of $V$ is $$d_1^2+d_2^2+\cdots + d_k^2$$
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$
We have $n$ points in the plane, no three on a line. We call $k$ of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed $k$ the number of $k$ good points is $c_k$. Show that the following sum is independent of the structure of points and only depends on $n$ : \[ \sum_{i=3}^n (-1)^i c_i \]
Let \(m\) be a positive integer. Find, in terms of \(m\), all polynomials \(P(x)\) with integer coefficients such that for every integer \(n\), there exists an integer \(k\) such that \(P(k)=n^m\). [i]Proposed by Raymond Feng[/i]
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}$
Determine the maximum possible number of distinct real roots of a polynomial $P(x)$ of degree $2012$ with real coefficients satisfying the condition \begin{align*} P(a)^3 + P(b)^3 + P(c)^3 \geq 3 P(a) P(b) P(c) \end{align*} for all real numbers $a,b,c \in \mathbb{R}$ with $a+b+c=0$
A function $ f$ is defined by $ f(z) \equal{} i\bar z$, where $ i \equal{}\sqrt{\minus{}\!1}$ and $ \bar z$ is the complex conjugate of $ z$. How many values of $ z$ satisfy both $ |z| \equal{} 5$ and $ f (z) \equal{} z$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$
Suppose that $F,G,H$ are polynomials of degree at most $2n+1$ with real coefficients such that: i) For all real $x$ we have $F(x)\le G(x)\le H(x)$. ii) There exist distinct real numbers $x_1,x_2,\ldots ,x_n$ such that $F(x_i)=H(x_i)\quad\text{for}\ i=1,2,3,\ldots ,n$. iii) There exists a real number $x_0$ different from $x_1,x_2,\ldots ,x_n$ such that $F(x_0)+H(x_0)=2G(x_0)$. Prove that $F(x)+H(x)=2G(x)$ for all real numbers $x$.
Find the remainder after division of the polynomial $x+x^3 +x^9 +x^{27} +x^{81} +x^{243}$ by $x-1$.
Find all triples $(a,b,c)$ of real numbers such that the following system holds: $$\begin{cases} a+b+c=\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \\a^2+b^2+c^2=\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}\end{cases}$$ [i]Proposed by Dorlir Ahmeti, Albania[/i]
A polynomial $c_dx^d+c_{d-1}x^{d-1}+\dots+c_1x+c_0$ with degree $d$ is [i]reflexive[/i] if there is an integer $n\ge d$ such that $c_i=c_{n-i}$ for every $0\le i\le n$, where $c_i=0$ for $i>d$. Let $\ell\ge 2$ be an integer and $p(x)$ be a polynomial with integer coefficients. Prove that there exist reflexive polynomials $q(x)$, $r(x)$ with integer coefficients such that \[(1+x+x^2+\dots+x^{\ell-1})p(x)=q(x)+x^\ell r(x)\]