Found problems: 3597
Let $P(x)$ be a nonzero polynomial of degree $n>1$ with nonnegative coefficients such that function $y=P(x)$ is odd. Is that possible thet for some pairwise distinct points $A_{1}, A_{2}, \dots A_{n}$ on the graph $G: y = P(x)$ the following conditions hold: tangent to $G$ at $A_{1}$ passes through $A_{2}$, tangent to $G$ at $A_{2}$ passes through $A_{3}$, $\dots$, tangent to $G$ at $A_{n}$ passes through $A_{1}$?
Let $c$ denote the largest possible real number such that there exists a nonconstant polynomial $P$ with \[P(z^2)=P(z-c)P(z+c)\] for all $z$. Compute the sum of all values of $P(\tfrac13)$ over all nonconstant polynomials $P$ satisfying the above constraint for this $c$.
Consider the roots of the polynomial $x^{2013}-2^{2013}=0$. Some of these roots also satisfy $x^k-2^k=0$, for some integer $k<2013$. What is the product of this subset of roots?
Find all positive integers $n$ with the following property:
there exists a polynomial $P_n(x)$ of degree $n$, with integer coefficients, such that $P_n(0)=0$ and $P_n(x)=n$ for $n$ distinct integer solutions.
Assume $n$ is a positive integer. Considers sequences $a_0, a_1, \ldots, a_n$ for which $a_i \in \{1, 2, \ldots , n\}$ for all $i$ and $a_n = a_0$.
(a) Suppose $n$ is odd. Find the number of such sequences if $a_i - a_{i-1} \not \equiv i \pmod{n}$ for all $i = 1, 2, \ldots, n$.
(b) Suppose $n$ is an odd prime. Find the number of such sequences if $a_i - a_{i-1} \not \equiv i, 2i \pmod{n}$ for all $i = 1, 2, \ldots, n$.
Let $f(x)$ be a polynomial of degree $n$ with real coefficients, having $n$ (not necessarily distinct) real roots. Prove that for all real $x$,
$$f(x)f''(x)\le f'(x)^2.$$
For a positive integer $n$, a cubic polynomial $p(x)$ is said to be [i]$n$-good[/i] if there exist $n$ distinct integers $a_1, a_2, \ldots, a_n$ such that all the roots of the polynomial $p(x) + a_i = 0$ are integers for $1 \le i \le n$. Given a positive integer $n$ prove that there exists an $n$-good cubic polynomial.
For how many positive integers $n$ is $n^3-8n^2+20n-13$ a prime number?
$\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }\text{more than 4}$
$P(x)$ is polynomial with degree $n>5$ and integer coefficients have $n$ different integer roots. Prove that $P(x)+3$ have $n$ different real roots.
We call a polynomial $P(x)$ good if the numbers $P(k)$ and $P'(k)$ are integers for all integers $k$. Let $P(x)$ be a good polynomial of degree $d$, and let $N_d$ be the product of all composite numbers not exceeding $d$. Prove that the leading coefficient of the polynomial $N_d \cdot P(x)$ is integer.
Determine all polynomials with integral coefficients $P(x)$ such that if $a,b,c$ are the sides of a right-angled triangle, then $P(a), P(b), P(c)$ are also the sides of a right-angled triangle. (Sides of a triangle are necessarily positive. Note that it's not necessary for the order of sides to be preserved; if $c$ is the hypotenuse of the first triangle, it's not necessary that $P(c)$ is the hypotenuse of the second triangle, and similar with the others.)
Let $S$ be the set of all ordered triples $(p,q,r)$ of prime numbers for which at least one rational number $x$ satisfies $px^2+qx+r=0.$ Which primes appear in seven or more elements of $S?$
The real numbers $a_1,a_2,...,a_{100}$ satisfy the relationship :
$a_1^2+ a_2^2 + \cdots +a_{100}^2 + ( a_1+a_2 + \cdots + a_{100})^2 = 101$
Prove that $|a_k| \leq 10$ for all $k \in \{1,2,...,100\}$
With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?
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]
On a faded piece of paper it is possible to read the following:
\[(x^2 + x + a)(x^{15}- \cdots ) = x^{17} + x^{13} + x^5 - 90x^4 + x - 90.\]
Some parts have got lost, partly the constant term of the first factor of the left side, partly the majority of the summands of the second factor. It would be possible to restore the polynomial forming the other factor, but we restrict ourselves to asking the following question: What is the value of the constant term $a$? We assume that all polynomials in the statement have only integer coefficients.
find all pairs of relatively prime natural numbers $ (m,n) $ in such a way that there exists non constant polynomial f satisfying \[ gcd(a+b+1, mf(a)+nf(b) > 1 \]
for every natural numbers $ a $ and $ b $
For each real number $x$, let $\lfloor x \rfloor$ denote the largest integer not exceeding $x$.
A sequence $\{a_n \}_{n=1}^{\infty}$ is defined by $a_n = \frac{1}{4^{\lfloor -\log_4 n \rfloor}}, \forall n \geq 1.$ Let $b_n = \frac{1}{n^2} \left( \sum_{k=1}^n a_k - \frac{1}{a_1+a_2} \right), \forall n \geq 1.$
a) Find a polynomial $P(x)$ with real coefficients such that $b_n = P \left( \frac{a_n}{n} \right), \forall n \geq 1$.
b) Prove that there exists a strictly increasing sequence $\{n_k \}_{k=1}^{\infty}$ of positive integers such that $$\lim_{k \to \infty} b_{n_k} = \frac{2024}{2025}.$$
Let $p(x)$ be the monic cubic polynomial with roots $\sin^2(1^{\circ})$, $\sin^2(3^{\circ})$, and $\sin^2(9^{\circ})$. Suppose that $p\left(\frac{1}{4}\right)=\frac{\sin(a^{\circ})}{n\sin(b^{\circ})}$, where $0 <a,b \le 90$ and $a,b,n$ are positive integers. What is $a+b+n$?
[i]Proposed by Andrew Yuan[/i]
Let $A = A(x,y)$ and $B = B(x,y)$ be two-variable polynomials with real coefficients. Suppose that $A(x,y)/B(x,y)$ is a polynomial in $x$ for infinitely many values of $y$, and a polynomial in $y$ for infinitely many values of $x$. Prove that $B$ divides $A$, meaning there exists a third polynomial $C$ with real coefficients such that $A = B \cdot C$.
[i]Proposed by Victor Wang[/i]
Polynomial $p(x)$ with real coefficients, which is different from the constant, has the following property:
[i] for any naturals $n$ and $k$ the $\frac{p(n+1)p(n+2)...p(n+k)}{p(1)p(2)...p(k)}$ is an integer.[/i]
Prove that this polynomial is divisible by $x$.
Let $f : R \to R$, and let $P$ be a nonzero polynomial with degree no more than $2015$. For any nonnegative integer $n$, $f^{(n)}(x)$ denotes the function defined as $f$ composed with itself $n$ times. For example, $f^{(0)}(x) = x$, $f^{(1)}(x) = f(x)$, $f^{(2)}(x) = f(f(x))$, etc. Show that there always exists a real number $q$ such that $$f^{((2017^{2017})!)(q)} \ne (q + 2017)(qP(q) - 1).$$
When all vertex angles of a convex polygon are equal, call it equiangular. Prove that $ p > 2$ is a prime number, if and only if the lengths of all sides of equiangular $ p$ polygon are rational numbers, it is a regular $ p$ polygon.
Define the polymonial sequence $\left \{ f_n\left ( x \right ) \right \}_{n\ge 1}$ with $f_1\left ( x \right )=1$, $$f_{2n}\left ( x \right )=xf_n\left ( x \right ), \; f_{2n+1}\left ( x \right ) = f_n\left ( x \right )+ f_{n+1} \left ( x \right ), \; n\ge 1.$$ Look for all the rational number $a$ which is a root of certain $f_n\left ( x \right ).$
The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$?
$ \textbf{(A)}\ 12 \qquad
\textbf{(B)}\ 32 \qquad
\textbf{(C)}\ 48 \qquad
\textbf{(D)}\ 52 \qquad
\textbf{(E)}\ 68$