Found problems: 252
Let $x_1, ..., x_n$ ($n \ge 2$) be real numbers from the interval $[1, 2]$. Prove that
$|x_1 - x_2| + ... + |x_n - x_1| \le \frac{2}{3}(x_1 + ... + x_n)$,
with equality holding if and only if $n$ is even and the $n$-tuple $(x_1, x_2, ..., x_{n - 1}, x_n)$ is equal to $(1, 2, ..., 1, 2)$ or $(2, 1, ..., 2, 1)$.
Find all real polynomials $ g(x)$ of degree at most $ n \minus{} 3$, $ n\geq 3$, knowing that all the roots of the polynomial $ f(x) \equal{} x^n \plus{} nx^{n \minus{} 1} \plus{} \frac {n(n \minus{} 1)}2 x^{n \minus{} 2} \plus{} g(x)$ are real.
How many real solutions are there to the equation $ |x \minus{} |2x \plus{} 1\parallel{} \equal{} 3.$ (Here, $ |x|$ denotes the absolute value of $ x$: i.e., if $ x \geq 0,$ then $ |x| \equal{} |\minus{}x| \equal{} x.$)
A. 0
B. 1
C. 2
D. 3
E. 4
Consider the determinant of the matrix $(a_{ij})_{ij}$ with $1\leq i,j \leq 100$ and $a_{ij}=ij.$ Prove that if the absolute value of each of the $100!$ terms in the expansion of this determinant is divided by $101,$ then the remainder is always $1.$
Find the median value of $m$ over all integers $m$ where $|m^2 + 8m - 65|$ is a perfect power. A perfect power is any integer at least $2$ which can be written as $a^b$, where $a$, $b$ are integers and $b \ge 2$.
[i]Individual #9[/i]
We write $1$ or $-1$ on each unit square of a $2007 \times 2007$ board. Find the number of writings such that for every square on the board the absolute value of the sum of numbers on the square is less then or equal to $1$.
A game is played on a board with an infinite row of holes labelled $0, 1, 2, \dots$. Initially, $2009$ pebbles are put into hole $1$; the other holes are left empty. Now steps are performed according to the following scheme:
(i) At each step, two pebbles are removed from one of the holes (if possible), and one pebble is put into each of the neighbouring holes.
(ii) No pebbles are ever removed from hole $0$.
(iii) The game ends if there is no hole with a positive label that contains at least two pebbles.
Show that the game always terminates, and that the number of pebbles in hole $0$ at the end of the game is independent of the specific sequence of steps. Determine this number.
How many integers with four different digits are there between $1,000$ and $9,999$ such that the absolute value of the difference between the first digit and the last digit is $2$?
$\textbf {(A) } 672 \qquad \textbf {(B) } 784 \qquad \textbf {(C) } 840 \qquad \textbf {(D) } 896 \qquad \textbf {(E) } 1008$
Find the minimum value of \[|\sin{x} + \cos{x} + \tan{x} + \cot{x} + \sec{x} + \csc{x}|\] for real numbers $x$.
Let $m$ be a positive integer. Determine the smallest positive integer $n$ for which there exist real numbers $x_1, x_2,...,x_n \in (-1, 1)$ such that $|x_1| + |x_2| +...+ |x_n| = m + |x_1 + x_2 + ... + x_n|$.
Find the smallest value of the expression $|3 \cdot 5^m - 11 \cdot 13^n|$ for all $m,n \in N$.
(Folklore)
Each integer is colored with one of two colors, red or blue. It is known that, for every finite set $A$ of consecutive integers, the absolute value of the difference between the number of red and blue integers in the set $A$ is at most $1000$. Prove that there exists a set of $2000$ consecutive integers in which there are exactly $1000$ red numbers and $1000$ numbers blue.
What is the sum of all real numbers $x$ for which $|x^2-12x+34|=2?$
$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 25$
Given an integer $ n > 3.$ Let $ a_{1},a_{2},\cdots,a_{n}$ be real numbers satisfying $ min |a_{i} \minus{} a_{j}| \equal{} 1, 1\le i\le j\le n.$ Find the minimum value of $ \sum_{k \equal{} 1}^n|a_{k}|^3.$
Say that a complex number $z$ is [i]three-presentable[/i] if there is a complex number $w$ of absolute value $3$ such that $z = w - \frac{1}{w}$. Let $T$ be the set of all three-presentable complex numbers. The set $T$ forms a closed curve in the complex plane. What is the area inside $T$?
Let $n$ be a positive integer and let $(a_1,a_2,\ldots ,a_{2n})$ be a permutation of $1,2,\ldots ,2n$ such that the numbers $|a_{i+1}-a_i|$ are pairwise distinct for $i=1,\ldots ,2n-1$.
Prove that $\{a_2,a_4,\ldots ,a_{2n}\}=\{1,2,\ldots ,n\}$ if and only if $a_1-a_{2n}=n$.
Let $f : \mathbb{C} \to \mathbb{C} $ be defined by $ f(z) = z^2 + iz + 1 $. How many complex numbers $z $ are there such that $ \text{Im}(z) > 0 $ and both the real and the imaginary parts of $f(z)$ are integers with absolute value at most $ 10 $?
${ \textbf{(A)} \ 399 \qquad \textbf{(B)} \ 401 \qquad \textbf{(C)} \ 413 \qquad \textbf{(D}} \ 431 \qquad \textbf{(E)} \ 441 $
Find for which values of $n$, an integer larger than $1$ but smaller than $100$, the following expression has its minimum value:
$S = |n-1| + |n-2| + \ldots + |n-100|$
If $\left|x\right|-x+y=42$ and $x+\left|y\right|+y=24$, then what is the value of $x+y$? Express your answer in simplest terms.
$\text{(A) }-4\qquad\text{(B) }\frac{26}{5}\qquad\text{(C) }6\qquad\text{(D) }10\qquad\text{(E) }18$
$101$ distinct numbers are chosen among the integers between $0$ and $1000$. Prove that, among the absolute values of their pairwise differences, there are ten different numbers not exceeding $100$.
Determine the absolute value of the sum \[ \lfloor 2013\sin{0^\circ} \rfloor + \lfloor 2013\sin{1^\circ} \rfloor + \cdots + \lfloor 2013\sin{359^\circ} \rfloor, \] where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.
(You may use the fact that $\sin{n^\circ}$ is irrational for positive integers $n$ not divisible by $30$.)
[i]Ray Li[/i]
Suppose that $|x+y|+|x-y|=2$. What is the maximum possible value of $x^2-6x+y^2$?
$ \textbf{(A)}\ 5 \qquad
\textbf{(B)}\ 6 \qquad
\textbf{(C)}\ 7 \qquad
\textbf{(D)}\ 8 \qquad
\textbf{(E)}\ 9
$
Numbers from$ 1$ to $8$ were written at the vertices of the cube, and on each edge the absolute value of the difference between the numbers at its ends.. What is the smallest number of different numbers that can be written on the edges?
Let $M$ be a finite sum of numbers, such that among any three of its elements there are two whose sum belongs to $M$. Find the greatest possible number of elements of $M$.
Calculate $ \int \frac {dx}{x^{2008}(1 \minus{} x)}$