Let $ n$ be a nonzero positive integer. A set of persons is called a $ n$-balanced set if in any subset of $ 3$ persons there exists at least two which know each other and in each subset of $ n$ persons there are two which don't know each other. Prove that a $ n$-balanced set has at most $ (n \minus{} 1)(n \plus{} 2)/2$ persons.

Given a triangle $ABC$, let $D$ and $E$ be points on the side $BC$ such that $\angle BAD = \angle CAE$. If $M$ and $N$ are, respectively, the points of tangency of the incircles of the triangles $ABD$ and $ACE$ with the line $BC$, then show that \[\frac{1}{MB}+\frac{1}{MD}= \frac{1}{NC}+\frac{1}{NE}. \]

For a positive number $n$, we write $d (n)$ for the number of positive divisors of $n$. Determine all positive integers $k$ for which exist positive integers $a$ and $b$ with the property $k = d (a) = d (b) = d (2a + 3b)$.

The check for a luncheon of 3 sandwiches, 7 cups of coffee and one piece of pie came to $ \$3.15$. The check for a luncheon consisting of 4 sandwiches, 10 cups of coffee and one piece of pie came to $ \$4.20$ at the same place. The cost of a luncheon consisting of one sandwich, one cup of coffee, and one piece of pie at the same place will come to $ \textbf{(A)}\ \$1.70 \qquad \textbf{(B)}\ \$1.65 \qquad \textbf{(C)}\ \$1.20 \qquad \textbf{(D)}\ \$1.05 \qquad \textbf{(E)}\ \$0.95$

A triangle $\vartriangle ABC$ has $\angle B = 90^o$ . A circle is tangent to $AB$ at $B$ and also tangent to $AC$. Another circle is tangent to the first circle as well as the two sides $AB$ and $AC$. Suppose that $AB =\sqrt3$ and $BC = 3$. What is the radius of the second circle?

A tetrahedron $ABCD$ satisfies the following conditions: the edges $AB,AC$ and $AD$ are pairwise orthogonal, $AB=3$ and $CD=\sqrt2$. Find the minimum possible value of $$BC^6+BD^6-AC^6-AD^6.$$

The points $A_1,A_...,A_n$ lie on a circle with radius 1. The points $B_1,B_2,…,B_n$ are such that $B_i B_j<A_i A_j$ for $i\neq j$. Is it always true that the points $B_1,B_2,...,B_n$ lie on a circle with radius lesser than 1?

Let $n\geq 2$ is positive integer. Find the best constant $C(n)$ such that \[\sum_{i=1}^{n}x_{i}\geq C(n)\sum_{1\leq j<i\leq n}(2x_{i}x_{j}+\sqrt{x_{i}x_{j}})\] is true for all real numbers $x_{i}\in(0,1),i=1,...,n$ for which $(1-x_{i})(1-x_{j})\geq\frac{1}{4},1\leq j<i \leq n.$

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Construct a triangle knowing an angle, the ratio of the sides that form it and the radius of the inscribed circle.

Find the number of partitions of the set $\{1, 2, \cdots, n\}$ into three subsets $A_1,A_2,A_3$, some of which may be empty, such that the following conditions are satisfied: $(i)$ After the elements of every subset have been put in ascending order, every two consecutive elements of any subset have different parity. $(ii)$ If $A_1,A_2,A_3$ are all nonempty, then in exactly one of them the minimal number is even . [i]Proposed by Poland.[/i]

Let $ABCD$ be a trapezoid such that $AB \parallel CD$, $|BC|+|AD| = 7$, $|AB| = 9$ and $|BC| = 14$. What is the ratio of the area of the triangle formed by $CD$, angle bisector of $\widehat{BCD}$ and angle bisector of $\widehat{CDA}$ over the area of the trapezoid? $ \textbf{a)}\ \dfrac{9}{14} \qquad\textbf{b)}\ \dfrac{5}{7} \qquad\textbf{c)}\ \sqrt 2 \qquad\textbf{d)}\ \dfrac{49}{69} \qquad\textbf{e)}\ \dfrac 13 $

Does there exist an integer $ n > 1$ which satisfies the following condition? The set of positive integers can be partitioned into $ n$ nonempty subsets, such that an arbitrary sum of $ n \minus{} 1$ integers, one taken from each of any $ n \minus{} 1$ of the subsets, lies in the remaining subset.

[b]Problem 3[/b] Determine the set of real values of $x$ for which the following series converges, and find its sum: $$\sum_{n=1}^{\infty} \left(\sum_{\substack{k_1, k_2,\ldots , k_n \geq 0\\ 1\cdot k_1 + 2\cdot k_2+\ldots +n\cdot k_n = n}} \frac{(k_1+\ldots+k_n)!}{k_1!\cdot \ldots \cdot k_n!} x^{k_1+\ldots +k_n} \right) \ . $$

Alice and Bob play a game on a connected graph with $2n$ vertices, where $n\in \mathbb{N}$ and $n>1$.. Alice and Bob have tokens named A and B respectively. They alternate their turns with Alice going first. Alice gets to decide the starting positions of A and B. Every move, the player with the turn moves their token to an adjacent vertex. Bob's goal is to catch Alice, and Alice's goal is to prevent this. Note that positions of A, B are visible to both Alice and Bob at every moment. Provided they both play optimally, what is the maximum possible number of edges in the graph if Alice is able to evade Bob indefinitely? [i]Proposed by Shashank Ingalagavi and Vighnesh Sangle[/i]

Let $ABC$ be an obtuse-angled triangle with $ \angle ABC>90^{\circ}$, and let $(c)$ be its circumcircle. The internal angle bisector of $\angle BAC$ meets again the circle $(c)$ at the point $E$, and the line $BC$ at the point $D$. The circle of diameter $DE$ meets the circle $(c)$ at the point $H$. If the line $HE$ meets the line $BC$ at the point $K$, prove that: (a) the points $K, H, D$ and $A$ are concyclic (b) the line $AH$ passes through the point of intersection of the tangents to the circle $(c)$ at the points $B$ and $C$.

Prove that for each $\Delta ABC$ with an acute $\angle C$ the following inequality is true: $(a^2+b^2) cos(\alpha -\beta )\leq 2ab$.

In $\triangle ABC$, $AB = 30$, $BC = 40$, and $CA = 50$. Squares $A_1A_2BC$, $B_1B_2AC$, and $C_1C_2AB$ are erected outside $\triangle ABC$, and the pairwise intersections of lines $A_1A_2$, $B_1B_2$, and $C_1C_2$ are $P$, $Q$, and $R$. Compute the length of the shortest altitude of $\triangle PQR$. [i]Proposed by Lewis Chen[/i]

Four balls of radius 1 are mutually tangent, three resting on the floor and the fourth resting on the others. A tetrahedron, each of whose edges have length $s$, is circumscribed around the balls. Then $s$ equals $\text{(A)} \ 4\sqrt 2 \qquad \text{(B)} \ 4\sqrt 3 \qquad \text{(C)} \ 2\sqrt 6 \qquad \text{(D)} \ 1+2\sqrt 6 \qquad \text{(E)} \ 2+2\sqrt 6$

Show that there are no integers $x, y, z$, and $t$ such that $$\sqrt[3]{x^5 + y^5 + z^5 + t^5} = 2016.$$

$b,c$ are naturals. $b|c+1$ Prove that exists such natural $x,y,z$ that $x+y=bz,xy=cz$

Let $ABC$ be an equilateral triangle with side length $10$ and $P$ be a point inside the triangle such that $|PA|^2+ |PB|^2 + |PC|^2 = 128$. What is the area of a triangle with side lengths $|PA|,|PB|,|PC|$? $ \textbf{(A)}\ 6\sqrt 3 \qquad\textbf{(B)}\ 7 \sqrt 3 \qquad\textbf{(C)}\ 8 \sqrt 3 \qquad\textbf{(D)}\ 9 \sqrt 3 \qquad\textbf{(E)}\ 10 \sqrt 3 $

Find the linking coefficient of the phase trajectories of the equation of small oscillations $\ddot{x}=-4x$, $\ddot{y}=-9y$ on a level surface of the total energy.

In an international meeting of $n \geq 3$ participants, 14 languages are spoken. We know that: - Any 3 participants speak a common language. - No language is spoken more that by the half of the participants. What is the least value of $n$?

When the repeating decimal $ 0.363636\ldots$ is written in simplest fractional form, the sum of the numerator and denominator is: $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 45 \qquad \textbf{(C)}\ 114 \qquad \textbf{(D)}\ 135 \qquad \textbf{(E)}\ 150$