Found problems: 594
Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.
Let $A$ be a subset with seven elements of the set $\{1,2,3, ...,26\}$.
Show that there are two distinct elements of $A$, having the same sum of their elements.
Among $2000$ distinct positive integers, there are equally many even and odd ones. The sum of the numbers is less than $3000000.$ Show that at least one of the numbers is divisible by $3.$
Find all possible values of $n \ge 1$ for which there exist $n$ consecutive positive integers whose sum is a prime number.
Let $n$ be an integer, $n \ge 2$. For each number $k = 1, 2, ....., n,$ denote by $a _ k$ the number of multiples of $k$ in the set $\{1, 2,. .., n \}$ and let $x _ k = \frac {1} {1} + \frac {1} {2} + \frac {1} {3} _... + \frac {1} {a _ k}$ .
Show that: $$\frac {x _ 1 + x _ 2 + ... + x _ n} {n} \le \frac {1} {1 ^ 2} + \frac {1} {2 ^ 2} + ... + \frac {1} {n ^ 2} $$.
Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?
Inside the circle with center $O$, points $A$ and $B$ are marked so that $OA = OB$. Draw a point $M$ on the circle from which the sum of the distances to points $A$ and $B$ is the smallest among all possible.
De ne the set $F$ as the following: $F = \{(a_1,a_2,... , a_{2006}) : \forall i = 1, 2,..., 2006, a_i \in \{-1,1\}\}$
Prove that there exists a subset of $F$, called $S$ which satis es the following:
$|S| = 2006$
and for all $(a_1,a_2,... , a_{2006})\in F$ there exists $(b_1,b_2,... , b_{2006}) \in S$, such that $\Sigma_{i=1} ^{2006}a_ib_i = 0$.
How many ways are there of representing a positive integer $n$ as the sum of three positive integers? Representations which differ only in the order of the summands are considered to be distinct.
Prove that $$\dfrac{1}{2+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}+\dfrac{1}{1+\dfrac{1}{1+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}}=1$$
This means
$1/(2+ (1/(3+ (1/(4+(...+1/1991))))))
+1/(1 + (1/(1 + (1/(3 + (1/(4 + (...+ 1/1991...)))))))) = 1.)$
(G. Galperin, Moscow-Tel Aviv)
The least common multiple of positive integers $a, b, c$ and $d$ is equal to $a + b + c + d$. Prove that $abcd$ is divisible by at least one of $3$ and $5$.
( V Senderov)
Each segment whose endpoints are the vertices of a given regular $100$-gon is colored red, if the number of vertices between its endpoints is even, and blue otherwise. (For example, all sides of the $100$-gon are red.) A number is placed in every vertex so that the sum of their squares is equal to $1$. On each segment the product of the numbers at its endpoints is written. The sum of the numbers on the blue segments is subtracted from the sum of the numbers on the red segments. What is the greatest possible result?
(Ilya Bogdanov)
Consider the cube with the vertices at the points $(\pm 1, \pm 1, \pm 1)$. Let $V_1,...,V_{95}$ be arbitrary points within this cube. Denote $v_i = \overrightarrow{OV_i}$, where $O = (0,0,0)$ is the origin. Consider the $2^{95}$ vectors of the form $s_1v_1 + s_2v_2 +...+ s_{95}v_{95}$, where $s_i = \pm 1$.
(a) If $d = 48$, prove that among these vectors there is a vector $w = (a, b, c)$ such that $a^2 + b^2 + c^2 \le 48$.
(b) Find a smaller $d$ (the smaller, the better) with the same property.
De fine the [i]distance [/i] between two $5$-digit numbers $\overline{a_1a_2a_3a_4a_5}$ and $\overline{b_1b_2b_3b_4b_5}$ to be the largest integer $j$ such that $a_j \ne b_j$ . (Example: the distance between $16523$ and $16452$ is $5$.) Suppose all $5$-digit numbers are written in a line in some order. What is the minimal possible sum of the distances of adjacent numbers in that written order?
Real numbers $x_1,x_2,...x_{2004},y_1,y_2,...y_{2004}$ differ from $1$ and are such that $x_ky_k=1$ for every $k=1,2,...,2004$. Calculate the sum
$$S=\frac{1}{1-x_1^3}+\frac{1}{1-x_2^3}+...+\frac{1}{1-x_{2004}^3}+\frac{1}{1-y_1^3}+\frac{1}{1-y_2^3}+...+\frac{1}{1-y_{2004}^3}$$
A sum of $335$ pairwise distinct positive integers equals $100000$.
a) What is the least number of uneven integers in that sum?
b) What is the greatest number of uneven integers in that sum?
Find $0/1 + 1/1 + 0/2 + 1/2 + 2/2 + 0/3 + 1/3 + 2/3 + 3/3 + 0/4 + 1/4 + 2/4 + 3/4 + 4/4 + 0/5 + 1/5 + 2/5 + 3/5 + 4/5 + 5/5 + 0/6 + 1/6 + 2/6 + 3/6 + 4/6 + 5/6 + 6/6$
Express the sum of $99$ terms$$\frac{1\cdot 4}{2\cdot 5}+\frac{2\cdot 7}{5\cdot 8}+\ldots +\frac{k(3k+1 )}{(3k-1)(3k+2)}+\ldots +\frac{99\cdot 298}{296\cdot 299}$$ as an irreducible fraction.
Can You fill the squares of the infinite cross-lined paper with integers so, that the sum of the numbers in every $4\times 6$ fields rectangle would be
a) $10$?
b) $1$?
Prove that the numbers $1,2,...,1998$ cannot be separated into three classes whose sums of elements are divisible by $2000,3999$, and $5998$, respectively.
A positive integer $m$ is called triangular if $m = 1 + 2 + ... + n$, for an integer $n$. Show that a positive integer $m$ is triangular if and only if $8m + 1$ is the square of an integer.
Let non-integer real numbers $a, b,c,d$ are given, such that the sum of each $3$ of them is integer. May it happen that $ab + cd$ is an integer.
Find all pairs of integers $(x, y)$ such that ths sum of the fractions $\frac{19}{x}$ and $\frac{96}{y}$ would be equal to their product.
Consider points $A, B, C$. Draw a line through $A$ so that the sum of distances from $B$ and $C$ to this line is equal to the length of a given segment.
Let $a, b, c$ be real numbers such that:
$$\frac{a}{b + c}+\frac{b}{c + a}+\frac{c}{a + b}= 1$$
Determine all values which the following expression can take :
$$\frac{a^2}{b + c}
+
\frac{b^2}{c + a}
+
\frac{c^2}{a + b}.$$