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

If $\tan{\alpha}$ and $\tan{\beta}$ are the roots of $x^2 - px + q = 0$, and $\cot{\alpha}$ and $\cot{\beta}$ are the roots of $x^2 - rx + s = 0$, then $rs$ is necessarily $\text{(A)} \ pq \qquad \text{(B)} \ \frac{1}{pq} \qquad \text{(C)} \ \frac{p}{q^2} \qquad \text{(D)} \ \frac{q}{p^2} \qquad \text{(E)} \ \frac{p}{q}$
Given a polynomial $P(x)=x^4+3x^2-9x+1$. Calculate $P(\alpha^2+\alpha+1)$ where\[ \alpha=\sqrt[3]{\frac{1+\sqrt{5}}{2}}+\sqrt[3]{\frac{1-\sqrt{5}}{2}} \]
Determine all polynomials $P(x)$ with integer coefficients such that $P(n)$ is divisible by $\sigma(n)$ for all positive integers $n$. (As usual, $\sigma(n)$ denotes the sum of all positive divisors of $n$.)
For a given positive integer $n(\ge 2)$, find maximum positive integer $A$ such that there exists $P \in \mathbb{Z}[x]$ with degree $n$ that satisfies the following two conditions. [list] [*] For any $1 \le k \le A$, it satisfies that $A \mid P(k)$, and [*] $P(0)= 0$ and the coefficient of the first term of $P$ is $1$, which means that $P(x)$ is in the following form where $c_2, c_3, \cdots, c_n$ are all integers and $c_n \neq 0$. $$P(x) = c_nx^n + c_{n-1}x^{n-1}+\dots+c_2x^2+x$$ [/list]
Call a polynomial $f$ with positive integer coefficients \textit{triangle-compatible} if any three coefficients of $f$ satisfy the triangle inequality. For instance, $3x^3 + 4x^2 + 6x + 5$ is triangle-compatible, but $3x^3 + 3x^2 + 6x + 5$ is not. Given that $f$ is a degree $20$ triangle-compatible polynomial with $-20$ as a root, what is the least possible value of $f(1)$? [i] Note: this problem is also Premier #3 [/i]
Find all positive integers $k$, so that there exists a polynomial $f(x)$ with rational coefficients, such that for all sufficiently large $n$, $$f(n)=\text{lcm}(n+1, n+2, \ldots, n+k).$$
Call a polynomial positive reducible if it can be written as a product of two nonconstant polynomials with positive real coefficients. Let $ f(x)$ be a polynomial with $ f(0)\not\equal{}0$ such that $ f(x^n)$ is positive reducible for some natural number $ n$. Prove that $ f(x)$ itself is positive reducible. [L. Redei]
Find all polynomials $P$ with real coefficients having no repeated roots, such that for any complex number $z$, the equation $zP(z) = 1$ holds if and only if $P(z-1)P(z + 1) = 0$. Remark: Remember that the roots of a polynomial are not necessarily real numbers.
For each nonnegative integer $k$, let $d(k)$ denote the number of $1$'s in the binary expansion of $k$. Let $m$ be a positive integer. Express $$\sum_{k=0}^{2^m-1}(-1)^{d(k)}k^m$$in the form $(-1)^ma^{f(m)}g(m)!$, where $a$ is an integer and $f$ and $g$ are polynomials.
Let $P(x)$ be a polynomial with real coefficients such that $P(12)=20$ and \[ (x-1) \cdot P(16x)= (8x-1) \cdot P(8x) \] holds for all real numbers $x$. Compute the remainder when $P(2014)$ is divided by $1000$. [i]Proposed by Alex Gu[/i]
Find all second degree polynomial $d(x)=x^{2}+ax+b$ with integer coefficients, so that there exists an integer coefficient polynomial $p(x)$ and a non-zero integer coefficient polynomial $q(x)$ that satisfy: \[\left( p(x) \right)^{2}-d(x) \left( q(x) \right)^{2}=1, \quad \forall x \in \mathbb R.\]
Given are two distinct monic cubics $F(x)$ and $G(x)$. All roots of the equations $F(x)=0$, $G(x)=0$ and $F(x)=G(x)$ are written down. There are eight numbers written. Prove that the greatest of them and the least of them cannot be both roots of the polynomial $F(x)$.
Find all nonzero polynomials $P(x)$ with real coefficents, that satisfies $$P(x)^3+3P(x)^2=P(x^3)-3P(-x)$$ for all real numbers $x$
Let \[p(x) = a_n x^n + a_{n - 1} x^{n - 1} + \dots + a_1 x + a_0\] and \[q(x) = b_m x^m + a_{m - 1} x^{m - 1} + \dots + b_1 x + b_0\] be two polynomials with integer coefficients. Suppose that all the coefficients of the product $p(x) \cdot q(x)$ are even but not all of them are divisible by 4. Show that one of $p(x)$ and $q(x)$ has all even coefficients and the other has at least one odd coefficient.
Given $a$, $b$ are positive integers greater than $1$, and for every positive integer $n$, $b^{n}-1$ divides $a^{n}-1$. Define the polynomial $p_{n}(x)$ as follows: $p_0{x}=-1$, $p_{n+1}(x)=b^{n+1}(x-1)p_{n}(bx)-a(b^{n+1}-1)p_{n}(x)$, for $n \ge 0$. Prove that there exist integers $C$ and positive integer $k$ such that $p_{k}(x)=Cx^k$.
[b]p1.[/b] Farmer John wants to bring some cows to a pasture with grass that grows at a constant rate. Initially, the pasture has some nonzero amount of grass and it will stop growing if there is no grass left. The pasture sustains $100$ cows for ten days. The pasture can also sustain $100$ cows for five days, and then $120$ cows for three more days. If cows eat at a constant rate, fund the maximum number of cows Farmer John can bring to the pasture so that they can be sustained indefinitely. [b]p2.[/b] Sam is learning basic arithmetic. He may place either the operation $+$ or $-$ in each of the blank spots between the numbers below: $$5\,\, \_ \,\, 8\,\, \_ \,\,9\,\, \_ \,\,7\,\,\_ \,\,2\,\,\_ \,\,3$$ In how many ways can he place the operations so the result is divisible by $3$? [b]p3.[/b] Will loves the color blue, but he despises the color red. In the $5\times 6$ rectangular grid below, how many rectangles are there containing at most one red square and with sides contained in the gridlines? [img]https://cdn.artofproblemsolving.com/attachments/1/7/7ce55bdc9e05c7c514dddc7f8194f3031b93c4.png[/img] [b]p4.[/b] Let $r_1, r_2, r_3$ be the three roots of a cubic polynomial $P(x)$. Suppose that $$\frac{P(2) + P(-2)}{P(0)}= 200.$$ If $\frac{1}{r_1r_2}+ \frac{1}{r_2r_3}+\frac{1}{r_3r_1}= \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m + n$. [b]p5.[/b] Consider a rectangle $ABCD$ with $AB = 3$ and $BC = 1$. Let $O$ be the intersection of diagonals $AC$ and $BD$. Suppose that the circumcircle of $ \vartriangle ADO$ intersects line $AB$ again at $E \ne A$. Then, the length $BE$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Let $ABCD$ be a square with side length $100$ and $M$ be the midpoint of side $AB$. The circle with center $M$ and radius $50$ intersects the circle with center $D$ and radius $100$ at point $E$. $CE$ intersects $AB$ at $F$. If $AF = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$. [b]p7.[/b] How many pairs of real numbers $(x, y)$, with $0 < x, y < 1$ satisfy the property that both $3x + 5y$ and $5x + 2y$ are integers? [b]p8.[/b] Sebastian is coloring a circular spinner with $4$ congruent sections. He randomly chooses one of four colors for each of the sections. If two or more adjacent sections have the same color, he fuses them and considers them as one section. (Sections meeting at only one point are not adjacent.) Suppose that the expected number of sections in the final colored spinner is equal to $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p9.[/b] Let $ABC$ be a triangle and $D$ be a point on the extension of segment $BC$ past $C$. Let the line through $A$ perpendicular to $BC$ be $\ell$. The line through $B$ perpendicular to $AD$ and the line through $C$ perpendicular to $AD$ intersect $\ell$ at $H_1$ and $H_2$, respectively. If $AB = 13$, $BC = 14$, $CA = 15$, and $H_1H_2 = 1001$, find $CD$. [b]p10.[/b] Find the sum of all positive integers $k$ such that $$\frac21 -\frac{3}{2 \times 1}+\frac{4}{3\times 2\times 1} + ...+ (-1)^{k+1} \frac{k+1}{k\times (k - 1)\times ... \times 2\times 1} \ge 1 + \frac{1}{700^3}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Prove that the polynomial \[ f(x) \equal{} \frac {x^n \plus{} x^m \minus{} 2}{x^{\gcd(m,n)} \minus{} 1}\] is irreducible over $ \mathbb{Q}$ for all integers $ n > m > 0$.
Let $P,Q$ be two monic polynomials with complex coefficients such that $P(P(x))=Q(Q(x))$ for all $x$. Prove that $P=Q$. [i]Marius Cavachi[/i]
The sequence $\{u_n\}$ is defined by $u_1 = 1, u_2 = 1, u_n = u_{n-1} + 2u_{n-2} for n \geq 3$. Prove that for any positive integers $n, p \ (p > 1), u_{n+p} = u_{n+1}u_{p} + 2u_nu_{p-1}$. Also find the greatest common divisor of $u_n$ and $u_{n+3}.$
Find all positive integers $a$ and $b$ for which there are three consecutive integers at which the polynomial \[ P(n) = \frac{n^5+a}{b} \] takes integer values.
Prime $p>2$ and a polynomial $Q$ with integer coefficients are such that there are no integers $1 \le i < j \le p-1$ for which $(Q(j)-Q(i))(jQ(j)-iQ(i))$ is divisible by $p$. What is the smallest possible degree of $Q$? [i](Proposed by Anton Trygub)[/i]
Does there exist a polynomial $P(x)$ with integral coefficients such that a) $P(\sqrt[3]{25 }+ \sqrt[3]{5}) = 220\sqrt[3]{25} + 284\sqrt[3]{5}$ ? b) $P(\sqrt[3]{25 }+ \sqrt[3]{5}) = 1184\sqrt[3]{25} + 1210\sqrt[3]{5}$ ?
Let $P(x,\, y)=2x^{2}-6xy+5y^{2}$. Let us say an integer number $a$ is a value of $P$ if there exist integer numbers $b$, $c$ such that $P(b,\, c)=a$. a) Find all values of $P$ lying between 1 and 100. b) Show that if $r$ and $s$ are values of $P$, then so is $rs$.
Let $p$ be an odd prime. A degree $d$ polynomial $f$ with non-negative integer coefficients less than $p$ is called $p-floppy$ if the coefficients of $f(x)f(-x) - f(x^2)$ are all divisible by $p$ and if exactly $d$ entries in the sequence $(f(0), f(1), f(2), \dots , f(p-1))$ are divisible by $p$. How many non-constant $61$-floppy polynomials are there?
Let $P$ be an interior point of an acute-angled triangle $ABC$. The line $BP$ meets the line $AC$ at $E$, and the line $CP$ meets the line $AB$ at $F$. The lines $AP$ and $EF$ intersect each other at $D$. Let $K$ be the foot of the perpendicular from the point $D$ to the line $BC$. Show that the line $KD$ bisects the angle $\angle EKF$.