This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 3597

Prove that for two non-zero polynomials $ f(x,y),g(x,y)$ with real coefficients the system: \[ \left\{\begin{array}{c}f(x,y)\equal{}0\\ g(x,y)\equal{}0\end{array}\right.\] has finitely many solutions in $ \mathbb C^{2}$ if and only if $ f(x,y)$ and $ g(x,y)$ are coprime.
Find all real parameters $a$ for which the equation $x^8 +ax^4 +1 = 0$ has four real roots forming an arithmetic progression.
Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.
Consider the polynomial $P(n) = n^3 -n^2 -5n+ 2$. Determine all integers $n$ for which $P(n)^2$ is a square of a prime. [hide="Remark."]I'm not sure if the statement of this problem is correct, because if $P(n)^2$ be a square of a prime, then $P(n)$ should be that prime, and I don't think the problem means that.[/hide]
Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and \[\gcd(P(0), P(1), P(2), \ldots ) = 1.\] Show there are infinitely many $n$ such that \[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]
Let $n$ be a natural number. A sequence is $k-$complete if it contains all residues modulo $n^k$. Let $Q(x)$ be a polynomial with integer coefficients. For $k\ge 2$, define $Q^k(x)=Q(Q^{k-1}(x))$, where $Q^1(x)=Q(x)$. Show that if $$0,Q(0),Q^2(0),Q^3(0),\ldots $$is $2018-$complete, then it is $k-$complete for all positive integers $k$. [i]Proposed by Ma Zhao Yu[/i]
Find all functions $f : \mathbb{R} \mapsto \mathbb{R}$ such that $f(xy+f(x)) = xf(y) +f(x)$ for all $x,y \in \mathbb{R}$.
Let $ f$ and $ g$ be polynomials with rational coefficients, and let $ F$ and $ G$ denote the sets of values of $ f$ and $ g$ at rational numbers. Prove that $ F \equal{} G$ holds if and only if $ f(x) \equal{} g(ax \plus{} b)$ for some suitable rational numbers $ a\not \equal{} 0$ and $ b$. [i]E. Fried[/i]
For a positive integer $ n$, consider the equation $ \frac{1}{x\minus{}1}\plus{}\frac{1}{4x\minus{}1}\plus{}\cdots\plus{}\frac{1}{k^2x\minus{}1}\plus{}\cdots\plus{}\frac{1}{n^2x\minus{}1}\equal{}\frac{1}{2}$. (a) Prove that, for every $ n$, this equation has a unique root greater than $ 1$, which is denoted by $ x_n$. (b) Prove that the limit of sequence $ (x_n)$ is $ 4$ as $ n$ approaches infinity.
Find all polynomials $P,Q \in Z[x]$ such that every positive integer is a divisor of a certain nonzero term of the sequence $(x_n)_{n=0}^{\infty}$ given by the conditions: $x_0 = 2016$, $x_{2n+1} = P(x_{2n})$, $x_{2n+2} = Q(x_{2n+1})$ for all $n \ge 0$
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$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that \[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]
Let $f(z)=\frac{z+a}{z+b}$ and $g(z)=f(f(z))$, where $a$ and $b$ are complex numbers. Suppose that $|a|=1$ and $g(g(z))=z$ for all $z$ for which $g(g(z))$ is defined. What is the difference between the largest and smallest possible values of $|b|$? $\textbf{(A)}\ 0 \qquad \textbf{(B)}\ \sqrt{2}-1 \qquad \textbf{(C)}\ \sqrt{3}-1 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 2$
Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different. [i]F. Petrov [/i]
Let $a$ be the sum and $b$ the product of the real roots of the equation $x^4-x^3-1=0$ Prove that $b < -\frac{11}{10}$ and $a > \frac{6}{11}$.
Prove that for any quadratic polynomial $f(x)=x^2+px+q$ with integer coefficients, it is possible to find another polynomial $q(x)=2x^2+rx+s$ with integer coefficients so that \[\{f(x)|x \in \mathbb{Z} \} \cap \{g(x)|x \in \mathbb{Z} \} = \emptyset .\]
Let $\mathcal{M}=\mathbb{Q}[x,y,z]$ be the set of three-variable polynomials with rational coefficients. Prove that for any non-zero polynomial $P\in \mathcal{M}$ there exists non-zero polynomials $Q,R\in \mathcal{M}$ such that \[ R(x^2y,y^2z,z^2x) = P(x,y,z)Q(x,y,z). \]
Let $k$ and $n$ be positive integers with $n\geq k^2-3k+4$, and let $$f(z)=z^{n-1}+c_{n-2}z^{n-2}+\dots+c_0$$ be a polynomial with complex coefficients such that $$c_0c_{n-2}=c_1c_{n-3}=\dots=c_{n-2}c_0=0$$ Prove that $f(z)$ and $z^n-1$ have at most $n-k$ common roots.
Let $P(x)=x^4-x^3-3x^2-x+1.$ Prove that there are infinitely many positive integers $n$ such that $P(3^n)$ is not a prime.
Karl likes the number $17$ his favorite polynomials are monic quadratics with integer coefficients such that $17$ is a root of the quadratic and the roots differ by no more than $17$. Compute the sum of the coefficients of all of Karl's favorite polynomials. (A monic quadratic is a quadratic polynomial whose $x^2$ term has a coefficient of $1$.)
Suppose $p(x) \in \mathbb{Z}[x]$ and $P(a)P(b)=-(a-b)^2$ for some distinct $a, b \in \mathbb{Z}$. Prove that $P(a)+P(b)=0$.
We choose random a unitary polynomial of degree $n$ and coefficients in the set $1,2,...,n!$. Prove that the probability for this polynomial to be special is between $0.71$ and $0.75$, where a polynomial $g$ is called special if for every $k>1$ in the sequence $f(1), f(2), f(3),...$ there are infinitely many numbers relatively prime with $k$.
Let $$P(x)=a_0x^n+a_1x^{n-1}+\ldots+a_n$$ where $a_0,\ldots,a_n$ are integers. Show that if $P$ takes the value $2020$ for four distinct integral values of $x$, then $P$ cannot take the value $2001$ for any integral value of $x$. [i]Proposed by Ángel Plaza[/i]
If the polynomials $f(x)$ and $g(x)$ are written on a blackboard then we can also write down the polynomials $f(x)\pm g(x)$, $f(x)g(x)$, $f(g(x))$ and $cf(x)$, where $c$ is an arbitrary real constant. The polynomials $x^3-3x^2+5$ and $x^2-4x$ are written on the blackboard. Can we write a nonzero polynomial of form $x^n-1$ after a finite number of steps?
Let $a$ be a positive integer, but not a perfect square; $r$ is a real root of the equation $x^3-2ax+1=0$. Prove that $ r+\sqrt{a}$ is an irrational number.