Found problems: 85335
$37$ points are arbitrarily marked on the plane. Prove that among them there must be either two points at a distance greater than $6$, or two points at a distance less than $1.5$.
Let $n$ be a positive integer and $a_1, a_2, \dots, a_n$ non-zero real numbers. What is the least number of non-zero coefficients that the polynomial $P(x) = (x - a_1)(x - a_2)\cdots(x - a_n)$ can have?
Is it possible to color positive integers with three colors so that whenever two numbers with different colors are added, the result of their addition is the third color? (All three colors must be used.) If the answer is yes, indicate a possible coloration; if not, explain why.
If $ x$ is a real number such that $ x^2\minus{}x$ and $ x^n\minus{}x$ are integers for some $ n \ge 3$, prove that $ x$ is an integer.
Prove that for each $ a\in\mathbb N$, there are infinitely many natural $ n$, such that
\[ n\mid a^{n \minus{} a \plus{} 1} \minus{} 1.
\]
A $3 \times 3$ grid of unit cells is given. A [i]snake of length $k$[/i] is an animal which occupies an ordered $k$-tuple of cells in this grid, say $(s_1, \dots, s_k)$. These cells must be pairwise distinct, and $s_i$ and $s_{i+1}$ must share a side for $i = 1, \dots, k-1$. After being placed in a finite $n \times n$ grid, if the snake is currently occupying $(s_1, \dots, s_k)$ and $s$ is an unoccupied cell sharing a side with $s_1$, the snake can [i]move[/i] to occupy $(s, s_1, \dots, s_{k-1})$ instead. The snake has [i]turned around[/i] if it occupied $(s_1, s_2, \dots, s_k)$ at the beginning, but after a finite number of moves occupies $(s_k, s_{k-1}, \dots, s_1)$ instead.
Find the largest integer $k$ such that one can place some snake of length $k$ in a $3 \times 3$ grid which can turn around.
You are somewhere on a ladder with $5$ rungs. You have a fair coin and an envelope that contains either a double-headed coin or a double-tailed coin, each with probability $1/2$. Every minute you flip a coin. If it lands heads you go up a rung, if it lands tails you go down a rung. If you move up from the top rung you win, if you move down from the bottom rung you lose. You can open the envelope at any time, but if you do then you must immediately flip that coin once, after which you can use it or the fair coin whenever you want. What is the best strategy (i.e. on what rung(s) should you open the envelope)?
Find the number of integers $n > 1$ which divide $a^{25} - a$ for every integer $a$.
Consider a graph $G$ with $n$ vertices and at least $n^2/10$ edges. Suppose that each edge is colored in one of $c$ colors such that no two incident edges have the same color. Assume further that no cycles of size $10$ have the same set of colors. Prove that there is a constant $k$ such that $c$ is at least $kn^\frac{8}{5}$ for any $n$.
[i]David Yang.[/i]
Given that there are $24$ primes between $3$ and $100$, inclusive, what is the number of ordered pairs $(p, a)$ with $p$ prime, $3 \le p < 100$, and $1 \le a < p$ such that the sum
\[a+a^2+a^3+\cdots+a^{(p-2)!} \]is not divisible by $p$?
For positive integers $n$ and $k$, let $\mho(n,k)$ be the number of distinct prime divisors of $n$ that are at least $k$. For example, $\mho(90, 3)=2$, since the only prime factors of $90$ that are at least $3$ are $3$ and $5$. Find the closest integer to
\[\sum_{n=1}^\infty \sum_{k=1}^\infty \frac{\mho(n,k)}{3^{n+k-7}}.\]
[i]Proposed by Daniel Zhu.[/i]
Lance, Sally, Joy and Fred are chosen for the team. In how many ways can the three starters be chosen?
$\textbf{(A)} 2 \qquad\textbf{(B)} 4 \qquad\textbf{(C)} 6 \qquad\textbf{(D)} 8 \qquad\textbf{(E)} 10$
Let $X$ be an arbitrary point on side $BC$ of triangle $ABC$. Triangle $T$ is formed by the angle bisectors of the angles $\angle ABC$, $\angle ACB$ and $\angle AXC$. Prove that the circle circumscribed around the triangle $T$, passes through the vertex $A$.
(Dmytro Prokopenko)
Let $ABCD$ be a quadrilateral and let $\Gamma$ be a circle of center $O$ that is internally tangent to its four sides. If $M$ is the midpoint of $AC$ and $N$ is the midpoint of $BD$, prove that $M,O, N$ are collinear.
Find all prime numbers $p$ for which one can find a positive integer $m$ and nonnegative integers $a_0,a_1,...,a_m$ less than $p$ such that $$\begin{cases} a_0+a_1p+...+a_{m-1}p^{m-1}+a_{m}p^{m} = 2013 \\
a_0+a_1+...+a_{m-1}+a_{m} = 11\end{cases}$$
For any nonnegative integer $ n$, let $ f(n)$ be the greatest integer such that $ 2^{f(n)} | n \plus{} 1$. A pair $ (n, p)$ of nonnegative integers is called nice if $ 2^{f(n)} > p$. Find all triples $ (n, p, q)$ of nonnegative integers such that the pairs $ (n, p)$, $ (p, q)$ and $ (n \plus{} p \plus{} q, n)$ are all nice.
Let $ABC$ be an equilateral triangle. Let $Q$ be a random point on $BC$, and let $P$ be the meeting point of $AQ$ and the circumscribed circle of $\triangle ABC$.
Prove that $\frac{1}{PQ}=\frac{1}{PB}+\frac{1}{PC}$.
Let $M=\{(x,y)||xy|=1,x>0\},N=\{(x,y)|\arctan x+\arctan y=\pi\}$. Which one is right?
$\text{(A)}M\cup N=\{(x,y)||xy|=1\}\qquad\text{(B)}M\cup N=M$
$\text{(C)}M\cup N=N\qquad\text{(D)}M\cup N=\{(x,y)||xy|=1,x,y\text{ cannot be negative the same time}\}$
Let $n$ be an even positive integer. Show that there is a permutation $\left(x_{1},x_{2},\ldots,x_{n}\right)$ of $\left(1,\,2,\,\ldots,n\right)$ such that for every $i\in\left\{1,\ 2,\ ...,\ n\right\}$, the number $x_{i+1}$ is one of the numbers $2x_{i}$, $2x_{i}-1$, $2x_{i}-n$, $2x_{i}-n-1$. Hereby, we use the cyclic subscript convention, so that $x_{n+1}$ means $x_{1}$.
a) Find two sets $X,Y$ such that $X\cap Y =\emptyset$, $X\cup Y = \mathbb Q^{\star}_{+}$ and $Y = \{a\cdot b \mid a,b \in X \}$.
b) Find two sets $U,V$ such that $U\cap V =\emptyset$, $U\cup V = \mathbb R$ and $V = \{x+y \mid x,y \in U \}$.
Let $A_i$ and $A_i^{'}$ $(i=1,2,3,4)$ be diametrically opposite vertexes of a rectangular cuboid and $M{}$ a point inside it. Prove that $S\leq\sum_{i=1}^{4}MA_i\cdot MA_i^{'}$, where $S{}$ is the total surface area of the rectangular cuboid.
Cyclic quadrilateral $ABCD$ has $AC=AD=5, CD=6,$ and $AB=BC.$ If the length of $AB$ can be expressed as $\frac{a\sqrt{b}}{c}$ where $a,c$ are relatively prime positive integers and $b$ is square-fre,e evaluate $a+b+c.$
[i]Proposed by Ada Tsui[/i]
An integer $n\geq 2$ having exactly $s$ positive divisors $1=d_1<d_2<\cdots<d_s=n$ is said to be [i]good[/i] if there exists an integer $k$, with $2\leq k\leq s$, such that $d_k>1+d_1+\cdots+d_{k-1}$. An integer $n\geq 2$ is said to be [i]bad[/i] if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than $2$, there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ .
[i]Proposed by Austria[/i]
Let $I$ be an open interval of length $\frac{1}{n}$, where $n$ is a positive integer. Find the maximum possible number of rational numbers of the form $\frac{a}{b}$ where $1 \le b \le n$ that lie in $I$.