Found problems: 4275
Suppose $p$ is an odd prime number. We call the polynomial $f(x)=\sum_{j=0}^n a_jx^j$ with integer coefficients $i$-remainder if $ \sum_{p-1|j,j>0}a_{j}\equiv i\pmod{p}$. Prove that the set $\{f(0),f(1),...,f(p-1)\}$ is a complete residue system modulo $p$ if and only if polynomials $f(x), (f(x))^2,...,(f(x))^{p-2}$ are $0$-remainder and the polynomial $(f(x))^{p-1}$ is $1$-remainder.
[i]Proposed by Yahya Motevassel[/i]
Find the sum of the coefficients of the polynomial $(63x-61)^4$.
Does there exist an integer $n \ge 3$ and an arithmetic sequence $a_0, a_1, ... , a_n$ such that the polynomial $a_nx^n +... + a_1x + a_0$ has $n$ roots which also form an arithmetic sequence?
The polynomial $ (x\plus{}y)^9$ is expanded in decreasing powers of $ x$. The second and third terms have equal values when evaluated at $ x\equal{}p$ and $ y\equal{}q$, where $ p$ and $ q$ are positive numbers whose sum is one. What is the value of $ p$?
$ \textbf{(A)}\ 1/5 \qquad
\textbf{(B)}\ 4/5 \qquad
\textbf{(C)}\ 1/4 \qquad
\textbf{(D)}\ 3/4 \qquad
\textbf{(E)}\ 8/9$
For some polynomial there is an infinite set its values, each of which takes at least at two integer points. Prove that there is at most one the integer value that a polynomial takes at exactly one integer point.
If $ a_0,a_1,\dots,a_{50}$ are the coefficients of the polynomial
\[ \left(1\plus{}x\plus{}x^2\right)^{25}\]
show that $ a_0\plus{}a_2\plus{}a_4\plus{}\cdots\plus{}a_{50}$ is even.
Evaluate $ \int_0^1 \frac{x^{14}}{x^2\plus{}1}\ dx$.
Let $f(x)$ be a real function such that for each positive real $c$ there exist a polynomial $P(x)$ (maybe dependent on $c$) such that $| f(x) - P(x)| \leq c \cdot x^{1998}$ for all real $x$. Prove that $f$ is a real polynomial.
Determine all non-constant polynomials $ f\in \mathbb{Z}[X]$ with the property that there exists $ k\in\mathbb{N}^*$ such that for any prime number $ p$, $ f(p)$ has at most $ k$ distinct prime divisors.
Let $K$ be the set of all positive integers that do not contain the digit $7$ in their base-$10$ representation. Find all polynomials $f$ with nonnegative integer coefficients such that $f(n)\in K$ whenever $n\in K$.
[i]Proposed by Titu Andreescu, Cosmin Pohoata, and Vlad Matei[/i]
Elmo calls a monic polynomial with real coefficients [i]tasty[/i] if all of its coefficients are in the range $[-1,1]$. A monic polynomial $P$ with real coefficients and complex roots $\chi_1,\cdots,\chi_m$ (counted with multiplicity) is given to Elmo, and he discovers that there does not exist a monic polynomial $Q$ with real coefficients such that $PQ$ is tasty. Find all possible values of $\max\left(|\chi_1|,\cdots,|\chi_m|\right)$.
[i]Proposed by Carl Schildkraut[/i]
For arbitrary natural number $n$, prove that $\sum^n_{k=0}C^k_n2^kC^{[(n-k)/2]}_{n-k}=C^n_{2n+1}$, where $C^0_0=1$ and $[\dfrac{n-k}{2}]$ denotes the integer part of $\dfrac{n-k}{2}$.
Prove that the following polynomial is irreducible in $ \mathbb Z[x,y]$:
\[ x^{200}y^5\plus{}x^{51}y^{100}\plus{}x^{106}\minus{}4x^{100}y^5\plus{}x^{100}\minus{}2y^{100}\minus{}2x^6\plus{}4y^5\minus{}2\]
Consider a polynomial $P(x) \in \mathbb{R}[x]$, with degree $2023$, such that $P(\sin^2(x))+P(\cos^2(x)) =1$ for all $x \in \mathbb{R}$. If the sum of all roots of $P$ is equal to $\dfrac{p}{q}$ with $p, q$ coprime, then what is the product $pq$?
For an integer $x \geq 1$, let $p(x)$ be the least prime that does not divide $x$, and define $q(x)$ to be the product of all primes less than $p(x)$. In particular, $p(1) = 2.$ For $x$ having $p(x) = 2$, define $q(x) = 1$. Consider the sequence $x_0, x_1, x_2, \ldots$ defined by $x_0 = 1$ and \[ x_{n+1} = \frac{x_n p(x_n)}{q(x_n)} \] for $n \geq 0$. Find all $n$ such that $x_n = 1995$.
Find the least positive number m such that for any polynimial f(x) with real coefficients, there is a polynimial g(x) with real coefficients (degree not greater than m) such that there exist 2017 distinct number $a_1,a_2,...,a_{2017}$ such that $g(a_i)=f(a_{i+1})$ for i=1,2,...,2017 where indices taken modulo 2017.
Consider the polynomial $ P(x) \equal{} x^3 \plus{} 153x^2 \minus{} 111x \plus{} 38$.
(a) Prove that there are at least nine integers $ a$ in the interval $ [1, 3^{2000}]$ for which $ P(a)$ is divisible by $ 3^{2000}$.
(b) Find the number of integers $ a$ in $ [1, 3^{2000}]$ with the property from (a).
Determine all polynomials $P{}$ with integer coefficients, satisfying $0 \leqslant P (n) \leqslant n!$ for all non-negative integers $n$.
[i]Andrei Chirita[/i]
[b]p1.[/b] In their class Introduction to Ladders at Greendale Community College, Jan takes four tests. They realize that their test scores in chronological order form a strictly increasing arithmetic progression with integer terms, and that the average of those scores is an integer greater than or equal to $94$. How many possible combinations of test scores could they have had? (Test scores at Greendale range between $0$ and $100$, inclusive.)
[b]p2.[/b] Suppose that $A$ and $B$ are digits between $1$ and $9$ such that
$$0.\overline{ABABAB...}+ B \cdot (0.\overline{AAA...}) = A \cdot (0.\overline{B1B1B1...}) + 1$$
Find the sum of all possible values of $10A + B$.
[b]p3.[/b] Let $ABC$ be an isosceles right triangle with $m\angle ABC = 90^o$. Let $D$ and $E$ lie on segments $\overline{AC}$ and $\overline{BC}$, respectively, such that triangles $\vartriangle ADB$ and $\vartriangle CDE$ are similar and $DE =EB$. If $\frac{AC}{AD} = 1 +\frac{\sqrt{a}}{b}$ with $a$, $b$ positive integers and $a$ squarefree, then find $a + b$.
[b]p4.[/b] Five bowling pins $P_1, P_2, ..., P_5$ are lined up in a row. Each turn, Jemma picks a pin at random from the standing pins, and throws a bowling ball at that pin; that pin and each pin directly adjacent to it are knocked down. If the expected value of the number of turns Jemma will take to knock down all the pins is $\frac{a}{b}$ where $a$ and $b$ are relatively prime, find $a + b$. (Pins $P_i$ and $P_j$ are adjacent if and only if $|i - j| = 1$.)
[b]p5.[/b] How many terms in the expansion of $$(1 + x + x^2 + x^3 +... + x^{2021})(1 + x^2 + x^4 + x^6 + ... + x^{4042})$$ have coeffcients equal to $1011$?
[b]p6.[/b] Suppose $f(x)$ is a monic quadratic polynomial with distinct nonzero roots $p$ and $q$, and suppose $g(x)$ is a monic quadratic polynomial with roots $p + \frac{1}{q}$ and $q + \frac{1}{p}$ . If we are given that $g(-1) = 1$ and $f(0)\ne -1$, then there exists some real number $r$ that must be a root of $f(x)$. Find $r$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $n$ be a positive integer and $f(x)=a_mx^m+\ldots + a_1X+a_0$, with $m\ge 2$, a polynomial with integer coefficients such that:
a) $a_2,a_3\ldots a_m$ are divisible by all prime factors of $n$,
b) $a_1$ and $n$ are relatively prime.
Prove that for any positive integer $k$, there exists a positive integer $c$, such that $f(c)$ is divisible by $n^k$.
Let $P(x)=a_{0}+a_{1}x+...+a_{n}x^{n}\in\mathbb{C}[x]$ , where $a_{n}=1$. The roots of $P(x)$ are $b_{1},b_{2},...,b_{n}$, where $|b_{1}|,|b_{2}|,...,|b_{j}|>1$ and $|b_{j+1}|,...,|b_{n}|\leq 1$. Prove that $\prod_{i=1}^{j}|b_{i}|\leq\sqrt{|a_{0}|^{2}+|a_{1}|^{2}+...+|a_{n}|^{2}}$.
Let $P(t)$ be a nonconstant polynomial with real coefficients. Prove that the system of simultaneous equations
$$ \int_{0}^{x} P(t)\sin t \, dt =0, \;\;\;\; \int_{0}^{x} P(t) \cos t \, dt =0 $$
has only finitely many solutions $x.$
The quadratic polynomial $f(x)$ has the expansion $2x^2 - 3x + r$. What is the largest real value of $r$ for which the ranges of the functions $f(x)$ and $f(f(x))$ are the same set?
Find all pairs of real number $x$ and $y$ which simultaneously satisfy the following 2 relations:
$x+y+4=\frac{12x+11y}{x^2+y^2}$
$y-x+3=\frac{11x-12y}{x^2+y^2}$
The function $f(x)=x^5-20x^4+ax^3+bx^2+cx+24$ has the interesting property that its roots can be arranged to form an arithmetic sequence. Determine $f(8)$.