Found problems: 594
Find all natural numbers $k$ which can be represented as the sum of two relatively prime numbers not equal to $1$.
Given two positive integers $n$ and $k$, we say that $k$ is [i]$n$-ergetic[/i] if:
However the elements of $M=\{1,2,\ldots, k\}$ are coloured in red and green, there exist $n$ not necessarily distinct integers of the same colour whose sum is again an element of $M$ of the same colour. For each positive integer $n$, determine the least $n$-ergetic integer, if it exists.
For $k=1,2,\ldots ,2011$ we denote $S_k=\frac{1}{k}+\frac{1}{k+1}+\cdots +\frac{1}{2011}$.
Compute the sum $S_1+S_1^2+S_2^2+\cdots +S_{2011}^2$.
On the sides $PQ, QR, RP$ of $\vartriangle PQR$ segments $AB, CD, EF$ are drawn. Given a point $S_0$ inside triangle $\vartriangle PQR$, find the locus of points $S$ for which the sum of the areas of triangles $\vartriangle SAB$, $\vartriangle SCD$ and $\vartriangle SEF$ is equal to the sum of the areas of triangles $\vartriangle S_0AB$, $\vartriangle S_0CD$, $\vartriangle S0EF$. Consider separately the case $$\frac{AB}{PQ }= \frac{CD}{QR} = \frac{EF}{RP}.$$
(a) The numbers $1, 2,... , 100$ are divided into two groups so that the sum of all numbers in one group is equal to that in the other. Prove that one can remove two numbers from each group so that the sums of all numbers in each group are still the same.
(b) The numbers $1, 2 , ... , n$ are divided into two groups so that the sum of all numbers in one group is equal to that in the other . Is it true that for every such$ n > 4$ one can remove two numbers from each group so that the sums of all numbers in each group are still the same?
(A Shapovalov) [(a) for Juniors, (a)+(b) for Seniors]
In the rectangular coordinate system every point with integer coordinates is called laticeal point. Let $P_n(n, n + 5)$ be a laticeal point and denote by $f(n)$ the number of laticeal points on the open segment $(OP_n)$, where the point $0(0,0)$ is the coordinates system origine. Calculate the number $f(1) +f(2) + f(3) + ...+ f(2002) + f(2003)$.
Determine all even positive integers that can be written as the sum of odd composite positive integers.
Determine the smallest number $n \in Z_+$, which can be written as $n = \Sigma_{a\in A}a^2$, where $A$ is a finite set of positive integers and $\Sigma_{a\in A}a= 2014$.
In other words: what is the smallest positive number which can be written as a sum of squares of different positive integers summing to $2014$?
The fraction $\frac23$ can be eypressed as a sum of two distinct unit fractions: $\frac12 + \frac16$ .
Show that the fraction $\frac{p-1}{p}$ where $p\ge 5$ is a prime cannot be expressed as a sum of two distinct unit fractions.
John takes seven positive integers $a_1,a_2,...,a_7$ and writes the numbers $a_i a_j$, $a_i+a_j$ and $|a_i -a_j |$ for all $i \ne j$ on the blackboard. Find the greatest possible number of distinct odd integers on the blackboard.
Sixteen real numbers are arranged in a magic square of side $4$ so that the sum of numbers in each row, column or main diagonal equals $k$. Prove that the sum of the numbers in the four corners of the square is also $k$.
In a convex quadrilateral of area $1$, the sum of the lengths of all sides and diagonals is not less than $4+\sqrt 8$. Prove this.
The sequence $a_1, a_2, a_3, ...$ of positive reals is such that $\sum a_i$ diverges.
Show that there is a sequence $b_1, b_2, b_3, ...$ of positive reals such that $\lim b_n = 0$ and $\sum a_ib_i$ diverges.
For an integer $ n \geq 2 $, let $ s (n) $ be the sum of positive integers not exceeding $ n $ and not relatively prime to $ n $.
a) Prove that $ s (n) = \dfrac {n} {2} \left (n + 1- \varphi (n) \right) $, where $ \varphi (n) $ is the number of integers positive cannot exceed $ n $ and are relatively prime to $ n $.
b) Prove that there is no integer $ n \geq 2 $ such that $ s (n) = s (n + 2021) $
Let $p> 3$ be a prime number. Determine the number of all ordered sixes $(a, b, c, d, e, f)$ of positive integers whose sum is $3p$ and all fractions $\frac{a + b}{c + d},\frac{b + c}{d + e},\frac{c + d}{e + f},\frac{d + e}{f + a},\frac{e + f}{a + b}$ have integer values.
Let $n$ be any integer $\ge 2$. Prove that $\sum 1/pq = 1/2$, where the summation is over all integers$ p, q$ which satisfy $0 < p < q \le n$,$ p + q > n$, $(p, q) = 1$.
Is there a positive integer $n$ for which the following holds:
for an arbitrary rational $r$ there exists an integer $b$ and non-zero integers $a _1, a_2, ..., a_n$ such that $r=b+\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}$ ?
Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ .
What is the greatest possible value of $a_16$?
Given a positive integer $m$, a sequence of real numbers $a= (a_1,a_2,a_3,...)$ is called $m$-powerful if it satisfies
$$(\sum_{k=1}^{n} a_k )^{m} = \sum_{k=1}^{n} a_k^{m}$$for all positive integers $n$.
(a) Show that a sequence is $30$-powerful if and only if at most one of its terms is non-zero.
(b) Find a sequence none of whose terms are zero but which is $2017$-powerful.
For every natural number $n$ prove that $$\left( 1+ \frac12 + ...+ \frac1n \right)^2+ \left( \frac12 + ...+ \frac1n \right)^2+...+ \left( \frac{1}{n-1} + \frac12 \right)^2+ \left( \frac1n \right)^2=2n- \left( 1+ \frac12 + ...+ \frac1n \right)$$
(S. Manukian, Yerevan)
Let $M$ be a positive integer, and $A = \{1, 2,... , M + 1\}$. Show that if $f$ is a bijection from $A$ to $A$ then
$\sum_{n=1}^{M} \frac{1}{f(n) + f(n + 1)} > \frac{M}{M + 3}$
Calculate the sum $$\frac{1}{1+2^{-2006}}+...+ \frac{1}{1+2^{-1}}+ \frac{1}{1+2^{0}}+ \frac{1}{1+2^{1}}+...+ \frac{1}{1+2^{2006}}$$
Let $P$ be a point on the circumcircle of a square $ABCD$. Find all integers $n > 0$ such that the sum $$S_n(P) = |PA|^n + |PB|^n + |PC|^n + |PD|^n$$ is constant with respect to the point $P$.
Is it possible to paint all natural numbers in $6$ colors, for each one color to be used and the sum of any five numbers of different color to be painted in the sixth color?
Let $x_1,x_2,x_3,\ldots ,x_{100}$ be one hundred real numbers greater than or equal to $0$ and less than or equal to $1$. Find the maximum possible value of the sum$$S=x_1(1-x_2)+x_2(1-x_3)+x_3(1-x_4)+\cdots +x_{99}(1-x_{100})+x_ {100}(1-x_1).$$