Found problems: 3597
Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$.
[i]Evan O' Dorney.[/i]
Three nonzero real numbers are given. If they are written in any order as coefficients of a quadratic trinomial, then each of these trinomials has a real root. Does it follow that each of these trinomials has a positive root?
Let $ a,b,c$ be positive real numbers such that $ ab\plus{}bc\plus{}ca\equal{}3$. Prove that
\[ \frac 1{1\plus{}a^2(b\plus{}c)} \plus{} \frac 1{1\plus{}b^2(c\plus{}a)} \plus{} \frac 1 {1\plus{}c^2(a\plus{}b) } \leq \frac 3 {1\plus{}2abc} .\]
Let be a $ 3\times 3 $ real matrix $ A. $ Prove the following statements.
[b]a)[/b] $ f(A)\neq O_3, $ for any polynomials $ f\in\mathbb{R} [X] $ whose roots are not real.
[b]b)[/b] $ \exists n\in\mathbb{N}\quad \left( A+\text{adj} (A) \right)^{2n} =\left( A \right)^{2n} +\left( \text{adj} (A) \right)^{2n}\iff \text{det} (A)=0 $
[i]Laurențiu Panaitopol[/i]
Prove that $$x^4 + 2x^2 + 2x + 2$$ is not the product of two polynomials $x^2 + ax + b$ and $x^2 + cx + d$ in which $a$, $b$, $c$, $d$ are integers.
Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients, such that no nonconstant polynomial with rational coefficients divides both $P(x)$ and $Q(x).$ Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive, and $2^{Q(n)}-1$ divides $3^{P(n)}-1.$ Prove that $Q(x)$ is a constant polynomial.
[i]Proposed by Oleksiy Klurman, Ukraine[/i]
Find all pairs of real numbers $(a,b)$ so that there exists a polynomial $P(x)$ with real coefficients and $P(P(x))=x^4-8x^3+ax^2+bx+40$.
Let $n\geq 2$ be an integer. Determine the number of terms in the polynomial $$\prod_{1\leq i< j\leq n}(x_i+x_j)$$ whose coefficients are odd integers.
Prove that in an abelian ring $ A $ in which $ 1\neq 0, $ every element is idempotent if and only if the number of polynomial functions from $ A $ to $ A $ is equal to the square of the cardinal of $ A. $
Let $f(x)=a_0x^3+a_1x^2+a_2x+a_3$ be a polynomial with real coefficients ($a_0\ne0$) such that $|f(x)|\le1$ for every $x\in[-1,1]$. Prove that
(a) there exist a constant $c$ (one and the same for all polynomials with the given property), for which
(b) $|a_0|\le4$.
[i]V. Petkov[/i]
Let $f$ and $g$ be two nonzero polynomials with integer coefficients and $\deg f>\deg g$. Suppose that for infinitely many primes $p$ the polynomial $pf+g$ has a rational root. Prove that $f$ has a rational root.
Show that for $n > 1$ we can find a polynomial $P(a, b, c)$ with integer coefficients such that
$$P(x^{n},x^{n+1},x+x^{n+2})=x.$$
Find all values of $a$ such that $x^6 - 6x^5 + 12x^4 + ax^3 + 12x^2 - 6x +1$ is nonnegative for all real $x$.
Let $i$ be a root of the equation $x^2+1=0$ and let $\omega$ be a root of the equation $x^2+x+1=0$ . Construct a polynomial $$f(x)=a_0+a_1x+\cdots+a_nx^n$$ where $a_0,a_1,\cdots,a_n$ are all integers such that $f(i+\omega)=0$ .
Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$.
[i]Alternative formulation[/i]:
Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial
\[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}.
\]
Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$
[i]Proposed by Federico Ardila, Colombia[/i]
Let $n$ be a positive integer. Show that there are positive real numbers $a_0, a_1, \dots, a_n$ such that for each choice of signs the polynomial
$$\pm a_nx^n\pm a_{n-1}x^{n-1} \pm \dots \pm a_1x \pm a_0$$
has $n$ distinct real roots.
(Proposed by Stephan Neupert, TUM, München)
Do there exist a natural number $n$ and real numbers $a_0, a_1, \dots, a_n$, each equal to $1$ or $-1$, such that the polynomial $a_nx^n + a_{n-1}x^{n-1} + \dots + a_1x + a_0$ is divisible by the polynomial $x^{2023} - 2x^{2022} + c$, where: \\
(a) $c = 1$ \\
(b) $c = -1$?
[i]
(For polynomials $P(x)$ and $Q(x)$ with real coefficients, we say that $P(x)$ is divisible by $Q(x)$ if there exists a polynomial $R(x)$ with real coefficients such that $P(x) = Q(x)R(x)$.)[/i]
Prove that for each natural number $n$ there is a polynomial $f$ with real coefficients and degree $n$ such that $ p(x)=f(x^2-1)$ is divisible by $f(x)$ over the ring $\mathbb{R}[x]$.
Let $ P(x)$ be a polynomial with a non-negative coefficients. Prove that if the inequality $ P\left(\frac {1}{x}\right)P(x)\geq 1$ holds for $ x \equal{} 1$, then this inequality holds for each positive $ x$.
For $a\in C^{*}$ find all $n\in N$ such that $X^{2}(X^{2}-aX+a^{2})^{2}$ divides $(X^{2}+a^{2})^{n}-X^{2n}-a^{2n}$
Find all positive integers $n$ for which there exists a polynomial $P(x) \in \mathbb{Z}[x]$ such that for every positive integer $m\geq 1$, the numbers $P^m(1), \ldots, P^m(n)$ leave exactly $\lceil n/2^m\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.)
[i]Proposed by Carl Schildkraut, USA[/i]
The equation $ x^3 \minus{} 9x^2 \plus{} 8x \plus{} 2 \equal{} 0$ has three real roots $ p$, $ q$, $ r$. Find $ \frac {1}{p^2} \plus{} \frac {1}{q^2} \plus{} \frac {1}{r^2}$.
Let $l$ be the tangent line at the point $P(s,\ t)$ on a circle $C:x^2+y^2=1$. Denote by $m$ the line passing through the point $(1,\ 0)$, parallel to $l$. Let the line $m$ intersects the circle $C$ at $P'$ other than the point $(1,\ 0)$.
Note : if $m$ is the line $x=1$, then $P'$ is considered as $(1,\ 0)$.
Call $T$ the operation such that the point $P'(s',\ t')$ is obtained from the point $P(s,\ t)$ on $C$.
(1) Express $s',\ t'$ as the polynomials of $s$ and $t$ respectively.
(2) Let $P_n$ be the point obtained by $n$ operations of $T$ for $P$.
For $P\left(\frac{\sqrt{3}}{2},\ \frac{1}{2}\right)$, plot the points $P_1,\ P_2$ and $P_3$.
(3) For a positive integer $n$, find the number of $P$ such that $P_n=P$.
Let $p$ be an odd prime and $a_1, a_2,...,a_p$ be integers. Prove that the following two conditions are equivalent:
1) There exists a polynomial $P(x)$ with degree $\leq \frac{p-1}{2}$ such that $P(i) \equiv a_i \pmod p$ for all $1 \leq i \leq p$
2) For any natural $d \leq \frac{p-1}{2}$,
$$ \sum_{i=1}^p (a_{i+d} - a_i )^2 \equiv 0 \pmod p$$
where indices are taken $\pmod p$
Let $k$ be an integer number and $P(X)$ be the polynomial $$P(X) = X^{1997}-X^{1995} +X^2-3kX+3k+1$$
Prove that:
a) the polynomial has no integer root;
β) the numbers $P(n)$ and $P(n) + 3$ are relatively prime, for every integer $n$.