Found problems: 4275
a) We have a geometric sequence of $3$ terms. If the sum of these terms is $26$ , and their sum of squares is $364$ , find the terms of the sequence.
b) Suppose that $a,b,c,u,v,w$ are positive real numbers , and each of $a,b,c$ and $u,v,w$ are geometric sequences. Suppose also that $a+u,b+v,c+w$ are an arithmetic sequence. Prove that $a=b=c$ and $u=v=w$
c) Let $a,b,c,d$ be real numbers (not all zero), and let $f(x,y,z)$ be the polynomial in three variables defined by$$f(x,y,z) = axyz + b(xy + yz + zx) + c(x+y+z) + d$$.Prove that $f(x,y,z)$ is reducible if and only if $a,b,c,d$ is a geometric sequence.
Let $n\ge 2$ be an even integer and $a,b$ real numbers such that $b^n=3a+1$. Show that the polynomial $P(X)=(X^2+X+1)^n-X^n-a$ is divisible by $Q(X)=X^3+X^2+X+b$ if and only if $b=1$.
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]
Allen and Alan play a game. A nonconstant polynomial $P(x,y)$ with real coefficients and a positive integer $d$ greater than the degree of $P$ are known to both Allen and Alan. Alan thinks of a polynomial $Q(x,y)$ with real coefficients and degree at most $d$ and keeps it secret. Allen can make queries of the form $(s,t)$, where $s$ and $t$ are real numbers such that $P(s,t)\neq0$. Alan must respond with the value $Q(s,t)$. Allen's goal is to determine whether $P$ divides $Q$. Find (in terms of $P$ and $d$) the smallest positive integer, $g$, such that Allen can always achieve this goal making no more than $g$ queries.
[i]Linus Tang[/i]
For numbers $a,b \in \mathbb{R}$ we consider the sets:
$$A=\{a^n | n \in \mathbb{N}\} , B=\{b^n | n \in \mathbb{N}\}$$
Find all $a,b > 1$ for which there exists two real , non-constant polynomials $P,Q$ with positive leading coefficients st for each $r \in \mathbb{R}$:
$$ P(r) \in A \iff Q(r) \in B$$
Set $P$ as a polynomial function by $p_n(x)=\sum_{k=0}^{n-1} x^k$.
a) Prove that for $m,n\in N$, when dividing $p_n(x)$ by $p_m(x)$, the remainder is $$p_i(x),\forall i=0,1,...,m-1.$$
b) Find all the positive integers $i,j,k$ that make $$p_i(x)+p_j(x^2)+p_k(x^4)=p_{100}(x).$$
[i](square1zoa)[/i]
Let a be a non-zero integer, and $n \ge 3$ another integer. Prove that the following polynomial is irreducible in the ring of integer polynomials (i.e. it cannot be written as a product of two non-constant integer polynomials):
$$f(x) = x^n + ax^{n-1} + ax^{n-2} +... + ax -1$$
Prove that if $ a $ and $ b $ are real numbers and the polynomial $ ax^3 - ax^2 + 9bx - b $ has three positive roots, then they are equal.
Let $f(x)$ be a quadratic polynomial with two real roots in the interval $[-1,1]$. Prove that if the maximum value of $|f(x)|$ in the interval $[-1,1]$ is equal to $1$, then the maximum value of $|f'(x)|$ in the interval $[-1,1]$ is not less than $1$.
We are given a polynomial $f(x)=x^6-11x^4+36x^2-36$. Prove that for an arbitrary prime number $p$, $f(x)\equiv 0\pmod{p}$ has a solution.
For what natural number $x$ will the value of the polynomial $x^3+7x^2+6x+1$ be the cube of a natural number?
Find all polynomials with integer coefficients $P$ such that for all positive integers $n$, the sequence $$0, P(0), P(P(0)), \cdots$$ is eventually constant modulo $n$.
[i]Proposed by Ivan Chan Kai Chin[/i]
Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$
Prove that there is no nonconstant polynomial $f(x)$ with integral coefficients such that $f(n)$ is prime for all $n \in \mathbb{N}$.
Find a necessary and sufficient condition on the natural number $ n$ for the equation
\[ x^n \plus{} (2 \plus{} x)^n \plus{} (2 \minus{} x)^n \equal{} 0
\]
to have a integral root.
Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.
Let $n > 1$ and $p(x)=x^n+a_{n-1}x^{n-1} +...+a_0$ be a polynomial with $n$ real roots (counted
with multiplicity). Let the polynomial $q$ be defined by
$$q(x) = \prod_{j=1}^{2015} p(x + j)$$.
We know that $p(2015) = 2015$. Prove that $q$ has at least $1970$ different roots $r_1, ..., r_{1970}$
such that $|r_j| < 2015$ for all $ j = 1, ..., 1970$.
Find all polynomials $p(x)$ with integer coefficients such that for each positive integer $n$, the number $2^n - 1$ is divisible by $p(n)$.
Let $P(x)=x^3+ax^2+b$ and $Q(x)=x^3+bx+a$, where $a$ and $b$ are nonzero real numbers. Suppose that the roots of the equation $P(x)=0$ are the reciprocals of the roots of the equation $Q(x)=0$. Prove that $a$ and $b$ are integers. Find the greatest common divisor of $P(2013!+1)$ and $Q(2013!+1)$.
Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$?
[i]Proposed by Mahan Malihi[/i]
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.
Find all polynomials $Q(x)= ax^2+bx+c$ with integer coefficients for which there exist three different prime numbers $p_1, p_2, p_3$ such that $|Q(p_1)| = |Q(p_2)| = |Q(p_3)| = 11$.
Given the polynomials $P(x)=px^4+qx^3+rx^2+sx+t,\ Q(x)=\frac{d}{dx}P(x)$, find the real numbers $p,\ q,\ r,\ s,\ t$ such that $P(\sqrt{-5})=0,\ Q(\sqrt{-2})=0$ and $\int_0^1 P(x)dx=-\frac{52}{5}.$
Let $r = 1-\sqrt[5]{2}+ \sqrt[5]{4}-\sqrt[5]{8}+ \sqrt[5]{16}$. There exists a unique fifth-degree polynomial $P$ such that its leading coefficient is positive, all of its coefficients are integers whose greatest common factor (among all of them) is $1$, and $P(r) = 0$. Evaluate $P(10)$.
Suppose $P(x,y)$ is a homogenous non-constant polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for all real $t$. Prove that $P(x,y) = (x^2+y^2)^k$ for some positive integer $k$.
(A polynomial $A(x,y)$ with real coefficients and having a degree of $n$ is homogenous if it is the sum of $a_ix^iy^{n-i}$ for some real number $a_i$, for all integer $0 \le i \le n$.)