Found problems: 127
Let $T$ be a real number satisfying the property:
For any nonnegative real numbers $a, b, c,d, e$ with their sum equal to $1$, it is possible to arrange them around a circle such that the products of any two neighboring numbers are no greater than $T$.
Determine the minimum value of $T$.
We denote by gcd (...) the greatest common divisor of the numbers in (...). (For example, gcd$(4, 6, 8)=2$ and gcd $(12, 15)=3$.) Suppose that positive integers $a, b, c$ satisfy the following four conditions:
$\bullet$ gcd $(a, b, c)=1$,
$\bullet$ gcd $(a, b + c)>1$,
$\bullet$ gcd $(b, c + a)>1$,
$\bullet$ gcd $(c, a + b)>1$.
a) Is it possible that $a + b + c = 2015$?
b) Determine the minimum possible value that the sum $a+ b+ c$ can take.
The positive differences $a_i-a_j$ of five different positive integers $a_1, a_2, a_3, a_4, a_5$ are all different (there are altogether $10$ such differences). Find the least possible value of the largest number among the $a_i$.
For positive integers $n \ge 3$ and $r \ge 1$, define $$P(n, r) = (n - 2)\frac{r^2}{2} - (n - 4) \frac{r}{2}$$
We call a triple $(a, b, c)$ of natural numbers, with $a \le b \le c$, an $n$-gonal Pythagorean triple if $P(n, a)+P(n, b) = P(n, c)$. (For $n = 4$, we get the usual Pythagorean triple.)
(a) Find an $n$-gonal Pythagorean triple for each $n \ge 3$.
(b) Consider all triangles $ABC$ whose sides are $n$-gonal Pythagorean triples for some $n \ge 3$. Find the maximum and the minimum possible values of angle $C$.
$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]
Georg and his mother love pizza. They buy a pizza shaped as an equilateral triangle. Georg demands to be allowed to divide the pizza by a straight cut and then make the first choice. The mother accepts this reluctantly, but she wants to choose a point of the pizza through which the cut must pass. Determine the largest fraction of the pizza which the mother is certain to get by this procedure.
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?
In a certain language there are $n$ letters. A sequence of letters is a word, if there are no two equal letters between two other equal letters. Find the number of words of the maximum length.
Given a circle $\gamma$ and a point $P$ inside it, find the maximum and minimum value of the sum of the lengths of two perpendicular chords of $\gamma$ passing through $P$.
Let $N$ be the set of positive integers.
Find all the functions $f: N\to N$ with $f (1) = 2$ and such that $max \{f(m)+f(n), m+n\}$ divides $min\{2m+2n,f (m+ n)+1\}$ for all $m, n$ positive integers
$a_1, a_2, ... , a_n$ are constants such that $f(x) = 1 + a_1 cos x + a_2 cos 2x + ...+ a_n cos nx \ge 0$ for all $x$. We seek estimates of $a_1$. If $n = 2$, find the smallest and largest possible values of $a_1$. Find corresponding estimates for other values of $n$.
Two given circles $k_1$ and $k_2$ intersect at points $P$ and $Q$.
Construct a segment $AB$ through $P$ with the endpoints at $k_1$ and $k_2$ for which $AP \cdot PB$ is maximal.
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.
The function $f : (0,1) \to R$ is defined by
$f(x) = x$ if $x$ is irrational,
$f(x) = \frac{p+1}{q}$ if $x =\frac{p}{q}$ , where $(p,q) = 1$.
Find the maximum value of $f$ on the interval $(7/8,8/9)$.
Find the minimum and the maximum value of the expression $\sqrt{4 -a^2} +\sqrt{4 -b^2} +\sqrt{4 -c^2}$
where $a,b, c$ are positive real numbers satisfying the condition $a^2 + b^2 + c^2=6$
Three line segments, all of length $1$, form a connected figure in the plane. Any two different line segments can intersect only at their endpoints. Find the maximum area of the convex hull of the figure.
The convex polygon $A_1A_2...A_n$ is given in the plane. Denote by $T_k$ $(k \le n)$ the convex $k$-gon of the largest area, with vertices at the points $A_1, A_2, ..., A_n$ and by $T_k(A+1)$ the convex k-gon of the largest area with vertices at the points $A_1, A_2, ..., A_n$ in which one of the vertices is in $A_1$. Set the relationship between the order of arrangement in the sequence $A_1, A_2, ..., A_n$ vertices:
1) $T_3$ and $T_3 (A_2)$
2) $T_k$ and $T_k (A_1) $
3) $T_k$ and $T_{k+1}$
Let $X$ be a subset of $R_{+}^{*}$ with $m$ elements.
Find $X$ such that the number of subsets with the same sum is maximum.
Let $m,n$ be positive integers with $m \le n$, and let $F$ be a family of $m$-element subsets of $\{1,2,...,n\}$ satisfying $A \cap B \ne \varnothing$ for all $A,B \in F$. Determine the maximum possible number of elements in $F$.
The non-negative real numbers $x, y, z$ satisfy the equality $x + y + z = 1$.
Determine the highest possible value of the expression $E (x, y, z) = (x + 2y + 3z) (6x +3y + 2z)$.
Consider non-negative real numbers $a, b, c$ satisfying the condition $a^2 + b^2 + c^2 = 2$ . Find the maximum value of the following expression $$P=\frac{\sqrt{b^2+c^2}}{3-a}+\frac{\sqrt{c^2+a^2}}{3-b}+a+b-2022c$$
The product of $10$ integers is $1024$. What is the greatest possible sum of these $10$ integers?
Let $a, b, c, d$ be integers such that $a > b > c > d \ge -2021$ and $$\frac{a + b}{b + c}=\frac{c + d}{d + a}$$ (and $b + c \ne 0 \ne d + a$). What is the maximum possible value of $ac$?
Find the maximum value of $k$ for which one can choose $k$ integers out of $1,2... ,2n$ so that none of them divides another one.
There are $300$ participants to a mathematics competition. After the competition some of the contestants play some games of chess. Each two contestants play at most one game against each other. There are no three contestants, such that each of them plays against each other. Determine the maximum value of $n$ for which it is possible to satisfy the following conditions at the same time: each contestant plays at most $n$ games of chess, and for each $m$ with $1 \le m \le n$, there is a contestant playing exactly $m$ games of chess.