Found problems: 4275
Determine the minimum value of $a^{2} + b^{2}$ when $(a,b)$ traverses all the pairs of real numbers for which the equation \[ x^{4} + ax^{3} + bx^{2} + ax + 1 = 0 \] has at least one real root.
Find all positive integers $n$ for which all coefficients of polynomial $P(x)$ are divisible by $7,$ where
\[P(x) = (x^2 + x + 1)^n - (x^2 + 1)^n - (x + 1)^n - (x^2 + x)^n + x^{2n} + x^n + 1.\]
For a polynomial $ P(x)$ with integer coefficients, $ r(2i \minus{} 1)$ (for $ i \equal{} 1,2,3,\ldots,512$) is the remainder obtained when $ P(2i \minus{} 1)$ is divided by $ 1024$. The sequence
\[ (r(1),r(3),\ldots,r(1023))
\]
is called the [i]remainder sequence[/i] of $ P(x)$. A remainder sequence is called [i]complete[/i] if it is a permutation of $ (1,3,5,\ldots,1023)$. Prove that there are no more than $ 2^{35}$ different complete remainder sequences.
Find the sum of the $2007$ roots of \[(x-1)^{2007}+2(x-2)^{2006}+3(x-3)^{2005}+\cdots+2006(x-2006)^2+2007(x-2007).\]
Given A, non-inverted matrices of order n with real elements, $n\ge 2$ and given ${{A}^{*}}$adjoin matrix A. Prove that $tr({{A}^{*}})\ne -1$ if and only if the matrix ${{I}_{n}}+{{A}^{*}}$ is invertible.
Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$ over the integers for every $i$.
Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$?
[i]By Omid Hatami[/i]
Let $c$ be a nonzero real number. Suppose that $g(x)=c_0x^r+c_1x^{r-1}+\cdots+c_{r-1}x+c_r$ is a polynomial with integer coefficients. Suppose that the roots of $g(x)$ are $b_1,\cdots,b_r$. Let $k$ be a given positive integer. Show that there is a prime $p$ such that $p>\max(k,|c|,|c_r|)$, and moreover if $t$ is a real number between $0$ and $1$, and $j$ is one of $1,\cdots,r$, then \[|(\text{ }c^r\text{ }b_j\text{}g(tb_j)\text{ })^pe^{(1-t)b}|<\dfrac{(p-1)!}{2r}.\] Furthermore, if \[f(x)=\dfrac{e^{rp-1}x^{p-1}(g(x))^p}{(p-1)!}\] then \[\left|\sum_{j=1}^r\int_0^1 e^{(1-t)b_j}f(tb_j)dt\right|\leq \dfrac{1}{2}.\]
Given cubic polynomial with integer coefficients and three irrational roots. Show that none of these roots can be root of quadratic equation with integer coefficients.
Find all pairs of positive integers $m,n\geq3$ for which there exist infinitely many positive integers $a$ such that \[ \frac{a^m+a-1}{a^n+a^2-1} \] is itself an integer.
[i]Laurentiu Panaitopol, Romania[/i]
Let $f(x)$ be a polynomial of finite degree satisfying
$$(x+9)f(x+1)=(x+3)f(x+3)$$
for all real $x$. If $f(0)=1$, find the value of $f(1)$.
Let us call a polynomial [i]admissible[/i] if all it's coefficients are $0, 1, 2$ or $3$. For given $n$ find the number of all the [i]admissible [/i] polynomials $P$ such, that $P(2) = n$.
Let $k$ be a positive integer. Show that if there exists a sequence $a_0,a_1,\ldots$ of integers satisfying the condition \[a_n=\frac{a_{n-1}+n^k}{n}\text{ for all } n\geq 1,\] then $k-2$ is divisible by $3$.
[i]Proposed by Okan Tekman, Turkey[/i]
Let f be a rational function (i.e. the quotient of two real polynomials) and suppose that $f(n)$ is an integer for infinitely many integers n. Prove that f is a polynomial.
If $ a$, $ b$, $ c$, $ d$, and $ e$ are constants such that every $ x > 0$ satisfies
\[ \frac{5x^4 \minus{} 8x^3 \plus{} 2x^2 \plus{} 4x \plus{} 7}{(x \plus{} 2)^4}
\equal{} a \plus{} \frac{b}{x \plus{} 2} \plus{} \frac{c}{(x \plus{} 2)^2}
\plus{} \frac{d}{(x \plus{} 2)^3} \plus{} \frac{e}{(x \plus{} 2)^4} \, ,\]
then what is the value of $ a \plus{} b \plus{} c \plus{} d \plus{} e$?
A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds:
For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials.
$a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$.
$b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials.
[i]Proposed by Alireza Shavali[/i]
Let $P(x)$ be a polynomial with real coefficients. Let $\alpha_1 , \dots , \alpha_k$ be the distinct real roots of $P(x)=0$. If $P'$ is the derivative of $P$, show that for each $i=1,\dots , k$
\[\lim_{x\to \alpha_i} \frac{(x-\alpha_i)P'(x)}{P(x)} = r_i, \]
for some positive integer $r_i$.
Find all polynomials $ p\in\mathbb Z[x]$ such that $ (m,n)\equal{}1\Rightarrow (p(m),p(n))\equal{}1$
Consider a polynomial
\[f(x)=x^{2012}+a_{2011}x^{2011}+\dots+a_1x+a_0.\]
Albert Einstein and Homer Simpson are playing the following game. In turn, they choose one of the coefficients $a_0,a_1,\dots,a_{2011}$ and assign a real value to it. Albert has the first move. Once a value is assigned to a coefficient, it cannot be changed any more. The game ends after all the coefficients have been assigned values.
Homer's goal is to make $f(x)$ divisible by a fixed polynomial $m(x)$ and Albert's goal is to prevent this.
(a) Which of the players has a winning strategy if $m(x)=x-2012$?
(b) Which of the players has a winning strategy if $m(x)=x^2+1$?
[i]Proposed by Fedor Duzhin, Nanyang Technological University.[/i]
All $n+3$ offices of University of Somewhere are numbered with numbers $0,1,2, \ldots ,$ $n+1,$ $n+2$ for some $n \in \mathbb{N}$. One day, Professor $D$ came up with a polynomial with real coefficients and power $n$. Then, on the door of every office he wrote the value of that polynomial evaluated in the number assigned to that office. On the $i$th office, for $i$ $\in$ $\{0,1, \ldots, n+1 \}$ he wrote $2^i$ and on the $(n+2)$th office he wrote $2^{n+2}$ $-n-3$.
[list=a]
[*] Prove that Professor D made a calculation error
[*] Assuming that Professor D made a calculation error, what is the smallest number of errors he made? Prove that in this case the errors are uniquely determined, find them and correct them.
[/list]
Source: 1976 Euclid Part B Problem 4
-----
The remainder when $f(x)=x^5-2x^4+ax^3-x^2+bx-2$ is divided by $x+1$ is $-7$. When $f(x)$ is divided by $x-2$ the remainder is $32$. Determine the remainder when $f(x)$ is divided by $x-1$.
For every real number $x_1$, construct the sequence $x_1,x_2,\ldots$ by setting: \[ x_{n+1}=x_n(x_n+{1\over n}). \] Prove that there exists exactly one value of $x_1$ which gives $0<x_n<x_{n+1}<1$ for all $n$.
A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$.
(a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced.
(b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$.
[i]Proposed by Jorge Tipe, Peru[/i]
We say that $1\leq a\leq101$ is a quadratic polynomial residue modulo $101$ with respect to a quadratic polynomial $f(x)$ with integer coefficients if there exists an integer $b$ such that $101 \mid a-f(b)$. For a quadratic polynomial $f$, we define its quadratic residue set as the set of quadratic residues modulo $101$ with respect to $f(x)$. Compute the number of quadratic residue sets.
[i]Proposed by Michael Ren[/i]
Let $Q(x)$ be a non-zero polynomial and $k$ be a natural number. Prove that the polynomial $P(x) = (x-1)^kQ(x)$ has at least $k+1$ non-zero coefficients.