Found problems: 4275
Let $P(x)$ be a polynomial with real coefficients. Prove that there exist positive integers $n$ and $k$ such that $k$ has $n$ digits and more than $P(n)$ positive divisors.
Let $f(x)$ be a polynomial with positive integer coefficients. For every $n\in\mathbb{N}$, let $a_{1}^{(n)}, a_{2}^{(n)}, \dots , a_{n}^{(n)}$ be fixed positive integers that give pairwise different residues modulo $n$ and let
\[g(n) = \sum\limits_{i=1}^{n} f(a_{i}^{(n)}) = f(a_{1}^{(n)}) + f(a_{2}^{(n)}) + \dots + f(a_{n}^{(n)})\]
Prove that there exists a constant $M$ such that for all integers $m>M$ we have $\gcd(m, g(m))>2023^{2023}$.
Let $m$ and $n$ be positive integers. Find the smallest positive integer $s$ for which there exists an $m \times n$ rectangular array of positive integers such that
[list]
[*]each row contains $n$ distinct consecutive integers in some order,
[*]each column contains $m$ distinct consecutive integers in some order, and
[*]each entry is less than or equal to $s$.
[/list]
[i]Proposed by Ankan Bhattacharya.[/i]
Assuming that the roots of $x^3 +px^2 +qx +r=0$ are all real and positive, find the relation between $p,q,r$ which is a necessary and sufficient condition that the roots are the cosines of the angles of a triangle.
(a) Show that, for each positive integer $n$, the number of monic polynomials of degree $n$ with integer coefficients having all its roots on the unit circle is finite.
(b) Let $P(x)$ be a monic polynomial with integer coefficients having all its roots on the unit circle. Show that there exists a positive integer $m$ such that $y^m=1$ for each root $y$ of $P(x)$.
Let $P\left(X\right)=X^5+3X^4-4X^3-X^2-3X+4$. Determine the number of monic polynomials $Q\left(x\right)$ with integer coefficients such that $\frac{P\left(X\right)}{Q\left(X\right)}$ is a polynomial with integer coefficients. Note: a monic polynomial is one with leading coefficient $1$ (so $x^3-4x+5$ is one but not $5x^3-4x^2+1$ or $x^2+3x^3$).
[i]2016 CCA Math Bonanza Individual #9[/i]
Prove that there exist nonconstant polynomials $f, g$ with integer coefficients, such that for infinitely many primes $p$, $p \nmid f(x)-g(y)$ for any integers $x, y$.
Prove that if coefficients of the quadratic equation $ ax^2\plus{}bx\plus{}c\equal{}0$ are odd integers, then the roots of the equation cannot be rational numbers.
Let $P \in \mathbb{R}[x]$. Suppose that the multiset of real roots (where roots are counted with multiplicity) of $P(x)-x$ and $P^3(x)-x$ are distinct. Prove that for all $n\in \mathbb{N}$, $P^n(x)-x$ has at least $\sigma(n)-2$ distinct real roots.
(Here $P^n(x):=P(P^{n-1}(x))$ with $P^1(x) = P(x)$, and $\sigma(n)$ is the sum of all positive divisors of $n$).
[i]Proposed by Malay Mahajan[/i]
Let $A_1A_2A_3A_4$ be a non-cyclic quadrilateral. Let $O_1$ and $r_1$ be the circumcentre and the circumradius of the triangle $A_2A_3A_4$. Define $O_2,O_3,O_4$ and $r_2,r_3,r_4$ in a similar way. Prove that
\[\frac{1}{O_1A_1^2-r_1^2}+\frac{1}{O_2A_2^2-r_2^2}+\frac{1}{O_3A_3^2-r_3^2}+\frac{1}{O_4A_4^2-r_4^2}=0.\]
[i]Proposed by Alexey Gladkich, Israel[/i]
Let $M$ be the set of positive integers which do not have a prime divisor greater than 3. For any infinite family of subsets of $M$, say $A_1,A_2,\ldots $, prove that there exist $i\ne j$ such that for each $x\in A_i$ there exists some $y\in A_j $ such that $y\mid x$.
Prove that there do not exist positive integers $a,b,c$ such that the polynomial
\[
P(x) = x^3 - 2^ax^2 + 3^bx - 6^c
\]
has three integer roots.
Let a quadratic polynomial $g(x) = ax^2 + bx + c$ be given and an integer $n \ge 1$. Prove that there exists at most one polynomial $f(x)$ of $n$th degree such that $f(g(x)) = g(f(x)).$
Let $n$ be the square of an integer whose each prime divisor has an even number of decimal digits. Consider $P(x) = x^n - 1987x$. Show that if $x,y$ are rational numbers with $P(x) = P(y)$, then $x = y$.
Find the greatest common divisor of the numbers \[ 2^{561}\minus{}2, 3^{561}\minus{}3, \ldots, 561^{561}\minus{}561.\]
Let $P(x)$, $Q(x)$ be nonconstant polynomials with real number coefficients. Prove that if
\[\lfloor P(y) \rfloor = \lfloor Q(y) \rfloor\]
for all real numbers $y$, then $P(x) = Q(x)$ for all real numbers $x$.
Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$
Do there exist a sequence $a_{1}, a_{2}, a_{3}, \ldots$ of real numbers and a non-constant polynomial $P(x)$ such that $a_{m}+a_{n}=P(mn)$ for every positive integral $m$ and $n?$
[i]Proposed by A. Golovanov[/i]
show that the polynomial $x^4+3x^3+6x^2+9x+12$ cannot be written as the product of 2 polynomials of degree 2 with integer coefficients.
Let real numbers $x_1, x_2, \cdots , x_n$ satisfy $0 < x_1 < x_2 < \cdots< x_n < 1$ and set $x_0 = 0, x_{n+1} = 1$. Suppose that these numbers satisfy the following system of equations:
\[\sum_{j=0, j \neq i}^{n+1} \frac{1}{x_i-x_j}=0 \quad \text{where } i = 1, 2, . . ., n.\]
Prove that $x_{n+1-i} = 1- x_i$ for $i = 1, 2, . . . , n.$
Let $p$ be a prime number and let $k$ be a positive integer. Suppose that the numbers $a_i=i^k+i$ for $i=0,1, \ldots,p-1$ form a complete residue system modulo $p$. What is the set of possible remainders of $a_2$ upon division by $p$?
For how many pairs $(a,b)$ from $(1,2)$, $(3,5)$, $(5,7)$, $(7,11)$, the polynomial $P(x)=x^5+ax^4+bx^3+bx^2+ax+1$ has exactly one real root?
$
\textbf{(A)}\ 4
\qquad\textbf{(B)}\ 3
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 1
\qquad\textbf{(E)}\ 0
$
Find all the pairs of integers $ (a,b)$ satisfying $ ab(a \minus{} b)\not \equal{} 0$ such that there exists a subset $ Z_{0}$ of set of integers $ Z,$ for any integer $ n$, exactly one among three integers $ n,n \plus{} a,n \plus{} b$ belongs to $ Z_{0}$.
Let $f$ be a quadratic polynomial with real coefficients, and let $g_1, g_2, g_3, \ldots$ be a geometric progression of real numbers. Define $a_n=f(n)+g_n.$ Given that $a_1, a_2, a_3, a_4,$ and $a_5$ are equal to $1, 2, 3, 14,$ and $16,$ respectively, compute $\tfrac{g_2}{g_1}.$
Let $P(x)=x^{2000}-x^{1000}+1$. Do there exist distinct positive integers $a_1,\dots,a_{2001}$ such that $a_ia_j|P(a_i)P(a_j)$ for all $i\neq j$?
[I]Proposed by A. Baranov[/i]