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

Factor the polynomial $bc (b+c) +ca (c-a)-ab(a + b)$.
Let $n$, $(n \geq3)$ be a positive integer and the polynomial $f(x)=(1+x) \cdot (1+2x) \cdot (1+3x) \cdot ... \cdot (1+nx)$ $= a_0+a_1 \cdot x+a_2 \cdot x^2+a_3 \cdot x^3+...+a_n \cdot x^n$. Show that the number $a_3$ divides the number $k=C^2_{n+1} \cdot (2 \cdot C^2_n \cdot C^2_{n+1}-3 \cdot a_2).$
Let $P(x)$ be a polynomial with integer coefficients satisfying $$(x^2+1)P(x-1)=(x^2-10x+26)P(x)$$ for all real numbers $x.$ Find the sum of all possible values of $P(0)$ between $1$ and $5000,$ inclusive.
Prove that after completing the multiplication and collecting the terms $$(1 - x + x^2 - x^3 +... - x^{99} + x^{100})(1 + x + x^2 + ...+ x^{99} + x^{100})$$ has no monomials of odd degree.
For every integer $n$ not equal to $1$ or $-1$, define $S(n)$ as the smallest integer greater than $1$ that divides $n$. In particular, $S(0)=2$. We also define $S(1) = S(-1) = 1$. Let $f$ be a non-constant polynomial with integer coefficients such that $S(f(n)) \leq S(n)$ for every positive integer $n$. Prove that $f(0)=0$. [b]Note:[/b] A non-constant polynomial with integer coefficients is a function of the form $f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_k x^k$, where $k$ is a positive integer and $a_0,a_1,\ldots,a_k$ are integers such that $a_k \neq 0$. [i]Pitchayut Saengrungkongka, Thailand[/i]
In the cartesian plane, consider the subset of all the points with both integer coordinates. Prove that it is possible to choose a finite non-empty subset $S$ of these points in such a way that any line $l$ that forms an angle of $90^{\circ},0^{\circ},135^{\circ}$ or $45^{\circ}$ with the positive horizontal semi-axis intersects $S$ at exactly $2024$ points or at no points.
Let \( A \) and \( B \) be two square matrices with complex entries such that \( A + B = AB \), \( A = A^* \), and \( A \) has all distinct eigenvalues. Prove that there exists a polynomial \( P \) with complex coefficients such that \( P(A) = B \).
Call a polynomial $f$ with positive integer coefficients [i]triangle-compatible[/i] 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)$?
Find all homogeneous linear recursive sequences such that there is a $ T$ such that $ a_n\equal{}a_{n\plus{}T}$ for each $ n$.
For every non-negative integer $k$ let $S(k)$ denote the sum of decimal digits of $k$. Let $P(x)$ and $Q(x)$ be polynomials with non-negative integer coecients such that $S(P(n)) = S(Q(n))$ for all non-negative integers $n$. Prove that there exists an integer $t$ such that $P(x) - 10^tQ(x)$ is a constant polynomial.
[b]3.[/b] Let $f(x)= x^n +a_1 x^(n-1)+ \dots + a_n$ ($n\geq 1$) be an irreducible polynomial over the field $K$. Show that every non-zero matrix commuting with the matrix $ \begin{bmatrix} 0 & 1 & 0 & \dots & 0 & 0 \\ 0 & 0 & 1 & \dots & 0 & 0 \\ \dots & \dots & \dots & \dots & \dots & \dots \\ 0 & 0 & 0 & \dots & 0 & 1 \\ -a_n & -a_{n-1} & -a_{n-2} & \dots & -a_2 & -a_1 \end{bmatrix} $ is invertible. [b](A. 4)[/b]
Let $P(x)$ be a nonconstant complex coefficient polynomial and let $Q(x,y)=P(x)-P(y).$ Suppose that polynomial $Q(x,y)$ has exactly $k$ linear factors unproportional two by tow (without counting repetitons). Let $R(x,y)$ be factor of $Q(x,y)$ of degree strictly smaller than $k$. Prove that $R(x,y)$ is a product of linear polynomials. [b]Note: [/b] The [i]degree[/i] of nontrivial polynomial $\sum_{m}\sum_{n}c_{m,n}x^{m}y^{n}$ is the maximum of $m+n$ along all nonzero coefficients $c_{m,n}.$ Two polynomials are [i]proportional[/i] if one of them is the other times a complex constant. [i]Proposed by Navid Safaie[/i]
[b]p1.[/b] If $a \diamond b = ab - a + b$, find $(3 \diamond 4) \diamond 5$ [b]p2.[/b] If $5$ chickens lay $5$ eggs in $5$ days, how many chickens are needed to lay $10$ eggs in $10$ days? [b]p3.[/b] As Alissa left her house to go to work one hour away, she noticed that her odometer read $16261$ miles. This number is a "special" number for Alissa because it is a palindrome and it contains exactly $1$ prime digit. When she got home that evening, it had changed to the next greatest "special" number. What was Alissa's average speed, in miles per hour, during her two hour trip? [b]p4.[/b] How many $1$ in by $3$ in by $8$ in blocks can be placed in a $4$ in by $4$ in by $9$ in box? [b]p5.[/b] Apple loves eating bananas, but she prefers unripe ones. There are $12$ bananas in each bunch sold. Given any bunch, if there is a $\frac13$ probability that there are $4$ ripe bananas, a $\frac16$ probability that there are $6$ ripe bananas, and a $\frac12$ probability that there are $10$ ripe bananas, what is the expected number of unripe bananas in $12$ bunches of bananas? [b]p6.[/b] The sum of the digits of a $3$-digit number $n$ is equal to the same number without the hundreds digit. What is the tens digit of $n$? [b]p7.[/b] How many ordered pairs of positive integers $(a, b)$ satisfy $a \le 20$, $b \le 20$, $ab > 15$? [b]p8.[/b] Let $z(n)$ represent the number of trailing zeroes of $n!$. What is $z(z(6!))?$ (Note: $n! = n\cdot (n-1) \cdot\cdot\cdot 2 \cdot 1$) [b]p9.[/b] On the Cartesian plane, points $A = (-1, 3)$, $B = (1, 8)$, and $C = (0, 10)$ are marked. $\vartriangle ABC$ is reflected over the line $y = 2x + 3$ to obtain $\vartriangle A'B'C'$. The sum of the $x$-coordinates of the vertices of $\vartriangle A'B'C'$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Compute $a + b$. [b]p10.[/b] How many ways can Bill pick three distinct points from the figure so that the points form a non-degenerate triangle? [img]https://cdn.artofproblemsolving.com/attachments/6/a/8b06f70d474a071b75556823f70a2535317944.png[/img] [b]p11.[/b] Say piece $A$ is attacking piece $B$ if the piece $B$ is on a square that piece $A$ can move to. How many ways are there to place a king and a rook on an $8\times 8$ chessboard such that the rook isn't attacking the king, and the king isn't attacking the rook? Consider rotations of the board to be indistinguishable. (Note: rooks move horizontally or vertically by any number of squares, while kings move $1$ square adjacent horizontally, vertically, or diagonally). [b]p12.[/b] Let the remainder when $P(x) = x^{2020} - x^{2017} - 1$ is divided by $S(x) = x^3 - 7$ be the polynomial $R(x) = ax^2 + bx + c$ for integers $a$, $b$, $c$. Find the remainder when $R(1)$ is divided by $1000$. [b]p13.[/b] Let $S(x) = \left \lfloor \frac{2020}{x} \right\rfloor + \left \lfloor \frac{2020}{x + 1} \right\rfloor$. Find the number of distinct values $S(x)$ achieves for integers $x$ in the interval $[1, 2020]$. [b]p14.[/b] Triangle $\vartriangle ABC$ is inscribed in a circle with center $O$ and has sides $AB = 24$, $BC = 25$, $CA = 26$. Let $M$ be the midpoint of $\overline{AB}$. Points $K$ and $L$ are chosen on sides $\overline{BC}$ and $\overline{CA}$, respectively such that $BK < KC$ and $CL < LA$. Given that $OM = OL = OK$, the area of triangle $\vartriangle MLK$ can be expressed as $\frac{a\sqrt{b}}{c}$ where $a, b, c$ are positive integers, $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p15.[/b] Euler's totient function, $\phi (n)$, is defined as the number of positive integers less than $n$ that are relatively prime to $n$. Let $S(n)$ be the set of composite divisors of $n$. Evaluate $$\sum^{50}_{k=1}\left( k - \sum_{d\in S(k)} \phi (d) \right)$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
After multiplying out and simplifying polynomial $ (x \minus{} 1)(x^2 \minus{} 1)(x^3 \minus{} 1)\cdots(x^{2007} \minus{} 1),$ getting rid of all terms whose powers are greater than $ 2007,$ we acquire a new polynomial $ f(x).$ Find its degree and the coefficient of the term having the highest power. Find the degree of $ f(x) \equal{} (1 \minus{} x)(1 \minus{} x^{2})...(1 \minus{} x^{2007})$ $ (mod$ $ x^{2008}).$
Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.
A natural number $n$ is given. Find the longest interval of a real line such that for numbers taken arbitrarily from it $a_0$, $a_1$, $a_2$, $...$, $a_{2n-1}$ the polynomial $x^{2n}+a_{2n-1}x^{2n-1}+...+a_1x + a_0$ has no roots on the entire real axis. (The left and right ends of the interval do not belong to the interval.)
Given a polynomial $f(x) = x^4+ax^3+bx^2+cx$. It is known that each of the equations $f(x) = 1$ and $f(x) = 2$ has four real roots (not necessarily distinct). Prove that if the roots of the first equation satisfy the equality $x_1 + x_2 = x_3 + x_4$, then the same equation holds for the roots of the second equation
Prove that, for all integers $a, b$, there exists a positive integer $n$, such that the number $n^2+an+b$ has at least $2018$ different prime divisors.
Polynomials $u_i(x) = a_ix+b_i$ ($a_i,b_i \in R$, $ i = 1,2,3$) satisfy $$u_1(x)^n +u_2(x)^n = u_3(x)^n$$ for some integer $n \ge 2.$ Prove that there exist real numbers $A$,$B$,$c_1$,$c_2$,$c_3$ such that $u_i(x) = c_i(Ax+B)$ for $i = 1,2,3$.
If $ y\equal{}x\plus{}\frac{1}{x}$, then $ x^4\plus{}x^3\minus{}4x^2\plus{}x\plus{}1\equal{}0$ becomes: $ \textbf{(A)}\ x^2(y^2\plus{}y\minus{}2)\equal{}0 \qquad\textbf{(B)}\ x^2(y^2\plus{}y\minus{}3)\equal{}0\\ \textbf{(C)}\ x^2(y^2\plus{}y\minus{}4)\equal{}0 \qquad\textbf{(D)}\ x^2(y^2\plus{}y\minus{}6)\equal{}0\\ \textbf{(E)}\ \text{none of these}$
Let $f(x)$ be the polynomial $\prod_{k=1}^{50} \bigl( x - (2k-1) \bigr)$. Let $c$ be the coefficient of $x^{48}$ in $f(x)$. When $c$ is divided by 101, what is the remainder? (The remainder is an integer between 0 and 100.)
Let $p$ be a prime. We say that a sequence of integers $\{z_n\}_{n=0}^\infty$ is a [i]$p$-pod[/i] if for each $e \geq 0$, there is an $N \geq 0$ such that whenever $m \geq N$, $p^e$ divides the sum \[\sum_{k=0}^m (-1)^k {m \choose k} z_k.\] Prove that if both sequences $\{x_n\}_{n=0}^\infty$ and $\{y_n\}_{n=0}^\infty$ are $p$-pods, then the sequence $\{x_ny_n\}_{n=0}^\infty$ is a $p$-pod.
[b]3.[/b] Denoting by $E$ the class of trigonometric polynomials of the form $f(x)=c_{0}+c_{1}cos(x)+\dots +c_{n} cos(nx)$, where $c_{0} \geq c_{1} \geq \dots \geq c_{n}>0$, prove that $(1-\frac{2}{\pi})\frac{1}{n+1}\leq min_{{f\epsilon E}}( \frac{max_{\frac{\pi}{2}\leq x\leq \pi} \left | f(x) \right |}{max_{0\leq x\leq 2\pi} \left | f(x) \right |})\leq (\frac{1}{2}+\frac{1}{\sqrt{2}})\frac{1}{n+1}$. [b](S. 24)[/b]
Suppose $a,b,c$ are three rela numbers such that the quadratic equation \[ x^2 - (a +b +c )x + (ab +bc +ca) = 0 \] has roots of the form $\alpha + i \beta$ where $\alpha > 0$ and $\beta \not= 0$ are real numbers. Show that (i) The numbers $a,b,c$ are all positive. (ii) The numbers $\sqrt{a}, \sqrt{b} , \sqrt{c}$ form the sides of a triangle.