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

A polynomial $ P(x)$ with integer coefficients is called good,if it can be represented as a sum of cubes of several polynomials (in variable $ x$) with integer coefficients.For example,the polynomials $ x^3 \minus{} 1$ and $ 9x^3 \minus{} 3x^2 \plus{} 3x \plus{} 7 \equal{} (x \minus{} 1)^3 \plus{} (2x)^3 \plus{} 2^3$ are good. a)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7$ good? b)Is the polynomial $ P(x) \equal{} 3x \plus{} 3x^7 \plus{} 3x^{2008}$ good? Justify your answers.
Let $P(x)$ be a polynomial with integer coefficients. Show that if $Q(x) = P(x) +12$ has at least six distinct integer roots, then $P(x)$ has no integer roots.
Let $r,s,t$ be the roots of $x^3+6x^2+7x+8$. Find $$(r^2+s+t)(s^2+t+r)(t^2+r+s).$$ [i]Proposed by Evan Chang (squareman), USA[/i]
[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$. [b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials. [b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? [b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $C=\bigcup_{N=1}^{\infty}C_N,$ where $C_N$ denotes the set of 'cosine polynomials' of the form \[f(x)=1+\sum_{n=1}^Na_n\cos(2\pi nx)\] for which: (i) $f(x)\ge 0$ for all real $x,$ and (ii) $a_n=0$ whenever $n$ is a multiple of $3.$ Determine the maximum value of $f(0)$ as $f$ ranges through $C,$ and prove that this maximum is attained.
$\mathbb{Z}[x]$ represents the set of all polynomials with integer coefficients. Find all functions $f:\mathbb{Z}[x]\rightarrow \mathbb{Z}[x]$ such that for any 2 polynomials $P,Q$ with integer coefficients and integer $r$, the following statement is true. \[P(r)\mid Q(r) \iff f(P)(r)\mid f(Q)(r).\] (We define $a|b$ if and only if $b=za$ for some integer $z$. In particular, $0|0$.) [i]Proposed by the4seasons.[/i]
Are there polynomials $P, Q$ with real coefficients, such that $P(P(x))\cdot Q(Q(x))$ has exactly $2023$ distinct real roots and $P(Q(x)) \cdot Q(P(x))$ has exactly $2024$ distinct real roots?
Find all non constant polynomials $P(x),Q(x)$ with real coefficients such that: $P((Q(x))^3)=xP(x)(Q(x))^3$
Are there such natural $n$, that exist polynomial of degree $n$ and with $n$ different real roots, and a) $P(x)P(x+1)=P(x^2)$ b) $P(x)P(x+1)=P(x^2+1)$
Determine the pairs of sets $X,Y\subset\mathbb{R}$ for which the following is true: if $f(x, y)$ is a function on $X\times Y{}$ such that for every $x\in X$ it is equal to a polynomial in $y$ on $Y$ and for every $y\in Y$ it is equal to a polynomial in $x$ on $X$ then $f$ is a bivariate polynomial on $X\times Y.$
Let $F(x_1,..., x_n)$ be a polynomial with real coefficients in $ n > 1$ “indeterminate” variables $x_1,..., x_n$. We say that $F$ is $n$-[i]alternating [/i]if for all integers $1 \le i < j \le n$, $$F(x_1,..., x_i,..., x_j,..., x_n) = - F(x_1,..., x_j,..., x_i,..., x_n),$$ i.e. swapping the order of indeterminates $x_i, x_j$ flips the sign of the polynomial. For example, $x^2_1x_2 - x^2_2x_1$ is $2$-alternating, whereas $x_1x_2x_3 +2x_2x_3$ is not $3$-alternating. [i]Note: two polynomials $P(x_1,..., x_n)$ and $Q(x_1,..., x_n)$ are considered equal if and only if each monomial constituent $ax^{k_1}_1... x^{k_n}_n$ of $P$ appears in $Q$ with the same coefficient $a$, and vice versa. This is equivalent to saying that $P(x_1,..., x_n) = 0$ if and only if every possible monomial constituent of $P$ has coefficient $0$. [/i] (1) Compute a $3$-alternating polynomial of degree $3$. (2) Prove that the degree of any nonzero $n$-alternating polynomial is at least ${n \choose 2}$.
Adamu and Afaafa choose, each in his turn, positive integers as coefficients of a polynomial of degree $n$. Adamu wins if the polynomial obtained has an integer root; otherwise, Afaafa wins. Afaafa plays first if $n$ is odd; otherwise Adamu plays first. Prove that: [list] [*] Adamu has a winning strategy if $n$ is odd. [*] Afaafa has a winning strategy if $n$ is even. [/list]
Find all polynomials $P$ with integer coefficients which satisfy the property that, for any relatively prime integers $a$ and $b$, the sequence $\{P (an + b) \}_{n \ge 1}$ contains an infinite number of terms, any two of which are relatively prime.
Find, with proof, a polynomial $f(x,y,z)$ in three variables, with integer coefficients, such that for all $a,b,c$ the sign of $f(a,b,c)$ (that is, positive, negative, or zero) is the same as the sign of $a+b\sqrt[3]{2}+c\sqrt[3]{4}$.
Given polynomial $P(x) = a_{0}x^{n}+a_{1}x^{n-1}+\dots+a_{n-1}x+a_{n}$. Put $m=\min \{ a_{0}, a_{0}+a_{1}, \dots, a_{0}+a_{1}+\dots+a_{n}\}$. Prove that $P(x) \ge mx^{n}$ for $x \ge 1$. [i]A. Khrabrov [/i]
Let $p$ be an odd prime number. Suppose $P$ and $Q$ are polynomials with integer coefficients such that $P(0)=Q(0)=1$, there is no nonconstant polynomial dividing both $P$ and $Q$, and \[ 1 + \cfrac{x}{1 + \cfrac{2x}{1 + \cfrac{\ddots}{1 + (p-1)x}}}=\frac{P(x)}{Q(x)}. \] Show that all coefficients of $P$ except for the constant coefficient are divisible by $p$, and all coefficients of $Q$ are [i]not[/i] divisible by $p$. [i]Andrew Gu[/i]
Define polynomials $f_{n}(x)$ for $n \geq 0$ by $f_{0}(x)=1, f_{n}(0)=0$ for $n \geq 1,$ and $$ \frac{d}{d x} f_{n+1}(x)=(n+1) f_{n}(x+1) $$ for $n \geq 0 .$ Find, with proof, the explicit factorization of $f_{100}(1)$ into powers of distinct primes.
Let $\alpha$, $\beta$ and $\gamma$ be the roots of the polynomial $2023x^3-2023x^2-1$. Find $$\frac{1}{\alpha^3}+\frac{1}{\beta^3}+\frac{1}{\gamma^3}$$. [i]Proposed by Andy Xu[/i]
[b]p1.[/b] Find the smallest positive integer $N$ such that $2N -1$ and $2N +1$ are both composite. [b]p2.[/b] Compute the number of ordered pairs of integers $(a, b)$ with $1 \le a, b \le 5$ such that $ab - a - b$ is prime. [b]p3.[/b] Given a semicircle $\Omega$ with diameter $AB$, point $C$ is chosen on $\Omega$ such that $\angle CAB = 60^o$. Point $D$ lies on ray $BA$ such that $DC$ is tangent to $\Omega$. Find $\left(\frac{BD}{BC} \right)^2$. [b]p4.[/b] Let the roots of $x^2 + 7x + 11$ be $r$ and $s$. If $f(x)$ is the monic polynomial with roots $rs + r + s$ and $r^2 + s^2$, what is $f(3)$? [b]p5.[/b] Regular hexagon $ABCDEF$ has side length $3$. Circle $\omega$ is drawn with $AC$ as its diameter. $BC$ is extended to intersect $\omega$ at point $G$. If the area of triangle $BEG$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a, b, c$ with $b$ squarefree and $gcd(a, c) = 1$, find $a + b + c$. [b]p6.[/b] Suppose that $x$ and $y$ are positive real numbers such that $\log_2 x = \log_x y = \log_y 256$. Find $xy$. [b]p7.[/b] Call a positive three digit integer $\overline{ABC}$ fancy if $\overline{ABC} = (\overline{AB})^2 - 11 \cdot \overline{C}$. Find the sum of all fancy integers. [b]p8.[/b] Let $\vartriangle ABC$ be an equilateral triangle. Isosceles triangles $\vartriangle DBC$, $\vartriangle ECA$, and $\vartriangle FAB$, not overlapping $\vartriangle ABC$, are constructed such that each has area seven times the area of $\vartriangle ABC$. Compute the ratio of the area of $\vartriangle DEF$ to the area of $\vartriangle ABC$. [b]p9.[/b] Consider the sequence of polynomials an(x) with $a_0(x) = 0$, $a_1(x) = 1$, and $a_n(x) = a_{n-1}(x) + xa_{n-2}(x)$ for all $n \ge 2$. Suppose that $p_k = a_k(-1) \cdot a_k(1)$ for all nonnegative integers $k$. Find the number of positive integers $k$ between $10$ and $50$, inclusive, such that $p_{k-2} + p_{k-1} = p_{k+1} - p_{k+2}$. [b]p10.[/b] In triangle $ABC$, point $D$ and $E$ are on line segments $BC$ and $AC$, respectively, such that $AD$ and $BE$ intersect at $H$. Suppose that $AC = 12$, $BC = 30$, and $EC = 6$. Triangle BEC has area 45 and triangle $ADC$ has area $72$, and lines CH and AB meet at F. If $BF^2$ can be expressed as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ with c squarefree and $gcd(a, b, d) = 1$, then find $a + b + c + d$. [b]p11.[/b] Find the minimum possible integer $y$ such that $y > 100$ and there exists a positive integer x such that $x^2 + 18x + y$ is a perfect fourth power. [b]p12.[/b] Let $ABCD$ be a quadrilateral such that $AB = 2$, $CD = 4$, $BC = AD$, and $\angle ADC + \angle BCD = 120^o$. If the sum of the maximum and minimum possible areas of quadrilateral $ABCD$ can be expressed as $a\sqrt{b}$ for positive integers $a$, $b$ with $b$ squarefree, then find $a + b$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Given a polynomial $P(x) = a_nx^n + a_{n-1}x^{n-1} + ...+ a_1x + a_0$ of real coefficients. Suppose that $P(x)$ has $n$ real roots (not necessarily distinct), and there exists a positive integer $k$ such that $a_k = a_{k-1} = 0$. Prove that $P(x)$ has a real root of multiplicity $k + 1$.
Let $ f(x)\equal{}\sum_{k\equal{}1}^n a_k x^k$ and $ g(x)\equal{}\sum_{k\equal{}1}^n \frac{a_k x^k}{2^k \minus{}1}$ be two polynomials with real coefficients. Let g(x) have $ 0,2^{n\plus{}1}$ as two of its roots. Prove That $ f(x)$ has a positive root less than $ 2^n$.
The function $f(x) = ax + b$ satisfies the following equalities: \begin{align*} f(f(f(1))) &= 2023, \\ f(f(f(0))) &= 1996. \end{align*} Find the value of $a$.
The polynomial $A(x) = x^2 + ax + b$ with integer coefficients has the following property: for each prime $p$ there is an integer $k$ such that $A(k)$ and $A(k + 1)$ are both divisible by $p$. Proof that there is an integer $m$ such that $A(m) = A(m + 1) = 0$.
Let $P(x)$ and $Q(x)$ be monic polynomials. Prove that the sum of the squares of the coeficients of the polynomial $P(x)Q(x)$ is not smaller than the sum of the squares of the free coefficients of $P(x)$ and $Q(x)$. [i]A. Galochkin, O. Ljashko[/i]
Determine all positive integers$ n$ such that $f_n(x,y,z) = x^{2n} + y^{2n} + z^{2n} - xy - yz - zx$ divides $g_n(x,y, z) = (x - y)^{5n} + (y -z)^{5n} + (z - x)^{5n}$, as polynomials in $x, y, z$ with integer coefficients.