Found problems: 3597
Can every polynomial with integer coefficients be expressed as a sum of cubes
of polynomials with integer coefficients?
[hide]I found the following statement that can be linked to this problem: "It is easy to see that every polynomial in F[x] is sum of cubes if char (F)$\ne$3 and card (F)=2,4"[/hide]
Let $ n \geq 2, n \in \mathbb{N}$ and let $ p, a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n \in \mathbb{R}$ satisfying $ \frac{1}{2} \leq p \leq 1,$ $ 0 \leq a_i,$ $ 0 \leq b_i \leq p,$ $ i \equal{} 1, \ldots, n,$ and \[ \sum^n_{i\equal{}1} a_i \equal{} \sum^n_{i\equal{}1} b_i.\] Prove the inequality: \[ \sum^n_{i\equal{}1} b_i \prod^n_{j \equal{} 1, j \neq i} a_j \leq \frac{p}{(n\minus{}1)^{n\minus{}1}}.\]
Prove that the interval $\lbrack 0,1 \rbrack$ can be split into black and white intervals for any quadratic polynomial $P(x)$, such that the sum of weights of the black intervals is equal to the sum of weights of the white intervals. (Define the weight of the interval $\lbrack a,b \rbrack$ as $P(b) - P(a)$.)
Does the same result hold with a degree 3 or degree 5 polynomial?
Let $n$ and $k$ be two natural numbers such that $k$ is even and for each prime $p$ if $p|n$ then $p-1|k$. let $\{a_1,....,a_{\phi(n)}\}$ be all the numbers coprime to $n$. What's the remainder of the number $a_1^k+.....+a_{\phi(n)}^k$ when it's divided by $n$?
[i]proposed by Yahya Motevassel[/i]
Find all polynomials $P(x), Q(x)$ with real coefficients such that for all real numbers $a$, $P(a)$ is a root of the equation $x^{2023}+Q(a)x^2+(a^{2024}+a)x+a^3+2025a=0.$
Find all monic polynomials $f$ with integer coefficients satisfying the following condition: there exists a positive integer $N$ such that $p$ divides $2(f(p)!)+1$ for every prime $p>N$ for which $f(p)$ is a positive integer.
[i]Note: A monic polynomial has a leading coefficient equal to 1.[/i]
[i](Greece - Panagiotis Lolas and Silouanos Brazitikos)[/i]
Find all polynomials $p_n(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$ ($n\geq 2$) with real and non-zero coeficients s.t. $p_n(x)-p_1(x)p_2(x)...p_{n-1}(x)$ be a constant polynomial. ;)
Let $a,b$ be two positive integers, such that $ab\neq 1$. Find all the integer values that $f(a,b)$ can take, where \[ f(a,b) = \frac { a^2+ab+b^2} { ab- 1} . \]
Let $F(n)$ be the set of polynomials $P(x) = a_0+a_1x+\cdots+a_nx^n$, with $a_0, a_1, . . . , a_n \in \mathbb R$ and $0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}.$ Prove that if $f \in F(m)$ and $g \in F(n)$, then $fg \in F(m + n).$
Let $f(x)$ be a monic cubic polynomial with $f(0)=-64$, and all roots of $f(x)$ are non-negative real numbers. What is the largest possible value of $f(-1)$? (A polynomial is monic if its leading coefficient is 1.)
Find all cubic polynomials $x^3 +ax^2 +bx+c$ admitting the rational numbers $a$, $b$ and $c$ as roots.
Prove that it is possible to choose different real numbers $a_1, a_2, . . . , a_{10}$ that the equation $$(x - a_1)(x -a_2).... (x -a_{10}) = (x + a_1)(x + a_2) ...(x + a_{10})$$ will have exactly $5$ different real roots.
Let $ p$ be a prime number. Let $ h(x)$ be a polynomial with integer coefficients such that $ h(0),h(1),\dots, h(p^2\minus{}1)$ are distinct modulo $ p^2.$ Show that $ h(0),h(1),\dots, h(p^3\minus{}1)$ are distinct modulo $ p^3.$
There are 6 distinct values of $x$ strictly between $0$ and $\frac{\pi}{2}$ that satisfy the equation
\[
\tan(15 x) = 15 \tan(x) .
\]
Call these 6 values $r_1$, $r_2$, $r_3$, $r_4$, $r_5$, and $r_6$. What is the value of the sum
\[
\frac{1}{\tan^2 r_1} +
\frac{1}{\tan^2 r_2} +
\frac{1}{\tan^2 r_3} +
\frac{1}{\tan^2 r_4} +
\frac{1}{\tan^2 r_5} +
\frac{1}{\tan^2 r_6} \, ?
\]
A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$
Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.
Determine all polynomials $P$ with integer coefficients satisfying
\[P(P(P(P(P(x)))))=x^{28}\cdot P(P(x))\qquad \forall x\in\mathbb{R}\]
Let $f:\mathbb{Q}\rightarrow \mathbb{Q}$ a monotonic bijective function.
a)Prove that there exist a unique continuous function $F:\mathbb{R}\rightarrow \mathbb{R}$ such that $F(x)=f(x),\ (\forall)x\in \mathbb{Q}$.
b)Give an example of a non-injective polynomial function $G:\mathbb{R}\rightarrow \mathbb{R}$ such that $G(\mathbb{Q})\subset \mathbb{Q}$ and it's restriction defined on $\mathbb{Q}$ is injective.
Let $ d$ and $ e$ denote the solutions of $ 2x^2\plus{}3x\minus{}5\equal{}0$. What is the value of $ (d\minus{}1)(e\minus{}1)$?
$ \textbf{(A)}\ \minus{}\frac{5}{2} \qquad
\textbf{(B)}\ 0 \qquad
\textbf{(C)}\ 3 \qquad
\textbf{(D)}\ 5 \qquad
\textbf{(E)}\ 6$
Let $a$ be some integer. Prove that the polynomial $x^4(x-a)^4+1$ can not be a product of two non-constant polynomials with integer coefficients
For every natural number $n\geq{2}$ consider the following affirmation $P_n$:
"Consider a polynomial $P(X)$ (of degree $n$) with real coefficients. If its derivative $P'(X)$ has $n-1$ distinct real roots, then there is a real number $C$ such that the equation $P(x)=C$ has $n$ real,distinct roots."
Are $P_4$ and $P_5$ both true? Justify your answer.
Let $p$ be a prime number, $n$ a natural number which is not divisible by $p$, and $\mathbb{K}$ is a finite field, with $char(K) = p, |K| = p^n, 1_{\mathbb{K}}$ unity element and $\widehat{0} = 0_{\mathbb{K}}.$ For every $m \in \mathbb{N}^{*}$ we note
$ \widehat{m} = \underbrace{1_{\mathbb{K}} + 1_{\mathbb{K}} + \ldots + 1_{\mathbb{K}}}_{m \text{ times}} $ and define the polynomial
\[
f_m = \sum_{k = 0}^{m} (-1)^{m - k} \widehat{\binom{m}{k}} X^{p^k} \in \mathbb{K}[X].
\]
a) Show that roots of $f_1$ are $ \left\{ \widehat{k} | k \in \{0,1,2, \ldots , p - 1 \} \right\}$.
b) Let $m \in \mathbb{N}^{*}.$ Determine the set of roots from $\mathbb{K}$ of polynomial $f_{m}.$
Let $P$ and $Q$ be two polynomials with real coeficients such that $P$ has degree greater than $1$ and \[P(Q(x)) = P(P(x)) + P(x).\]Show that $P(-x) = P(x) + x$.
Let $f(x_{1}, x_{2}, . . . , x_{n})$ be a polynomial with integer coefficients of degree less than $n$. Prove that if $N$ is the number of $n$-tuples $(x_{1}, . . . , x_{n})$ with $0 \leq x_{i} < 13$ and $f(x_{1}, . . . , x_{n}) = 0 (mod 13)$, then $N$ is divisible by 13.
Let $Q(x)$ be a cubic polynomial with integer coefficients. Suppose that a prime $p$ divides $Q(x_j)$ for $j = 1$ ,$2$ ,$3$ ,$4$ , where $x_1 , x_2 , x_3 , x_4$ are distinct integers from the set $\{0,1,\cdots, p-1\}$. Prove that $p$ divides all the coefficients of $Q(x)$.