Found problems: 3597
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$.
Let $\{A_{1},\dots,A_{k}\}$ be matrices which make a group under matrix multiplication. Suppose $M=A_{1}+\dots+A_{k}$. Prove that each eigenvalue of $M$ is equal to $0$ or $k$.
The equation $ x^3 - x^2 + ax - 2^n = 0$ has three integer roots. Determine $a$ and $n$.
Do there exists many infinitely points like $(x_1,y_1),(x_2,y_2),...$ such that for any sequences like {$b_1,b_2,...$} of real numbers there exists a polynomial $P(x,y)\in R[x,y]$ such that we have for all $i$ :
$P(x_{i},y_{i})=b_{i}$
Let $a, b, c, d$ be real numbers. Suppose that all the roots of $z^4+az^3+bz^2+cz+d=0$ are complex numbers lying on a circle in the complex plane centered at $0+0i$ and having radius $1$. The sum of the reciprocals of the roots is necessarily
$ \textbf{(A)}\ a \qquad\textbf{(B)}\ b \qquad\textbf{(C)}\ c \qquad\textbf{(D)}\ -a \qquad\textbf{(E)}\ -b $
For each positive integer $n$, determine the smallest possible value of the polynomial
$$
W_n(x)=x^{2n}+2x^{2n-1}+3x^{2n-2}+\ldots + (2n-1)x^2+2nx.
$$
In the following, let $N_0$ denotes the set of non-negative integers.
Find all polynomials $P(x)$ that fulfill the following two properties:
(1) All coefficients of $P(x)$ are from $N_0$.
(2) Exists a function $f : N_0 \to N_0$ such as $f (f (f (n))) = P (n)$ for all $n \in N_0$.
Let $a, b$ and $c$ be the distinct solutions to the equation $x^3-2x^2+3x-4=0$. Find the value of
$$\frac{1}{a(b^2+c^2-a^2)}+\frac{1}{b(c^2+a^2-b^2)}+\frac{1}{c(a^2+b^2-c^2)}.$$
Determine all pairs of non-constant polynomials $p(x)$ and $q(x)$, each with leading coefficient $1$, degree $n$, and $n$ roots which are non-negative integers, that satisfy $p(x)-q(x)=1$.
Prove that after completing the multiplication and collecting the terms
$$(1 - x + x^2 - x^3 +... - x^{99} + x^{100})(1 + x + x^2 + ...+ x^{99} + x^{100})$$
has no monomials of odd degree.
For every integer $n$ not equal to $1$ or $-1$, define $S(n)$ as the smallest integer greater than $1$ that divides $n$. In particular, $S(0)=2$. We also define $S(1) = S(-1) = 1$.
Let $f$ be a non-constant polynomial with integer coefficients such that $S(f(n)) \leq S(n)$ for every positive integer $n$. Prove that $f(0)=0$.
[b]Note:[/b] A non-constant polynomial with integer coefficients is a function of the form $f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_k x^k$, where $k$ is a positive integer and $a_0,a_1,\ldots,a_k$ are integers such that $a_k \neq 0$.
[i]Pitchayut Saengrungkongka, Thailand[/i]
In the cartesian plane, consider the subset of all the points with both integer coordinates. Prove that it is possible to choose a finite non-empty subset $S$ of these points in such a way that any line $l$ that forms an angle of $90^{\circ},0^{\circ},135^{\circ}$ or $45^{\circ}$ with the positive horizontal semi-axis intersects $S$ at exactly $2024$ points or at no points.
Let \( A \) and \( B \) be two square matrices with complex entries such that \( A + B = AB \), \( A = A^* \), and \( A \) has all distinct eigenvalues. Prove that there exists a polynomial \( P \) with complex coefficients such that \( P(A) = B \).
Find all homogeneous linear recursive sequences such that there is a $ T$ such that $ a_n\equal{}a_{n\plus{}T}$ for each $ n$.
For every non-negative integer $k$ let $S(k)$ denote the sum of decimal digits of $k$. Let $P(x)$
and $Q(x)$ be polynomials with non-negative integer coecients such that $S(P(n)) = S(Q(n))$ for
all non-negative integers $n$. Prove that there exists an integer $t$ such that $P(x) - 10^tQ(x)$ is a constant polynomial.
Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]
Let $P(x)$ be a nonconstant complex coefficient polynomial and let $Q(x,y)=P(x)-P(y).$ Suppose that polynomial $Q(x,y)$ has exactly $k$ linear factors unproportional two by tow (without counting repetitons). Let $R(x,y)$ be factor of $Q(x,y)$ of degree strictly smaller than $k$. Prove that $R(x,y)$ is a product of linear polynomials.
[b]Note: [/b] The [i]degree[/i] of nontrivial polynomial $\sum_{m}\sum_{n}c_{m,n}x^{m}y^{n}$ is the maximum of $m+n$ along all nonzero coefficients $c_{m,n}.$ Two polynomials are [i]proportional[/i] if one of them is the other times a complex constant.
[i]Proposed by Navid Safaie[/i]
After multiplying out and simplifying polynomial $ (x \minus{} 1)(x^2 \minus{} 1)(x^3 \minus{} 1)\cdots(x^{2007} \minus{} 1),$ getting rid of all terms whose powers are greater than $ 2007,$ we acquire a new polynomial $ f(x).$ Find its degree and the coefficient of the term having the highest power. Find the degree of $ f(x) \equal{} (1 \minus{} x)(1 \minus{} x^{2})...(1 \minus{} x^{2007})$ $ (mod$ $ x^{2008}).$
Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.
A natural number $n$ is given. Find the longest interval of a real line such that for numbers taken arbitrarily from it $a_0$, $a_1$, $a_2$, $...$, $a_{2n-1}$ the polynomial $x^{2n}+a_{2n-1}x^{2n-1}+...+a_1x + a_0$ has no roots on the entire real axis. (The left and right ends of the interval do not belong to the interval.)
Given a polynomial $f(x) = x^4+ax^3+bx^2+cx$.
It is known that each of the equations $f(x) = 1$ and $f(x) = 2$ has four real roots (not necessarily distinct).
Prove that if the roots of the first equation satisfy the equality $x_1 + x_2 = x_3 + x_4$, then the same equation holds for the roots of the second equation
Prove that, for all integers $a, b$, there exists a positive integer $n$, such that the number $n^2+an+b$ has at least $2018$ different prime divisors.
Polynomials $u_i(x) = a_ix+b_i$ ($a_i,b_i \in R$, $ i = 1,2,3$) satisfy
$$u_1(x)^n +u_2(x)^n = u_3(x)^n$$
for some integer $n \ge 2.$
Prove that there exist real numbers $A$,$B$,$c_1$,$c_2$,$c_3$ such that $u_i(x) = c_i(Ax+B)$ for $i = 1,2,3$.
If $ y\equal{}x\plus{}\frac{1}{x}$, then $ x^4\plus{}x^3\minus{}4x^2\plus{}x\plus{}1\equal{}0$ becomes:
$ \textbf{(A)}\ x^2(y^2\plus{}y\minus{}2)\equal{}0 \qquad\textbf{(B)}\ x^2(y^2\plus{}y\minus{}3)\equal{}0\\
\textbf{(C)}\ x^2(y^2\plus{}y\minus{}4)\equal{}0 \qquad\textbf{(D)}\ x^2(y^2\plus{}y\minus{}6)\equal{}0\\
\textbf{(E)}\ \text{none of these}$
Let $p$ be a prime. We say that a sequence of integers $\{z_n\}_{n=0}^\infty$ is a [i]$p$-pod[/i] if for each $e \geq 0$, there is an $N \geq 0$ such that whenever $m \geq N$, $p^e$ divides the sum
\[\sum_{k=0}^m (-1)^k {m \choose k} z_k.\]
Prove that if both sequences $\{x_n\}_{n=0}^\infty$ and $\{y_n\}_{n=0}^\infty$ are $p$-pods, then the sequence $\{x_ny_n\}_{n=0}^\infty$ is a $p$-pod.