Found problems: 3597
Let $ x,y$ be real numbers such that the numbers $ x\plus{}y, x^2\plus{}y^2, x^3\plus{}y^3$ and $ x^4\plus{}y^4$ are integers. Prove that for all positive integers $ n$, the number $ x^n \plus{} y^n$ is an integer.
The set of polynomials $f_1, f_2, \ldots, f_n$ with real coefficients is called [i]special [/i], if for any different $i,j,k \in \{ 1,2, \ldots, n\}$ polynomial $\dfrac{2}{3}f_i + f_j + f_k$ has no real roots, but for any different $p,q,r,s \in \{ 1,2, \ldots, n\}$ of a polynomial $f_p + f_q + f_r + f_s$ there is a real root.
a) Give an example of a [i]special [/i] set of four polynomials whose sum is not a zero polynomial.
b) Is there a [i]special [/i] set of five polynomials?
Let $ P(x)$ be a polynomial with degree 2008 and leading coefficient 1 such that
\[ P(0) \equal{} 2007, P(1) \equal{} 2006, P(2) \equal{} 2005, \dots, P(2007) \equal{} 0.
\]Determine the value of $ P(2008)$. You may use factorials in your answer.
Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20.
[i]Proposed by Luxembourg[/i]
Determine whether there exists a polynomial $f(x_1, x_2)$ with two variables, with integer coefficients, and two points $A=(a_1, a_2)$ and $B=(b_1, b_2)$ in the plane, satisfying the following conditions:
(i) $A$ is an integer point (i.e $a_1$ and $a_2$ are integers);
(ii) $|a_1-b_1|+|a_2-b_2|=2010$;
(iii) $f(n_1, n_2)>f(a_1, a_2)$ for all integer points $(n_1, n_2)$ in the plane other than $A$;
(iv) $f(x_1, x_2)>f(b_1, b_2)$ for all integer points $(x_1, x_2)$ in the plane other than $B$.
[i]Massimo Gobbino, Italy[/i]
Let $f(x)$ and $g(x)$ be two polynomials with real coefficients such that for infinitely many rational values of $x$, the fraction $\frac{f(x)}{g(x)}$ is rational. Prove that $\frac{f(x)}{g(x)}$ can be written as the ratio of two polynomials with rational coefficients.
Let $P_1(x) = x^2 + a_1x + b_1$ and $P_2(x) = x^2 + a_2x + b_2$ be two quadratic polynomials with integer coeffcients. Suppose $a_1 \ne a_2$ and there exist integers $m \ne n$ such that $P_1(m) = P_2(n), P_2(m) = P_1(n)$. Prove that $a_1 - a_2$ is even.
Show that a sequence $(a_n)$ of $+1$ and $-1$ is periodic with period a power of $2$ if and only if $a_n=(-1)^{P(n)}$, where $P$ is an integer-valued polynomial with rational coefficients.
Find the least positive integer $n$, such that there is a polynomial \[ P(x) = a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_1x+a_0 \] with real coefficients that satisfies both of the following properties:
- For $i=0,1,\dots,2n$ it is $2014 \leq a_i \leq 2015$.
- There is a real number $\xi$ with $P(\xi)=0$.
Find all real solutions of the system of equations:
\[\sum^n_{k=1} x^i_k = a^i\] for $i = 1,2, \ldots, n.$
Find all polynomials $P (x)$ with complex coefficients such that $$P (x^2) = P (x) · P (x + 2)$$
for any complex number $x.$
For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $ p \ge 3$ be a prime number. The sequence $ \{a_{n}\}_{n \ge 0}$ is defined by $ a_{n}=n$ for all $ 0 \le n \le p-1$, and $ a_{n}=a_{n-1}+a_{n-p}$ for all $ n \ge p$. Compute $ a_{p^{3}}\; \pmod{p}$.
Given a polynomial of real coefficients P(x) , can it be affirmed that for any real value of x is true of one of the following inequalities:
$$P(x) \le P(x)^2; \,\,\, P(x) < 1 + P(x)^2; \,\,\,P(x) \le \frac12 +\frac12 P(x)^2.$$
Find a simple general procedure (among the many existing ones) that allows, provided we are given two polynomials $P(x)$ and $Q(x)$ , find another $M(x)$ such that for every value of $x$, at the same time
$-M(x) < P(x)<M(x)$ and $-M(x)< Q(x)<M(x)$.
Let $r$, $s$, $t$ be the roots of the polynomial $x^3+2x^2+x-7$. Then \[ \left(1+\frac{1}{(r+2)^2}\right)\left(1+\frac{1}{(s+2)^2}\right)\left(1+\frac{1}{(t+2)^2}\right)=\frac{m}{n} \] for relatively prime positive integers $m$ and $n$. Compute $100m+n$.
[i]Proposed by Justin Stevens[/i]
Let $A$ be a set with at least $3$ integers, and let $M$ be the maximum element in $A$ and $m$ the minimum element in $A$. it is known that there exist a polynomial $P$ such that: $m<P(a)<M$ for all $a$ in $A$. And also $p(m)<p(a)$ for all $a$ in $A-(m,M)$. Prove that $n<6$ and there exist integers $b$ and $c$ such that $p(x)+x^2+bx+c$ is cero in $A$.
Let $a_1, a_2, a_3, a_4, a_5$ be nonzero real numbers. Prove that the polynomial $$P(x)= \prod_{k=0}^{4} a_{k+1}x^4 + a_{k+2}x^3 + a_{k+3}x^2 + a_{k+4}x + a_{k+5}$$, where $a_{5+i} = a_i$ for $i = 1,2, 3,4$, has a root with negative real part.
[b]Randy:[/b] "Hi Rachel, that's an interesting quadratic equation you have written down. What are its roots?''
[b]Rachel:[/b] "The roots are two positive integers. One of the roots is my age, and the other root is the age of my younger brother, Jimmy.''
[b]Randy:[/b] "That is very neat! Let me see if I can figure out how old you and Jimmy are. That shouldn't be too difficult since all of your coefficients are integers. By the way, I notice that the sum of the three coefficients is a prime number.''
[b]Rachel:[/b] "Interesting. Now figure out how old I am.''
[b]Randy:[/b] "Instead, I will guess your age and substitute it for $x$ in your quadratic equation $\dots$ darn, that gives me $-55$, and not $0$.''
[b]Rachel:[/b] "Oh, leave me alone!''
(1) Prove that Jimmy is two years old.
(2) Determine Rachel's age.
The polynomial $ P(x) \equal{} x^3 \plus{} ax^2 \plus{} bx \plus{} c$ has the property that the mean of its zeros, the product of its zeros, and the sum of its coefficients are all equal. If the $ y$-intercept of the graph of $ y \equal{} P(x)$ is 2, what is $ b$?
$ \textbf{(A)} \ \minus{} 11 \qquad \textbf{(B)} \ \minus{} 10 \qquad \textbf{(C)} \ \minus{} 9 \qquad \textbf{(D)} \ 1 \qquad \textbf{(E)} \ 5$
We say that a function \( f: \mathbb{R} \to \mathbb{R} \) is morally odd if its graph is symmetric with respect to a point, that is, there exists \((x_0, y_0) \in \mathbb{R}^2\) such that if \((u, v) \in \{(x, f(x)) : x \in \mathbb{R}\}\), then \((2x_0 - u, 2y_0 - v) \in \{(x, f(x)) : x \in \mathbb{R}\}\). On the other hand, \( f \) is said to be morally even if its graph \(\{(x, f(x)) : x \in \mathbb{R}\}\) is symmetric with respect to some line (not necessarily vertical or horizontal). If \( f \) is morally even and morally odd, we say that \( f \) is parimpar.
(a) Let \( S \subset \mathbb{R} \) be a bounded set and \( f: S \to \mathbb{R} \) be an arbitrary function. Prove that there exists \( g: \mathbb{R} \to \mathbb{R} \) that is parimpar such that \( g(x) = f(x) \) for all \( x \in S \).
(b) Find all polynomials \( P \) with real coefficients such that the corresponding polynomial function \( P: \mathbb{R} \to \mathbb{R} \) is parimpar.
A polynomial $f(x)$ with real coefficients of degree greater than $1$ is given. Prove that there are infinitely many positive integers which cannot be represented in the form \[f(n+1)+f(n+2)+\cdots+f(n+k)\]
where $n$ and $k$ are positive integers.
Three real numbers $ a,b,c$ satisfy the inequality $ |ax^2\plus{}bx\plus{}c| \le 1$ for all $ x \in [\minus{}1,1]$. Prove that $ |cx^2\plus{}bx\plus{}a| \le 2$ for all $ x \in [\minus{}1,1]$.
Consider a polynomial $P(x) = x^4+x^3-3x^2+x+2$. Prove that at least one of the coefficients of $(P(x))^k$, ($k$ is any positive integer) is negative. (5)
Let $q_{0},q_{1},...$ be a sequence of integers such that
a) for any $m>n$ we have $m-n\mid q_{m}-q_{n}$, and
b) $|q_{n}|\leq n^{10}, \ \forall n\geq 0$.
Prove there exists a polynomial $Q$ such that $q_{n}=Q(n), \ \forall n\geq 0$.
Find all integer polynomials $f$ such that there are infinitely many pairs of relatively prime natural numbers $(a,b)$ so that $a+b \mid f(a)+f(b)$.