Found problems: 4275
The polynomial $P(x)=a_0+a_1x+a_2x^2+...+a_8x^8+2009x^9$ has the property that $P(\tfrac{1}{k})=\tfrac{1}{k}$ for $k=1,2,3,4,5,6,7,8,9$. There are relatively prime positive integers $m$ and $n$ such that $P(\tfrac{1}{10})=\tfrac{m}{n}$. Find $n-10m$.
Let $p$ be a prime number. Determine the maximal degree of a polynomial $T(x)$ whose coefficients belong to $\{ 0,1,\cdots,p-1 \}$, whose degree is less than $p$, and which satisfies \[T(n)=T(m) \; \pmod{p}\Longrightarrow n=m \; \pmod{p}\] for all integers $n, m$.
Which of the following polynomials has the greatest real root?
$\textbf{(A) } x^{19}+2018x^{11}+1 \qquad \textbf{(B) } x^{17}+2018x^{11}+1 \qquad \textbf{(C) } x^{19}+2018x^{13}+1 \qquad \textbf{(D) } x^{17}+2018x^{13}+1 \qquad \textbf{(E) } 2019x+2018 $
Let $$f(X)=a_{n}X^{n}+a_{n-1}X^{n-1}+\cdots +a_{1}X+a_{0}$$be a polynomial with real coefficients which satisfies $$a_{n}\geq a_{n-1}\geq \cdots \geq a_{1}\geq a_{0}>0.$$Prove that for every complex root $z$ of this polynomial, we have $|z|\leq 1$.
Paul can write polynomial $(x+1)^n$, expand and simplify it, and after that change every coefficient by its reciprocal. For example if $n=3$ Paul gets $(x+1)^3=x^3+3x^2+3x+1$ and then $x^3+\frac13x^2+\frac13x+1$. Prove that Paul can choose $n$ for which the sum of Paul’s polynomial coefficients is less than $2.022$.
Let $P(x)$ be a polynomial taking integer values at integer inputs. Are there infinitely many natural numbers that are not representable in the form $P(k)-2^n$ where $n{}$ and $k{}$ are non-negative integers?
[i]Proposed by F. Petrov[/i]
Let $P(x)$ be a monic cubic polynomial. The line $y=0$ and $y=m$ intersect $P(x)$ at points $A,C,E$ and $B,D<F$ from left to right for a positive real number $m$. If $AB=\sqrt{7}$, $CD=\sqrt{15}$, and $EF=\sqrt{10}$, what is the value of $m$?
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define
\[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \]
Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$.
[i]Proposed by Victor Wang[/i]
Let n, k be positive integers. Let $f_a(x) := ||x - a||^{2n}$ , where the vectors $x = (x_1, ..., x_k) , a\in R^k$ , and ||·|| is the Euclidean norm. Let the vector space $Q_{n, k}$ be generated by the functions $f_a$ ($a\in R^k$). What is the largest integer N for which $Q_{n, k}$ contains all polynomials of $x_1, ..., x_k$ whose total degree is at most N?
Find all real polynomials $p(x) $ such that $p(x-1)p(x+1)= p(x^2-1)$.
Prove that for every polynomial $P(x)$ with real coefficients there exist a positive integer $m$ and polynomials $P_{1}(x),\ldots , P_{m}(x)$ with real coefficients such that
\[P(x) = (P_{1}(x))^{3}+\ldots +(P_{m}(x))^{3}\]
Prove that for every natural number $ n$ there exists a polynomial $ p(x)$ with
integer coefficients such that$ p(1),p(2),...,p(n)$ are distinct powers of $ 2$ .
Let $a \geq 3$ be a real number, and $P$ a polynomial of degree $n$ and having real coefficients. Prove that at least one of the following numbers is greater than or equal to $1:$ $$|a^0- P(0)|, \ |a^1-P(1)| , \ |a^2-P(2)|, \cdots, |a^{n + 1}-P(n + 1)|.$$
One considers for $n > 2$ the polynomial: $$(x^2-x+1)^n - (x^2-x+2)^n+ (1+x)^n+(2-x)^n$$
Show that the degree of this polynomial is $2n - 2$.
The polynomial is written in the form $$a_0+a_1x+a_2x^2+...+a_{2n-2}x^{2n-2}$$
Prove that $a_2+a_3+...+a_{2n-2}=0$
As $a$, $b$ and $c$ range over [i]all[/i] real numbers, let $m$ be the smallest possible value of $$2\left(a+b+c\right)^2+\left(ab-4\right)^2+\left(bc-4\right)^2+\left(ca-4\right)^2$$ and $n$ be the number of ordered triplets $\left(a,b,c\right)$ such that the above quantity is minimized. Compute $m+n$.
[i]2016 CCA Math Bonanza Team #8[/i]
Prove that the equation $x^n - a_1x^{n-1} - a_2x^{n-2} - ... -a_{n-1}x - a_n = 0$, where $a_1 \ge 0, a_2 \ge 0, . . . , a_n \ge 0$, cannot have two positive roots.
For nonnegative integers $m$ and $n$, define the sequence $a(m,n)$ of real numbers as follows. Set $a(0,0)=2$ and for every natural number $n$, set $a(0,n)=1$ and $a(n,0)=2$. Then for $m,n\geq1$, define \[ a(m,n)=a(m-1,n)+a(m,n-1). \] Prove that for every natural number $k$, all the roots of the polynomial $P_{k}(x)=\sum_{i=0}^{k}a(i,2k+1-2i)x^{i}$ are real.
[u]Round 1[/u]
[b]1.1.[/b] A person asks for help every $3$ seconds. Over a time period of $5$ minutes, how many times will they ask for help?
[b]1.2.[/b] In a big bag, there are $14$ red marbles, $15$ blue marbles, and$ 16$ white marbles. If Anuj takes a marble out of the bag each time without replacement, how many marbles does Anuj need to remove to be sure that he will have at least $3$ red marbles?
[b]1.3.[/b] If Josh has $5$ distinct candies, how many ways can he pick $3$ of them to eat?
[u]Round 2[/u]
[b]2.1.[/b] Annie has a circular pizza. She makes $4$ straight cuts. What is the minimum number of slices of pizza that she can make?
[b]2.2.[/b] What is the sum of the first $4$ prime numbers that can be written as the sum of two perfect squares?
[b]2.3.[/b] Consider a regular octagon $ABCDEFGH$ inscribed in a circle of area $64\pi$. If the length of arc $ABC$ is $n\pi$, what is $n$?
[u]Round 3[/u]
[b]3.1.[/b] Let $ABCDEF$ be an equiangular hexagon with consecutive sides of length $6, 5, 3, 8$, and $3$. Find the length of the sixth side.
[b]3.2.[/b] Jack writes all of the integers from $ 1$ to $ n$ on a blackboard except the even primes. He selects one of the numbers and erases all of its digits except the leftmost one. He adds up the new list of numbers and finds that the sum is $2020$. What was the number he chose?
[b]3.3.[/b] Our original competition date was scheduled for April $11$, $2020$ which is a Saturday. The numbers $4116$ and $2020$ have the same remainder when divided by $x$. If $x$ is a prime number, find the sum of all possible $x$.
[u]Round 4[/u]
[b]4.1.[/b] The polynomials $5p^2 + 13pq + cq^2$ and $5p^2 + 13pq - cq^2$ where $c$ is a positive integer can both be factored into linear binomials with integer coefficients. Find $c$.
[b]4.2.[/b] In a Cartesian coordinate plane, how many ways are there to get from $(0, 0)$ to $(2, 3)$ in $7$ moves, if each move consists of a moving one unit either up, down, left, or right?
[b]4.3.[/b] Bob the Builder is building houses. On Monday he finds an empty field. Each day starting on Monday, he finishes building a house at noon. On the $n$th day, there is a $\frac{n}{8}$ chance that a storm will appear at $3:14$ PM and destroy all the houses on the field. At any given moment, Bob feels sad if and only if there is exactly $1$ house left on the field that is not destroyed. The probability that he will not be sad on Friday at $6$ PM can be expressed as $p/q$ in simplest form. Find $p + q$.
PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784570p24468605]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
For any polynomial f, denote by $P_f$ the number of integers n for which f(n) is a (positive) prime number. Let $q_d = max P_f$ , where f runs over all polynomials with integer coefficients with degree d and reducible over $\mathbb{Q}$. Prove that $\forall d\geq 2$ , $q_d = d$.
If the remainder is $2013$ when a polynomial with coefficients from the set $\{0,1,2,3,4,5\}$ is divided by $x-6$, what is the least possible value of the coefficient of $x$ in this polynomial?
$
\textbf{(A)}\ 5
\qquad\textbf{(B)}\ 4
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 2
\qquad\textbf{(E)}\ 1
$
If $x$, $y$, $z$ are real numbers satisfying
\begin{align*}
(x + 1)(y + 1)(z + 1) & = 3 \\
(x + 2)(y + 2)(z + 2) & = -2 \\
(x + 3)(y + 3)(z + 3) & = -1,
\end{align*}
find the value of
$$ (x + 20)(y + 20)(z + 20). $$
Let $N$ be the number of triples of positive integers $(a,b,c)$ with $a\leq b\leq c\leq 100$ such that the polynomial \[P(x)=x^2+(a^2+4b^2+c^2+1)x+(4ab+4bc-2ca)\] has integer roots in $x$. Find the last three digits of $N$.
Let $n$ be an even positive integer. An $n$-degree monic polynomial $P(x)$ has $n$ real roots (not necessarily distinct). Suppose $y$ is a positive real number such that for any real number $t<y$, we have $P(t)>0$. Prove that
\[P(0)^{\frac{1}{n}}-P(y)^{\frac{1}{n}}\ge y.\]
$f:\mathbb{R}\rightarrow \mathbb{R}$ satisfies the equation
\[f(x)f(y)-af(xy)=x+y\]
, for every real numbers $x,y$. Find all possible real values of $a$.
Let all possible $2023$-degree real polynomials: $P(x)=x^{2023}+a_1x^{2022}+a_2x^{2021}+\cdots+a_{2022}x+a_{2023}$,
where $P(0)+P(1)=0$, and the polynomial has 2023 real roots $r_1, r_2,\cdots r_{2023}$ [not necessarily distinct] so that $0\leq r_1,r_2,\cdots r_{2023}\leq1$. What is the maximum value of $r_1 \cdot r_2 \cdots r_{2023}?$