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(x)$ be a monic polynomial of degree $100$ with $100$ distinct noninteger real roots. Suppose that each of polynomials $P(2x^2 - 4x)$ and $P(4x - 2x^2)$ has exactly $130$ distinct real roots. Prove that there exist non constant polynomials $A(x),B(x)$ such that $A(x)B(x) = P(x)$ and $A(x) = B(x)$ has no root in $(-1.1)$
Done with her new problems, Wendy takes a break from math. Still without any fresh reading material, she feels a bit antsy. She starts to feel annoyed that Michael's loose papers clutter the family van. Several of them are ripped, and bits of paper litter the floor. Tired of trying to get Michael to clean up after himself, Wendy spends a couple of minutes putting Michael's loose papers in the trash. "That seems fair to me," confirms Hannah encouragingly. While collecting Michael's scraps, Wendy comes across a corner of a piece of paper with part of a math problem written on it. There is a monic polynomial of degree $n$, with real coefficients. The first two terms after $x^n$ are $a_{n-1}x^{n-1}$ and $a_{n-2}x^{n-2}$, but the rest of the polynomial is cut off where Michael's page is ripped. Wendy barely makes out a little of Michael's scribbling, showing that $a_{n-1}=-a_{n-2}$. Wendy deciphers the goal of the problem, which is to find the sum of the squares of the roots of the polynomial. Wendy knows neither the value of $n$, nor the value of $a_{n-1}$, but still she finds a [greatest] lower bound for the answer to the problem. Find the absolute value of that lower bound.
If $a_0 , a_1 ,\ldots, a_n$ are real number satisfying $$ \frac{a_0 }{1} + \frac{a_1 }{2} + \ldots + \frac{a_n }{n+1}=0,$$ show that the equation $a_n x^n + \ldots +a_1 x+a_0 =0$ has at least one real root.
The sum of all real $x$ such that $(2^{x} - 4)^{3} + (4^{x} - 2)^{3} = (4^{x} + 2^{x} - 6)^{3}$ is $ \textbf{(A)}\ 3/2\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 5/2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 7/2 $
Let $f: \mathbb{Z}^2\to \mathbb{R}$ be a function. It is known that for any integer $C$ the four functions of $x$ \[f(x,C), f(C,x), f(x,x+C), f(x, C-x)\] are polynomials of degree at most $100$. Prove that $f$ is equal to a polynomial in two variables and find its maximal possible degree. [i]Remark: The degree of a bivariate polynomial $P(x,y)$ is defined as the maximal value of $i+j$ over all monomials $x^iy^j$ appearing in $P$ with a non-zero coefficient.[/i]
If $a,b,c,d$ are Distinct Real no. such that $a = \sqrt{4+\sqrt{5+a}}$ $b = \sqrt{4-\sqrt{5+b}}$ $c = \sqrt{4+\sqrt{5-c}}$ $d = \sqrt{4-\sqrt{5-d}}$ Then $abcd = $
Prove that there exists an infinity of irrational numbers $x,y$ such that the number $x+y=xy$ is a nonnegative integer.
Let $P(x)$ be a polynomial with degree $2017$ such that $P(k) =\frac{k}{k + 1}$, $\forall k = 0, 1, 2, ..., 2017$ . Calculate $P(2018)$.
Let $ f(x) $ be a polynomial, $ n $ - a natural number. Prove that if $ f(x^{n}) $ is divisible by $ x-1 $, then it is also divisible by $ x^{n-1} + x^{n-2} + \ldots + x + $1.
For each integer $n \ge 1$, prove that there is a polynomial $P_{n}(x)$ with rational coefficients such that $x^{4n}(1-x)^{4n}=(1+x)^{2}P_{n}(x)+(-1)^{n}4^{n}$. Define the rational number $a_{n}$ by \[a_{n}= \frac{(-1)^{n-1}}{4^{n-1}}\int_{0}^{1}P_{n}(x) \; dx,\; n=1,2, \cdots.\] Prove that $a_{n}$ satisfies the inequality \[\left\vert \pi-a_{n}\right\vert < \frac{1}{4^{5n-1}}, \; n=1,2, \cdots.\]
Find all integers $n \ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] [*]$m > 1$ and $\gcd(m,n) = 1$; [*]the numbers $P(0)$, $P^2(0)$, $\ldots$, $P^{m-1}(0)$ are not divisible by $n$; and [*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc. [i]Carl Schildkraut[/i]
For every polynomial of degree 45 with coefficients $1,2,3, \ldots, 46$ (in some order) Tom has listed all its distinct real roots. Then he increased each number in the list by 1 . What is now greater: the amount of positive numbers or the amount of negative numbers? Alexey Glebov
find all real coefficient polynomial $ P(x)$ such that $ P(x)P(x\plus{}1)\equal{}P(x^2\plus{}x\plus{}1)$ for all $ x$
Which of the polynomials, $(1+x^2 -x^3)^{1000}$ or $(1-x^2 +x^3)^{1000}$, has the greater coefficient of $x^{20}$ after expansion and collecting the terms?
[b]p1.[/b] How many lines of symmetry does a square have? [b]p2.[/b] Compute$ 1/2 + 1/6 + 1/12 + 1/4$. [b]p3.[/b] What is the maximum possible area of a rectangle with integer side lengths and perimeter $8$? [b]p4.[/b] Given that $1$ printer weighs $400000$ pennies, and $80$ pennies weighs $2$ books, what is the weight of a printer expressed in books? [b]p5.[/b] Given that two sides of a triangle are $28$ and $3$ and all three sides are integers, what is the sum of the possible lengths of the remaining side? [b]p6.[/b] What is half the sum of all positive integers between $1$ and $15$, inclusive, that have an even number of positive divisors? [b]p7.[/b] Austin the Snowman has a very big brain. His head has radius $3$, and the volume of his torso is one third of his head, and the volume of his legs combined is one third of his torso. If Austin's total volume is $a\pi$ where $a$ is an integer, what is $a$? [b]p8.[/b] Neethine the Kiwi says that she is the eye of the tiger, a fighter, and that everyone is gonna hear her roar. She is standing at point $(3, 3)$. Neeton the Cat is standing at $(11,18)$, the farthest he can stand from Neethine such that he can still hear her roar. Let the total area of the region that Neeton can stand in where he can hear Neethine's roar be $a\pi$ where $a$ is an integer. What is $a$? [b]p9.[/b] Consider $2018$ identical kiwis. These are to be divided between $5$ people, such that the first person gets $a_1$ kiwis, the second gets $a_2$ kiwis, and so forth, with $a_1 \le a_2 \le a_3 \le a_4 \le a_5$. How many tuples $(a_1, a_2, a_3, a_4, a_5)$ can be chosen such that they form an arithmetic sequence? [b]p10.[/b] On the standard $12$ hour clock, each number from $1$ to $12$ is replaced by the sum of its divisors. On this new clock, what is the number of degrees in the measure of the non-reflex angle between the hands of the clock at the time when the hour hand is between $7$ and $6$ while the minute hand is pointing at $15$? [b]p11.[/b] In equiangular hexagon $ABCDEF$, $AB = 7$, $BC = 3$, $CD = 8$, and $DE = 5$. The area of the hexagon is in the form $\frac{a\sqrt{b}}{c}$ with $b$ square free and $a$ and $c$ relatively prime. Find $a+b+c$ where $a, b,$ and $c$ are integers. [b]p12.[/b] Let $\frac{p}{q} = \frac15 + \frac{2}{5^2} + \frac{3}{5^3} + ...$ . Find $p + q$, where $p$ and $q$ are relatively prime positive integers. [b]p13.[/b] Two circles $F$ and $G$ with radius $10$ and $4$ respectively are externally tangent. A square $ABMC$ is inscribed in circle $F$ and equilateral triangle $MOP$ is inscribed in circle $G$ (they share vertex $M$). If the area of pentagon $ABOPC$ is equal to $a + b\sqrt{c}$, where $a$, $b$, $c$ are integers $c$ is square free, then find $a + b + c$. [b]p14.[/b] Consider the polynomial $P(x) = x^3 + 3x^2 + ax + 8$. Find the sum of all integer $a$ such that the sum of the squares of the roots of $P(x)$ divides the sum of the coecients of $P(x)$. [b]p15.[/b] Nithin and Antonio play a number game. At the beginning of the game, Nithin picks a prime $p$ that is less than $100$. Antonio then tries to find an integer $n$ such that $n^6 + 2n^5 + 2n^4 + n^3 + (n^2 + n + 1)^2$ is a multiple of $p$. If Antonio can find such a number n, then he wins, otherwise, he loses. Nithin doesn't know what he is doing, and he always picks his prime randomly while Antonio always plays optimally. The probability of Antonio winning is $a/b$ where $a$ and $b$ are relatively prime positive integers. Find$a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Prove that the polynomial $P(x) = x^5-x+a$ is irreducible over $\mathbb{Z}$ if $5 \nmid a$.
Let $n$ be an even positive integer. Let $p$ be a monic, real polynomial of degree $2 n$; that is to say, $p(x)=$ $x^{2 n}+a_{2 n-1} x^{2 n-1}+\cdots+a_1 x+a_0$ for some real coefficients $a_0, \ldots, a_{2 n-1}$. Suppose that $p(1 / k)=k^2$ for all integers $k$ such that $1 \leq|k| \leq n$. Find all other real numbers $x$ for which $p(1 / x)=x^2$.
If $f$ is a polynomial, and $f(-2)=3$, $f(-1)=-3=f(1)$, $f(2)=6$, and $f(3)=5$, then what is the minimum possible degree of $f$?
Prove that there is no polynomial $P$ with integer coefficients such that $P\left(\sqrt[3]5+\sqrt[3]{25}\right)=5+\sqrt[3]5$.
The polynomial $1976(x+x^2+ \cdots +x^n)$ is decomposed into a sum of polynomials of the form $a_1x + a_2x^2 + \cdots + a_nx^n$, where $a_1, a_2, \ldots , a_n$ are distinct positive integers not greater than $n$. Find all values of $n$ for which such a decomposition is possible.
Let $k > 1$ be a fixed natural number. Find all polynomials $P(x)$ satisfying the condition $P(x^k) = (P(x))^k$ for all real numbers $x$.
Given integer $n$, let $W_n$ be the set of complex numbers of the form $re^{2qi\pi}$, where $q$ is a rational number so that $q_n \in Z$ and $r$ is a real number. Suppose that p is a polynomial of degree $ \ge 2$ such that there exists a non-constant function $f : W_n \to C$ so that $p(f(x))p(f(y)) = f(xy)$ for all $x, y \in W_n$. If $p$ is the unique monic polynomial of lowest degree for which such an $f$ exists for $n = 65$, find $p(10)$.
We call the polynomial $P (x)$ simple if the coefficient of each of its members belongs to the set $\{-1, 0, 1\}$. Let $n$ be a positive integer, $n> 1$. Find the smallest possible number of terms with a non-zero coefficient in a simple $n$-th degree polynomial with all values at integer places are divisible by $n$.
Given a polynomial $P\in \mathbb{Z}[X]$ of degree $k$, show that there always exist $2d$ distinct integers $x_1, x_2, \cdots x_{2d}$ such that $$P(x_1)+P(x_2)+\cdots P(x_{d})=P(x_{d+1})+P(x_{d+2})+\cdots + P(x_{2d})$$ for some $d\le k+1$. [Extra: Is this still true if $d\le k$? (Of course false for linear polynomials, but what about higher degree?)]
Let $p(x)$ be a polynomial with integer coefficients, and let $a, b$ and $c$ be three distinct integers. Show that it is not possible to have $p(a) = b$, $p(b) = c$, and $p(c) = a$.