This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 594

Determine the positive integers $n \ge 3$ such that, for every integer $m \ge 0$, there exist integers $a_1, a_2,..., a_n$ such that $a_1 + a_2 +...+ a_n = 0$ and $a_1a_2 + a_2a_3 + ...+a_{n-1}a_n + a_na_1 = -m$ Alexandru Mihalcu
What is the smallest $N$ for which $\sum_{k=1}^{N} k^{2018}$ is divisible by $2018$?
Prove that $$\frac{2 }{2013 +1} +\frac{2^{2}}{2013^{2^{1}}+1} +\frac{2^{3}}{2013^{2^{2}}+1} + ...+ \frac{2^{2014}}{2013^{2^{2013}}+1} < \frac{1}{1006}$$
$49$ natural numbers are written on the board. All their pairwise sums are different. Prove that the largest of the numbers is greater than $600$. [hide=original wording in Russian]На доске написаны 49 натуральных чисел. Все их попарные суммы различны. Докажите, что наибольшее из чисел больше 600[/hide]
Two circles are tangent externally at one point. Common external tangents are drawn to them and the tangent points are connected. Prove that the sum of the lengths of the opposite sides of the quadrilateral obtained are equal.
Write $102$ as the sum of the largest number of distinct primes.
Prove that for every $ n = 2, 3, \ldots $ and any real numbers $ t_1, t_2, \ldots, t_n $, $ s_1, s_2, \ldots, s_n $, if $$ \sum_{i=1}^n t_i = 0, \text{ to } \sum_{i=1}^n\sum_{j=1}^n t_it_j |s_i-s_j| \leq 0.$$
Suppose one is given $n$ real numbers, not all zero, but such that their sum is zero. Prove that one can label these numbers $a_1, a_2, ..., a_n$ in such a manner that $a_1a_2 + a_2a_3 +...+a_{n-1}a_n + a_na_1 < 0$.
For a given integer $n \ge 4$ we examine whether there exists a table with three rows and $n$ columns which can be filled by the numbers $1, 2,...,, 3n$ such that $\bullet$ each row totals to the same sum $z$ and $\bullet$ each column totals to the same sum $s$. Prove: (a) If $n$ is even, such a table does not exist. (b) If $n = 5$, such a table does exist. (Gerhard J. Woeginger)
Let $d_1,d_2,d_3,d_4$ be the four smallest divisors of a positive integer $n$ (having at least four divisors). Find all $n$ such that $d_1^2+d_2^2+d_3^2+d_4^2 = n$.
Find all sets of $n\ge 2$ consecutive integers $\{a+1,a+2,...,a+n\}$ where $a\in Z$, in which one of the numbers is equal to the sum of all the others. (Bogdan Rublev)
Do there exist four polynomials $P_1(x), P_2(x), P_3(x), P_4(x)$ with real coefficients, such that the sum of any three of them always has a real root, but the sum of any two of them has no real root?
Every positive integer $n>2$ can be written as a sum of distinct positive integers. Let $A(n)$ be the maximal number of summands in such a representation. Find a formula for $A(n).$
$268$ numbers are written around a circle. The $17$th number is $3$, the $83$rd is $4$ and the $144$th is $9$. The sum of every $20$ consecutive numbers is $72$. Find the $210$th number.
On a chessboard a square is chosen . The sum of the squares of distances from its centre to the centre of all black squares is designated by $a$ and to the centre of all white squares by $b$. Prove that $a = b$. (A. Andj ans, Riga)
Let $n$ be a positive integer and let $a_1$, $a_2$,..., $a_n$ be positive integers from set $\{1, 2,..., n\}$ such that every number from this set occurs exactly once. Is it possible that numbers $a_1$, $a_1 + a_2 ,..., a_1 + a_2 + ... + a_n$ all have different remainders upon division by $n$, if: $a)$ $n=7$ $b)$ $n=8$
Prove that the sum of all numbers representable as $\frac{1}{mn}$, where $m,n$ -- natural numbers, $1 \le m < n \le1986$, is not an integer.
Show that the expression $(a + b + 1) (a + b - 1) (a - b + 1) (- a + b + 1)$, where $a =\sqrt{1 + x^2}$, $b =\sqrt{1 + y^2}$ and $x + y = 1$ is constant ¸and be calculated that constant value.
Endre wrote $n$ (not necessarily distinct) integers on a paper. Then for each of the $2^n$ subsets, Kelemen wrote their sum on the blackboard. a) For which values of $n$ is it possible that two different $n$-tuples give the same numbers on the blackboard? b) Prove that if Endre only wrote positive integers on the paper and Ferenc only sees the numbers on the blackboard, then he can determine which integers are on the paper.
Give are the integers $a_{1}=11 , a_{2}=1111, a_{3}=111111, ... , a_{n}= 1111...111$( with $2n$ digits) with $n > 8$ . Let $q_{i}= \frac{a_{i}}{11} , i= 1,2,3, ... , n$ the remainder of the division of $a_{i}$ by$ 11$ . Prove that the sum of nine consecutive quotients: $s_{i}=q_{i}+q_{i+1}+q_{i+2}+ ... +q_{i+8}$ is a multiple of $9$ for any $i= 1,2,3, ... , (n-8)$
A line segment $B_0B_n$ is divided into $n$ equal parts at points $B_1,B_2,...,B_{n-1} $ and $A$ is a point such that $\angle B_0AB_n$ is a right angle. Prove that : $$\sum_{k=0}^{n} |AB_k|^{2} = \sum_{k=0}^{n} |B_0B_k|^2$$
Consider a sequence of positive integers with total sum $20$ such that no number and no sum of a set of consecutive numbers is equal to $3$. Is it possible for such a sequence to contain more than $10$ numbers? (Alexandr Shapovalov)
Let $a_1 < a_2 < ... < a_n$ be a sequence of natural numbers such that for $i < j$ the decimal representation of $a_i$ does not occur as the leftmost digits of the decimal representation of $a_j$ . (For example, $137$ and $13729$ cannot both occur in the sequence.) Prove that $\sum_{i=1}^n \frac{1}{a_i} \le 1+\frac12 +\frac13 +...+\frac19$ .
The numerical sequence $x_1 , x_2 ,.. $ satisfies $x_1 = \frac12$ and $x_{k+1} =x^2_k+x_k$ for all natural integers $k$ . Find the integer part of the sum $\frac{1}{x_1+1}+\frac{1}{x_2+1}+...+\frac{1}{x_{100}+1}$ {A. Andjans, Riga)
Let $a_1, a_2,...,a_{2005}, b_1, b_2,...,b_{2005}$ be real numbers such that $(a_ix - b_i)^2 \ge \sum_{j\ne i,j=1}^{2005} (a_jx - b_j)$ for all real numbers x and every integer $i$ with $1 \le i \le 2005$. What is maximal number of positive $a_i$'s and $b_i$'s?