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

Give $P(x) = {x^{2022}} + {a_{2021}}{x^{2021}} + ... + {a_1}x + 1$ is a polynomial with real coefficents. a) Assume that $2021a_{2021}^2 - 4044{a_{2020}} < 0.$ Prove that: $P(x)$ can't have $2022$ real roots. b) Assume that $a_1^2 + a_2^2 + ... + a_{2021}^2 \le \frac{4}{{2021}}.$ Prove that: $P(x)\ge 0$, for all $x\in \mathbb{R}.$
Find all positive integers $n \geq 2$ such that for all integers $i,j$ that $ 0 \leq i,j\leq n$ , $i+j$ and $ {n\choose i}+ {n \choose j}$ have same parity. [i]Proposed by Mr.Etesami[/i]
Sequence of positive integers $\{x_k\}_{k\geq 1}$ is given such that $x_1=1$ and for all $n\geq 1$ we have $$x_{n+1}^2+P(n)=x_n x_{n+2}$$ where $P(x)$ is a polynomial with non-negative integer coefficients. Prove that $P(x)$ is the constant polynomial. Proposed by [i]Navid Safaei[/i]
Let $(a_n)$ defined by: $a_0=1, \; a_1=p, \; a_2=p(p-1)$, $a_{n+3}=pa_{n+2}-pa_{n+1}+a_n, \; \forall n \in \mathbb{N}$. Knowing that (i) $a_n>0, \; \forall n \in \mathbb{N}$. (ii) $a_ma_n>a_{m+1}a_{n-1}, \; \forall m \ge n \ge 0$. Prove that $|p-1| \ge 2$.
Solve the system equations \[\left\{\begin{array}{cc}x^{4}-y^{4}=240\\x^{3}-2y^{3}=3(x^{2}-4y^{2})-4(x-8y)\end{array}\right.\]
Let $P(x)$ be a polynomial of degree $n \ge 2$ with rational coefficients such that $P(x)$ has $n$ pairwise different real roots forming an arithmetic progression. Prove that among the roots of $P(x)$ there are two that are also the roots of some polynomial of degree $2$ with rational coefficients.
Let $f$ and $g$ be two polynomials with integer coefficients such that the leading coefficients of both the polynomials are positive. Suppose $\deg(f)$ is odd and the sets $\{f(a)\mid a\in \mathbb{Z}\}$ and $\{g(a)\mid a\in \mathbb{Z}\}$ are the same. Prove that there exists an integer $k$ such that $g(x)=f(x+k)$.
[b]p1.[/b] Compute $2017 + 7201 + 1720 + 172$. [b]p2. [/b]A number is called [i]downhill [/i]if its digits are distinct and in descending order. (For example, $653$ and $8762$ are downhill numbers, but $97721$ is not.) What is the smallest downhill number greater than 86432? [b]p3.[/b] Each vertex of a unit cube is sliced off by a planar cut passing through the midpoints of the three edges containing that vertex. What is the ratio of the number of edges to the number of faces of the resulting solid? [b]p4.[/b] In a square with side length $5$, the four points that divide each side into five equal segments are marked. Including the vertices, there are $20$ marked points in total on the boundary of the square. A pair of distinct points $A$ and $B$ are chosen randomly among the $20$ points. Compute the probability that $AB = 5$. [b]p5.[/b] A positive two-digit integer is one less than five times the sum of its digits. Find the sum of all possible such integers. [b]p6.[/b] Let $$f(x) = 5^{4^{3^{2^{x}}}}.$$ Determine the greatest possible value of $L$ such that $f(x) > L$ for all real numbers $x$. [b]p7.[/b] If $\overline{AAAA}+\overline{BB} = \overline{ABCD}$ for some distinct base-$10$ digits $A, B, C, D$ that are consecutive in some order, determine the value of $ABCD$. (The notation $\overline{ABCD}$ refers to the four-digit integer with thousands digit $A$, hundreds digit $B$, tens digit $C$, and units digit $D$.) [b]p8.[/b] A regular tetrahedron and a cube share an inscribed sphere. What is the ratio of the volume of the tetrahedron to the volume of the cube? [b]p9.[/b] Define $\lfloor x \rfloor$ as the greatest integer less than or equal to x, and ${x} = x - \lfloor x \rfloor$ as the fractional part of $x$. If $\lfloor x^2 \rfloor =2 \lfloor x \rfloor$ and $\{x^2\} =\frac12 \{x\}$, determine all possible values of $x$. [b]p10.[/b] Find the largest integer $N > 1$ such that it is impossible to divide an equilateral triangle of side length $ 1$ into $N$ smaller equilateral triangles (of possibly different sizes). [b]p11.[/b] Let $f$ and $g$ be two quadratic polynomials. Suppose that $f$ has zeroes $2$ and $7$, $g$ has zeroes $1$ and $ 8$, and $f - g$ has zeroes $4$ and $5$. What is the product of the zeroes of the polynomial $f + g$? [b]p12.[/b] In square $PQRS$, points $A, B, C, D, E$, and $F$ are chosen on segments $PQ$, $QR$, $PR$, $RS$, $SP$, and $PR$, respectively, such that $ABCDEF$ is a regular hexagon. Find the ratio of the area of $ABCDEF$ to the area of $PQRS$. [b]p13.[/b] For positive integers $m$ and $n$, define $f(m, n)$ to be the number of ways to distribute $m$ identical candies to $n$ distinct children so that the number of candies that any two children receive differ by at most $1$. Find the number of positive integers n satisfying the equation $f(2017, n) = f(7102, n)$. [b]p14.[/b] Suppose that real numbers $x$ and $y$ satisfy the equation $$x^4 + 2x^2y^2 + y^4 - 2x^2 + 32xy - 2y^2 + 49 = 0.$$ Find the maximum possible value of $\frac{y}{x}$. [b]p15.[/b] A point $P$ lies inside equilateral triangle $ABC$. Let $A'$, $B'$, $C'$ be the feet of the perpendiculars from $P$ to $BC, AC, AB$, respectively. Suppose that $PA = 13$, $PB = 14$, and $PC = 15$. Find the area of $A'B'C'$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Consider all polynomials of a complex variable, $P(z)=4z^4+az^3+bz^2+cz+d$, where $a, b, c$ and $d$ are integers, $0 \le d \le c \le b \le a \le 4$, and the polynomial has a zero $z_0$ with $|z_0|=1$. What is the sum of all values $P(1)$ over all the polynomials with these properties? $ \textbf{(A)}\ 84\qquad\textbf{(B)}\ 92\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 108 \qquad\textbf{(E)}\ 120 $
Find all cubic polynomials $x^3 +ax^2 +bx+c$ admitting the rational numbers $a$, $b$ and $c$ as roots.
Let $ P$ be a polynomial with integer coefficients such that there are two distinct integers at which $ P$ takes coprime values. Show that there exists an infinite set of integers, such that the values $ P$ takes at them are pairwise coprime.
Let $n$ be a positive integer and $m = \frac{(n+1)(n+2)}{2}$. In coordinate plane, there are $n$ distinct lines $L_1, L_2, \ldots, L_n$ and $m$ distinct points $A_1, A_2, \ldots, A_m$, satisfying the following conditions: [b][i]i)[/i][/b] Any two lines are non-parallel. [b][i]ii)[/i][/b] Any three lines are non-concurrent. [b][i]iii)[/i][/b] Only $A_1$ does not lies on any line $L_k$, and there are exactly $k + 1$ points $A_j$'s that lie on line $L_k$ $(k = 1, 2, \ldots, n).$ Prove that there exist a unique polynomial $p(x, y)$ with degree $n$ satisfying $p(A_1) = 1$ and $p(A_j) = 0$ for $j = 2, 3, \ldots, m.$
Suppose you are given a fair coin and a sheet of paper with the polynomial $x^m$ written on it. Now for each toss of the coin, if heads show up, you must erase the polynomial $x^r$ (where $r$ is going to change with time - initially it is $m$) written on the paper and replace it with $x^{r-1}$. If tails show up, replace it with $x^{r+1}$. What is the expected value of the polynomial I get after $m$ such tosses? (Note: this is a different concept from the most probable value)
Let $n \geq 4$ be a natural number. The polynomials $x^{n+1} + x$, $x^n$, and $x^{n-3}$ are written on the board. In one move, you can choose two polynomials $f(x)$ and $g(x)$ (not necessarily distinct) and add the polynomials $f(x)g(x)$, $f(x) + g(x)$, and $f(x) - g(x)$ to the board. Find all $n$ such that after a finite number of operations, the polynomial $x$ can be written on the board.
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]
Prime $p=n^2 +1$ is given. Find the sets of solutions to the below equation: \[x^2 - (n^2 +1)y^2 = n^2.\] (25 points)
Find the smallest possible $\alpha\in \mathbb{R}$ such that if $P(x)=ax^2+bx+c$ satisfies $|P(x)|\leq1 $ for $x\in [0,1]$ , then we also have $|P'(0)|\leq \alpha$.
Positive real numbers $a$ and $b$ satisfy the following conditions: the function $f(x)=x^3+ax^2+2bx-1$ has three different real roots, while the function $g(x)=2x^2+2bx+a$ doesn't have real roots. Prove that $a-b>1$. [i](V. Karamzin)[/i]
Let $ n, k$ be positive integers and suppose that the polynomial $ x^{2k}\minus{}x^k\plus{}1$ divides $ x^{2n}\plus{}x^n\plus{}1$. Prove that $ x^{2k}\plus{}x^k\plus{}1$ divides $ x^{2n}\plus{}x^n\plus{}1$.
Let $p$ be an odd prime number, and let $\mathbb{F}_p$ denote the field of integers modulo $p$. Let $\mathbb{F}_p[x]$ be the ring of polynomials over $\mathbb{F}_p$, and let $q(x) \in \mathbb{F}_p[x]$ be given by $q(x) = \sum_{k=1}^{p-1} a_k x^k$ where $a_k = k^{(p-1)/2}$ mod $p$. Find the greatest nonnegative integer $n$ such that $(x-1)^n$ divides $q(x)$ in $\mathbb{F}_p[x]$.
For each polynomial $p(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$ we define it's derivative as this and we show it by $p'(x)$: \[p'(x)=na_nx^{n-1}+(n-1)a_{n-1}x^{n-2}+...+2a_2x+a_1\] a) For each two polynomials $p(x)$ and $q(x)$ prove that:(3 points) \[(p(x)q(x))'=p'(x)q(x)+p(x)q'(x)\] b) Suppose that $p(x)$ is a polynomial with degree $n$ and $x_1,x_2,...,x_n$ are it's zeros. prove that:(3 points) \[\frac{p'(x)}{p(x)}=\sum_{i=1}^{n}\frac{1}{x-x_i}\] c) $p(x)$ is a monic polynomial with degree $n$ and $z_1,z_2,...,z_n$ are it's zeros such that: \[|z_1|=1, \quad \forall i\in\{2,..,n\}:|z_i|\le1\] Prove that $p'(x)$ has at least one zero in the disc with length one with the center $z_1$ in complex plane. (disc with length one with the center $z_1$ in complex plane: $D=\{z \in \mathbb C: |z-z_1|\le1\}$)(20 points)
Let $f(x)$ be a polynomial with integer coefficients. Define a sequence $a_0, a_1, \cdots $ of integers such that $a_0=0$ and $a_{n+1}=f(a_n)$ for all $n \ge 0$. Prove that if there exists a positive integer $m$ for which $a_m=0$ then either $a_1=0$ or $a_2=0$.
Let $p$ and $a$ be positive integer numbers having no common divisors except of $1$. Prove that $p$ is prime if and only if all the coefficients of the polynomial \[ F(x) = (x-a)^p - (x^p - a) \] are divisible by $p$.
The Fibonacci numbers $F_1, F_2, F_3, \ldots$ are defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for each integer $n \ge 1$. Let $P$ be the unique polynomial of least degree for which $P(n) = F_n$ for all integers $1 \le n \le 10$. Compute the integer $m$ for which \[P(100) - \sum_{k=11}^{98} P(k) = \frac{m}{10} \dbinom{98}{9} + 144.\] [i]Proposed by Michael Tang[/i]
Let $C[-1,1]$ be the space of continuous real functions on the interval $[-1,1]$ with the usual supremum norm, and let $V{}$ be a closed, finite-codimensional subspace of $C[-1,1].$ Prove that there exists a polynomial $p\in V$ with norm at most one, which satisfies $p'(0)>2023.$