Found problems: 4275
Let p(x) be the polynomial $x^3 + 14x^2 - 2x + 1$. Let $p^n(x)$ denote $p(p^(n-1)(x))$. Show that there is an integer N such that $p^N(x) - x$ is divisible by 101 for all integers x.
Prove that the number \[\sum_{k=0}^{n}\binom{2n+1}{2k+1}2^{3k}\] is not divisible by $5$ for any integer $n\geq 0$.
Let $p$ be a monic cubic polynomial such that $p(0)=1$ and such that all the zeroes of $p^\prime (x)$ are also zeroes of $p(x)$. Find $p$. Note: monic means that the leading coefficient is $1$.
Let $f$ be a polynomial with real coefficients and suppose $f$ has no nonnegative real root. Prove that there exists a polynomial $h$ with real coefficients such that the coefficients of $fh$ are nonnegative.
For a real coefficient cubic polynomial $f(x)=ax^3+bx^2+cx+d$, denote three roots of the equation $f(x)=0$ by $\alpha,\beta,\gamma$. Prove that the three roots $\alpha,\beta,\gamma$ are distinct real numbers iff the real symmetric matrix
$$\begin{pmatrix} 3 & p_1 & p_2 \\ p_1 & p_2 & p_3 \\ p_2 & p_3 & p_4 \end{pmatrix},\quad p_i = \alpha^i + \beta^i + \gamma^i$$
is positive definite.
Find polynomials $f(x)$, $g(x)$, and $h(x)$, if they exist, such that for all $x$, \[|f(x)|-|g(x)|+h(x)=\begin{cases}-1 & \text{if }x<-1\\3x+2 &\text{if }-1\leq x\leq 0\\-2x+2 & \text{if }x>0.\end{cases}\]
A [i]palindrome[/i], such as $ 83438$, is a number that remains the same when its digits are reversed. The numbers $ x$ and $ x \plus{} 32$ are three-digit and four-digit palindromes, respectively. What is the sum of the digits of x?
$ \textbf{(A)}\ 20\qquad \textbf{(B)}\ 21\qquad \textbf{(C)}\ 22\qquad \textbf{(D)}\ 23\qquad \textbf{(E)}\ 24$
Find all monic polynomials $f(x)$ in $\mathbb Z[x]$ such that $f(\mathbb Z)$ is closed under multiplication.
[i]By Mohsen Jamali[/i]
Find all polynomial with real coefficients such that:
P(x^2+1)=P(x)^2+1
Which one of the following is [i] not [/i] true for the equation \[ix^2-x+2i=0,\] where $i=\sqrt{-1}$?
$ \textbf{(A)}\ \text{The sum of the roots is 2} \qquad$
$\textbf{(B)}\ \text{The discriminant is 9}\qquad$
$\textbf{(C)}\ \text{The roots are imaginary}\qquad$
$\textbf{(D)}\ \text{The roots can be found using the quadratic formula}\qquad$
$\textbf{(E)}\ \text{The roots can be found by factoring, using imaginary numbers} $
Find all functions $f:R \to R$, such that $f(x)+f(y)=f(x+y)$, and there exists non-constant polynomials $P(x)$, $Q(x)$ such that $P(x)f(Q(x))=f(P(x)Q(x))$
If $a_i \ (i = 1, 2, \ldots, n)$ are distinct non-zero real numbers, prove that the equation
\[\frac{a_1}{a_1-x} + \frac{a_2}{a_2-x}+\cdots+\frac{a_n}{a_n-x} = n\]
has at least $n - 1$ real roots.
Let $a$ and $b$ be positive integers such that $ab+1$ divides $a^{2}+b^{2}$. Show that \[\frac{a^{2}+b^{2}}{ab+1}\] is the square of an integer.
Consider the function $f(x, y, z) = (x-y +z,y -z +x, z-x+y)$ and denote by $f^{(n)}(x, y,z)$ the function $f$ applied $n$ times to the tuple $(x,y,z)$. Let $r_1$, $r_2$, $r_3$ be the three roots of the equation $x^3- 4x^2 + 12 = 0$ and let $g(x) = x^3 + a_2x^2 + a_1x + a_0$ be the cubic polynomial with the tuple $f^{(3)}(r_1, r_2, r_3)$ as roots. Find the value of $a_1$.
Let $n$ be a positive integer. Let $S$ be a subset of points on the plane with these conditions:
$i)$ There does not exist $n$ lines in the plane such that every element of $S$ be on at least one of them.
$ii)$ for all $X \in S$ there exists $n$ lines in the plane such that every element of $S - {X} $ be on at least one of them.
Find maximum of $\mid S\mid$.
[i]Proposed by Erfan Salavati[/i]
Baron Münchausen boasts that he knows a remarkable quadratic triniomial with positive coefficients. The trinomial has an integral root; if all of its coefficients are increased by $1$, the resulting trinomial also has an integral root; and if all of its coefficients are also increased by $1$, the new trinomial, too, has an integral root. Can this be true?
For prime number $q$ the polynomial $P(x)$ with integer coefficients is said to be factorable if there exist non-constant polynomials $f_q,g_q$ with integer coefficients such that all of the coefficients of the polynomial $Q(x)=P(x)-f_q(x)g_q(x)$ are dividable by $q$ ; and we write:
$$P(x)\equiv f_q(x)g_q(x)\pmod{q}$$
For example the polynomials $2x^3+2,x^2+1,x^3+1$ can be factored modulo $2,3,p$ in the following way:
$$\left\{\begin{array}{lll}
X^2+1\equiv (x+1)(-x+1)\pmod{2}\\
2x^3+2\equiv (2x-1)^3\pmod{3}\\
X^3+1\equiv (x+1)(x^2-x+1)
\end{array}\right.$$
Also the polynomial $x^2-2$ is not factorable modulo $p=8k\pm 3$.
a) Find all prime numbers $p$ such that the polynomial $P(x)$ is factorable modulo $p$:
$$P(x)=x^4-2x^3+3x^2-2x-5$$
b) Does there exist irreducible polynomial $P(x)$ in $\mathbb{Z}[x]$ with integer coefficients such that for each prime number $p$ , it is factorable modulo $p$?
Prove that the polynomial $P_n(x)=1+x+\frac{x^2}{2!}+\cdots +\frac{x^n}{n!}$ has no real zeros if $n$ is even and has exatly one real zero if $n$ is odd
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]
Let $a, b, c$ be real numbers so that all roots of the equation $2x^5 + 5x^4 + 5x^3 + ax^2 + bx + c = 0$ are real. Find the smallest real root of the equation above.
Define the set $M_q=\{x \in \mathbb{Q} \mid x^3-2015x=q \}$ , where $q$ is an arbitrary rational number.
[b]a)[/b] Show that there exists values for $q$ such that the set is null as well as values for which it has exactly one element.
[b]b)[/b] Determine all the possible values for the cardinality of $M_q$
Let $f(x)=x^n+a_1x^{n-1}+\ldots+a_n~(n\ge3)$ be a polynomial with real coefficients and $n$ real roots, such that $\frac{a_{n-1}}{a_n}>n+1$. Prove that if $a_{n-2}=0$, then at least one root of $f(x)$ lies in the open interval $\left(-\frac12,\frac1{n+1}\right)$.
Find all functions $f: \mathbb N \to \mathbb N$ for which
\[ f(n) + f(n+1) = f(n+2)f(n+3)-1996\]
holds for all positive integers $n$.
Let $\mathcal{P}$ be the set of all polynomials with coefficients in $\{0, 1\}$. Suppose $a, b$ are non-zero integers such that for every $f \in \mathcal{P}$ with $f(a)\neq 0$, we have $f(a) \mid f(b)$. Prove that $a=b$.
[i]Proposed by Shashank Ingalagavi and Krutarth Shah[/i]
The square polynomial $x^2+ax+b+1$ has natural roots. Prove that $(a^2+b^2)$ is a composite number.