Found problems: 4275
Prove that if a quadratic equation
$$ ax^2 + bx + c = 0$$
with integer coefficients has a rational root, then at least one of the numbers $ a $, $ b $, $ c $ is even.
Let $q<50$ be a prime number. Call a sequence of polynomials $P_0(x), P_1(x), P_2(x), ..., P_{q^2}(x)$ [i]tasty[/i] if it satisfies the following conditions:
[list]
[*] $P_i$ has degree $i$ for each $i$ (where we consider constant polynomials, including the $0$ polynomial, to have degree $0$)
[*] The coefficients of $P_i$ are integers between $0$ and $q-1$ for each $i$.
[*] For any $0\le i,j\le q^2$, the polynomial $P_i(P_j(x)) - P_j(P_i(x))$ has all its coefficients divisible by $q$.
[/list]
As $q$ varies over all such prime numbers, determine the total number of tasty sequences of polynomials.
[i]Proposed by Vincent Huang[/i]
John found all real numbers $p$ such that in the polynomial $g(x) = (x -1)^2(p + 2x)^2$ , the quadratic term has coefficient $2021$. What is the sum of all of these values $p$?
Deos there exist a function $f: \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x$, $y \in \mathbb{R}$,
$f(x^2y+f(x+y^2))=x^3+y^3+f(xy)$
Show that for any natural numbers $ m,n\ge 3, $ the equation $ \Delta_n (x)=0 $ has exactly two distinct solutions, where
$$ \Delta_n (x)=\begin{vmatrix}1 & 1-m & 1-m & \cdots & 1-m & 1-m & -m \\ -1 & \binom{m}{x} & 0 & \cdots & 0 & 0 & 0 \\ 0 & -1 & \binom{m}{x} & \cdots & 0 & 0 & 0 \\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ 0 & 0 & 0 & \cdots & -1 & \binom{m}{x} & 0 \\ 0 & 0 & 0 & \cdots & 0 & -1 & \binom{m}{x}\end{vmatrix} . $$
Determine all non-constant monic polynomials $f(x)$ with integer coefficients for which there exists a natural number $M$ such that for all $n \geq M$, $f(n)$ divides $f(2^n) - 2^{f(n)}$
[i] Proposed by Anant Mudgal [/i]
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
The polynomial $P(x)=a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\ldots+a_1x+a_0$ ($a_{2n} \neq 0$) doesn't have any real roots.
Prove that the polynomial $Q(x)=a_{2n}x^{2n}+a_{2n-2}x^{2n-2}+\ldots+a_2x^2+a_0$ also doesn't have any real roots.
Let $W(x) = x^4 - 3x^3 + 5x^2 - 9x$ be a polynomial. Determine all pairs of different integers $a$, $b$ satisfying the equation $W(a) = W(b)$.
Find all pairs $(p,q)$ such that the equation $$x^4+2px^2+qx+p^2-36=0$$ has exactly $4$ integer roots(counting multiplicity).
Let $P(x)$ and $Q(x)$ be non-constant integer-coefficient polynomials such that for any integer $x\in \mathbb Z$, there exists integer $y\in \mathbb Z$ such that $P(x)=Q(y)$. Prove that the degree of $Q$ divides the degree of $P$.
$ c$ is a positive integer. Consider the following recursive sequence: $ a_1\equal{}c, a_{n\plus{}1}\equal{}ca_{n}\plus{}\sqrt{(c^2\minus{}1)(a_n^2\minus{}1)}$, for all $ n \in N$.
Prove that all the terms of the sequence are positive integers.
prove that for each natural number $n$ there exist a polynomial with degree $2n+1$ with coefficients in $\mathbb{Q}[x]$ such that it has exactly $2$ complex zeros and it's irreducible in $\mathbb{Q}[x]$.(20 points)
A polynomial $f(x)$ with real coefficients is called [i]generating[/i], if for each polynomial $\varphi(x)$ with real coefficients there exists a positive integer $k$ and polynomials $g_1(x),\dotsc,g_k(x)$ with real coefficients such that
\[\varphi(x)=f(g_1(x))+\dotsc+f(g_k(x)).\]
Find all generating polynomials.
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Find all polynomials $ f\in\mathbb Z[x]$ such that for each $ a,b,x\in\mathbb N$
\[ a\plus{}b\plus{}c|f(a)\plus{}f(b)\plus{}f(c)\]
Let $ a_i,b_i$ $ (i\equal{}1,2,...,n)$ be real numbers such that the $ a_i$ are distinct, and suppose that there is a real number $ \alpha$ such that the product $ (a_i\plus{}b_1)(a_i\plus{}b_2)...(a_i\plus{}b_n)$ is equal to $ \alpha$ for each $ i$. Prove that there is a real number $ \beta$ such that $ (a_1\plus{}b_j)(a_2\plus{}b_j)...(a_n\plus{}b_j)$ is equal to $ \beta$ for each $ j$.
A polynomial $P(x) = 1 + x^2 + x^5 + x^{n_1} + ...+ x^{n_s} + x^{2008}$ with $n_1, ..., n_s$ are positive integers and $5 < n_1 < ... <n_s < 2008$ are given. Prove that if $P(x)$ has at least a real root, then the root is not greater than $\frac{1-\sqrt5}{2}$
Let $n$ be a positive integer. Ilya and Sasha both choose a pair of different polynomials of degree $n$ with real coefficients. Lenya knows $n$, his goal is to find out whether Ilya and Sasha have the same pair of polynomials. Lenya selects a set of $k$ real numbers $x_1<x_2<\dots<x_k$ and reports these numbers. Then Ilya fills out a $2 \times k$ table: For each $i=1,2,\dots,k$ he writes a pair of numbers $P(x_i),Q(x_i)$ (in any of the two possible orders) intwo the two cells of the $i$-th column, where $P$ and $Q$ are his polynomials. Sasha fills out a similar table. What is the minimal $k$ such that Lenya can surely achieve the goal by looking at the tables?
[i]Proposed by L. Shatunov[/i]
Let $a$ denote the positive real root of the polynomial $x^2 -3x-2$. Compute the remainder when $\lfloor a^{1000}\rfloor $ is divided by the prime number $997$. Here, $\lfloor r\rfloor$ denotes the greatest integer less than $r$.
Let $a$ and $b$ be integers. Find all polynomial with integer coefficients sucht that $P(n)$ divides $P(an+b)$ for infinitely many positive integer $n$
The Miami Heat and the San Antonio Spurs are playing a best-of-five series basketball championship, in which the team that first wins three games wins the whole series. Assume that the probability that the Heat wins a given game is $x$ (there are no ties). The expected value for the total number of games played can be written as $f(x)$, with $f$ a polynomial. Find $f(-1)$.
Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$?
[i]Proposed by Mahan Malihi[/i]
Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that
(1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$;
(2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees;
(3) for any integers $ x, |f(x)|$ isn't prime numbers.
A polynomial $f$ with integer coefficients is written on the blackboard. The teacher is a mathematician who has $3$ kids: Andrew, Beth and Charles. Andrew, who is $7$, is the youngest, and Charles is the oldest. When evaluating the polynomial on his kids' ages he obtains:
[list]$f(7) = 77$
$f(b) = 85$, where $b$ is Beth's age,
$f(c) = 0$, where $c$ is Charles' age.[/list]
How old is each child?