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

1988 Mexico National Olympiad, 7

Two disjoint subsets of the set $\{1,2, ... ,m\}$ have the same sums of elements. Prove that each of the subsets $A,B$ has less than $m / \sqrt2$ elements.

2013 May Olympiad, 1

Tags: number theory , sum
Find the number of ways to write the number $2013$ as the sum of two integers greater than or equal to zero so that when adding there is no carry over. Clarification: In the sum $2008+5=2013$ there is carry over from the units to the tens

2004 Thailand Mathematical Olympiad, 19

Tags: algebra , sum , max , inequalities
Find positive reals $a, b, c$ which maximizes the value of $a+ 2b+ 3c$ subject to the constraint that $9a^2 + 4b^2 + c^2 = 91$

1992 Bundeswettbewerb Mathematik, 2

A positive integer $n$ is called [i]good [/i] if they sum up in one and only one way at least of two positive integers whose product also has the value $n$. Here representations that differ only in the order of the summands are considered the same viewed. Find all good positive integers.

1984 Polish MO Finals, 4

A coin is tossed $n$ times, and the outcome is written in the form ($a_1,a_2,...,a_n$), where $a_i = 1$ or $2$ depending on whether the result of the $i$-th toss is the head or the tail, respectively. Set $b_j = a_1 +a_2 +...+a_j$ for $j = 1,2,...,n$, and let $p(n)$ be the probability that the sequence $b_1,b_2,...,b_n$ contains the number $n$. Express $p(n)$ in terms of $p(n-1)$ and $p(n-2)$.

2000 Singapore Team Selection Test, 3

Tags: sum , number theory
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$.

1995 Poland - Second Round, 4

Positive real numbers $x_1,x_2,...,x_n$ satisfy the condition $\sum_{i=1}^n x_i \le \sum_{i=1}^n x_i ^2$ . Prove the inequality $\sum_{i=1}^n x_i^t \le \sum_{i=1}^n x_i ^{t+1}$ for all real numbers $t > 1$.

2005 BAMO, 1

An integer is called [i]formidable[/i] if it can be written as a sum of distinct powers of $4$, and [i]successful [/i] if it can be written as a sum of distinct powers of $6$. Can $2005$ be written as a sum of a [i]formidable [/i] number and a [i]successful [/i] number? Prove your answer.

2009 Kyiv Mathematical Festival, 5

Assume that a triangle $ABC$ satisfies the following property: For any point from the triangle, the sum of distances from $D$ to the lines $AB,BC$ and $CA$ is less than $1$. Prove that the area of the triangle is less than or equal to $\frac{1}{\sqrt3}$

1960 Poland - Second Round, 1

Prove that if the real numbers $ a $ and $ b $ are not both equal to zero, then for every natural $ n $ $$ a^{2n} + a^{2n-1}b + a^{2n-2} b^2 + \ldots + ab^{2n-1} + b^{2n} > 0. $$

2018 Estonia Team Selection Test, 3

Tags: sum , algebra , inequalities , max , min
Given a real number $c$ and an integer $m, m \ge 2$. Real numbers $x_1, x_2,... , x_m$ satisfy the conditions $x_1 + x_2 +...+ x_m = 0$ and $\frac{x^2_1 + x^2_2 + ...+ x^2_m}{m}= c$. Find max $(x_1, x_2,..., x_m)$ if it is known to be as small as possible.

1999 Czech And Slovak Olympiad IIIA, 3

Tags: median , sum , ratio , geometry
Show that there exists a triangle $ABC$ such that $a \ne b$ and $a+t_a = b+t_b$, where $t_a,t_b$ are the medians corresponding to $a,b$, respectively. Also prove that there exists a number $k$ such that every such triangle satisfies $a+t_a = b+t_b = k(a+b)$. Finally, find all possible ratios $a : b$ in such triangles.

1945 Moscow Mathematical Olympiad, 095

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.

1984 All Soviet Union Mathematical Olympiad, 377

$n$ natural numbers ($n>3$) are written on the circumference. The relation of the two neighbours sum to the number itself is a whole number. Prove that the sum of those relations is a) not less than $2n$ b) less than $3n$

2019 Hanoi Open Mathematics Competitions, 10

For any positive integer $n$, let $r_n$ denote the greatest odd divisor of $n$. Compute $T =r_{100}+ r_{101} + r_{102}+...+r_{200}$

2018 Lusophon Mathematical Olympiad, 1

Tags: sum , algebra
Fill in the corners of the square, so that the sum of the numbers in each one of the $5$ lines of the square is the same and the sum of the four corners is $123$.

2013 India PRMO, 20

Tags: number theory , sum
What is the sum (in base $10$) of all the natural numbers less than $64$ which have exactly three ones in their base $2$ representation?

2009 Greece JBMO TST, 4

Find positive real numbers $x,y,z$ that are solutions of the system $x+y+z=xy+yz+zx$ and $xyz=1$ , and have the smallest possible sum.

1995 Czech and Slovak Match, 4

For each real number $p > 1$, find the minimum possible value of the sum $x+y$, where the numbers $x$ and $y$ satisfy the equation $(x+\sqrt{1+x^2})(y+\sqrt{1+y^2}) = p$.

1939 Moscow Mathematical Olympiad, 045

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.

2020 Bundeswettbewerb Mathematik, 4

In each cell of a table with $m$ rows and $n$ columns, where $m<n$, we put a non-negative real number such that each column contains at least one positive number. Show that there is a cell with a positive number such that the sum of the numbers in its row is larger than the sum of the numbers in its column.

1954 Moscow Mathematical Olympiad, 281

*. Positive numbers $x_1, x_2, ..., x_{100}$ satisfy the system $$\begin{cases} x^2_1+ x^2_2+ ... + x^2_{100} > 10 000 \\ x_1 + x_2 + ...+ x_{100} < 300 \end{cases}$$ Prove that among these numbers there are three whose sum is greater than $100$.

2015 Czech-Polish-Slovak Junior Match, 2

Decide if the vertices of a regular $30$-gon can be numbered by numbers $1, 2,.., 30$ in such a way that the sum of the numbers of every two neighboring to be a square of a certain natural number.

1996 Mexico National Olympiad, 5

The numbers $1$ to $n^2$ are written in an n×n squared paper in the usual ordering. Any sequence of right and downwards steps from a square to an adjacent one (by side) starting at square $1$ and ending at square $n^2$ is called a path. Denote by $L(C)$ the sum of the numbers through which path $C$ goes. (a) For a fixed $n$, let $M$ and $m$ be the largest and smallest $L(C)$ possible. Prove that $M-m$ is a perfect cube. (b) Prove that for no $n$ can one find a path $C$ with $L(C ) = 1996$.

2010 Ukraine Team Selection Test, 12

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}$ ?