Found problems: 1782
Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.
Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that
\[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]
Let $G$ be a tournoment such that it's edges are colored either red or blue.
Prove that there exists a vertex of $G$ like $v$ with the property that, for every other vertex $u$ there is a mono-color directed path from $v$ to $u$.
Let $k$ be an even positive integer and define a sequence $<x_n>$ by \[ x_1= 1 , x_{n+1} = k^{x_n} +1. \] Show that $x_n ^2$ divides $x_{n-1}x_{n+1}$ for each $n \geq 2.$
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
(Eisentein's Criterion) Let $f(x)=a_{n}x^{n} +\cdots +a_{1}x+a_{0}$ be a nonconstant polynomial with integer coefficients. If there is a prime $p$ such that $p$ divides each of $a_{0}$, $a_{1}$, $\cdots$,$a_{n-1}$ but $p$ does not divide $a_{n}$ and $p^2$ does not divide $a_{0}$, then $f(x)$ is irreducible in $\mathbb{Q}[x]$.
Let $ n$ be a nonzero positive integer. Find $ n$ such that there exists a permutation $ \sigma \in S_{n}$ such that
\[ \left| \{ |\sigma(k) \minus{} k| \ : \ k \in \overline{1, n} \}\right | = n.\]
Find all functions $f: \mathbb{Q}^+ \to \mathbb{R}^+ $ with the property:
\[f(xy)=f(x+y)(f(x)+f(y)) \,,\, \forall x,y \in \mathbb{Q}^+\]
[i]Proposed by Nikolay Nikolov[/i]
Let $a_1,a_2,\ldots,a_k$ be real numbers and $a_1+a_2+\ldots+a_k=0$. Prove that
\[ \max_{1\leq i \leq k} a_i^2 \leq \frac{k}{3} \left( (a_1-a_2)^2+(a_2-a_3)^2+\cdots +(a_{k-1}-a_k)^2\right). \]
Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$.
(a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$.
(b) Show that $ a_{2008} \neq 0$
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
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]
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
Let $n$ be a fixed natural number. Find all natural numbers $ m$ for which
\[\frac{1}{a^n}+\frac{1}{b^n}\ge a^m+b^m\]
is satisfied for every two positive numbers $ a$ and $ b$ with sum equal to $2$.
Let $a_1,a_2,a_3,\ldots,a_n$ be a sequence of non-negative integers, where $n$ is a positive integer. Let
\[ A_n={a_1+a_2+\cdots+a_n\over n}\ . \]
Prove that
\[ a_1!a_2!\ldots a_n!\ge\left(\lfloor A_n\rfloor !\right)^n \]
where $\lfloor A_n\rfloor$ is the greatest integer less than or equal to $A_n$, and $a!=1\times 2\times\cdots\times a$ for $a\ge 1$(and $0!=1$). When does equality hold?
Consider a set of $1001$ points in the plane, no three collinear. Compute the minimum number of segments that must be drawn so that among any four points, we can find a triangle.
[i]Proposed by Ahaan S. Rungta / Amir Hossein[/i]
Let $a_0=5/2$ and $a_k=a_{k-1}^2-2$ for $k\ge 1.$ Compute \[\prod_{k=0}^{\infty}\left(1-\frac1{a_k}\right)\] in closed form.
Find all real-coefficient polynomials $f(x)$ which satisfy the following conditions:
[b]i.[/b] $f(x) = a_0 x^{2n} + a_2 x^{2n - 2} + \cdots + a_{2n - 2}
x^2 + a_{2n}, a_0 > 0$;
[b]ii.[/b] $\sum_{j=0}^n a_{2j} a_{2n - 2j} \leq \left(
\begin{array}{c}
2n\\
n\end{array} \right) a_0 a_{2n}$;
[b]iii.[/b] All the roots of $f(x)$ are imaginary numbers with no real part.
Given a sequence $(a_n)$, with $a_1 = 4$ and $a_{n+1} = a_n^2-2 (\forall n \in\mathbb{N})$, prove that there is a triangle with side lengths $a_{n-1}, a_n, a_{n+1},$ and that its area is equal to an integer.
Let $f:\mathbb{R}^+\to\mathbb{R}^+$ be a function that satisfies for all $x>y>0$
\[f(x+y)-f(x-y)=4\sqrt{f(x)f(y)}\]
a) Prove that $f(2x)=4f(x)$ for all $x>0$;
b) Find all such functions.
[i]Nikolai Nikolov, Oleg Mushkarov [/i]
Let $P_1$, $P_2$, $\ldots$, $P_{1993} = P_0$ be distinct points in the $xy$-plane
with the following properties:
(i) both coordinates of $P_i$ are integers, for $i = 1, 2, \ldots, 1993$;
(ii) there is no point other than $P_i$ and $P_{i+1}$ on the line segment joining $P_i$ with $P_{i+1}$ whose coordinates are both integers, for $i = 0, 1, \ldots, 1992$.
Prove that for some $i$, $0 \leq i \leq 1992$, there exists a point $Q$ with coordinates $(q_x, q_y)$ on the line segment joining $P_i$ with $P_{i+1}$ such that both $2q_x$ and $2q_y$ are odd integers.
Let $ \{x_n\}_{n\geq 1}$ be a sequences, given by $ x_1 \equal{} 1$, $ x_2 \equal{} 2$ and
\[ x_{n \plus{} 2} \equal{} \frac { x_{n \plus{} 1}^2 \plus{} 3 }{x_n} .
\]
Prove that $ x_{2008}$ is the sum of two perfect squares.
Two players play a game involving an $n \times n$ grid of chocolate. Each turn, a player may either eat a piece of chocolate (of any size), or split an existing piece of chocolate into two rectangles along a grid-line. The player who moves last loses. For how many positive integers $n$ less than $1000$ does the second player win?
(Splitting a piece of chocolate refers to taking an $a \times b$ piece, and breaking it into an $(a-c) \times b$ and a $c \times b$ piece, or an $a \times (b-d)$ and an $a \times d$ piece.)
[i]Proposed by Lewis Chen[/i]
Prove that for every real number $M$ there exists an infinite arithmetical progression of positive integers such that [list] [*] the common difference is not divisible by $10$, [*] the sum of digits of each term exceeds $M$. [/list]
We are given a finite set of segments of the same line. Prove that we can color each segment red or blue such that, for each point $p$ on the line, the number of red segments containing $p$ differs from the number of blue segments containing $p$ by at most $1$.