Let $\{a,b,c\}\in \mathbb{R}^{+}$. Prove that $a^a b^b c^c \ge (abc)^{\frac{a+b+c}{3}}$.

Nine points form a grid of size $3\times 3$. How many triangles are there with $3$ vertices at these points?

Given triangle $ABC$. Consider lines $l$ with the next property: the reflections of $l$ in the sidelines of the triangle concur. Prove that all these lines have a common point.

Given is a non-isosceles triangle $ABC$ with $\angle ABC=60^{\circ}$, and in its interior, a point $T$ is selected such that $\angle ATC= \angle BTC=\angle BTA=120^{\circ}$. Let $M$ the intersection point of the medians in $ABC$. Let $TM$ intersect $(ATC)$ at $K$. Find $TM/MK$.

In a country there are $2021$ cities. Each pair of cities is either linked by a single road or not linked at all. It is known that for any subset of $2019$ cities, the total number of roads between them is the same. If the total number of roads in that country is $A$, find all possible values of $A$.

The teacher drew a coordinate plane on the board and marked some points on this plane. Unfortunately, Vasya's second-grader, who was on duty, erased almost the entire drawing, except for two points $A (1, 2)$ and $B (3,1)$. Will the excellent Andriyko be able to follow these two points to construct the beginning of the coordinate system point $O (0, 0)$? Point A on the board located above and to the left of point $B$.

The arithmetic mean (ordinary average) of the fifty-two successive positive integers beginning with $2$ is: $\textbf{(A) }27\qquad \textbf{(B) }27\tfrac14\qquad \textbf{(C) }27\tfrac12\qquad \textbf{(D) }28\qquad \textbf{(E) }28\tfrac12$

Let $d$ be a positive integer and let $\varepsilon$ be any positive real. Prove that for all sufficiently large primes $p$ with $\gcd(p-1,d) \neq 1$, there exists an positive integer less than $p^r$ which is not a $d$th power modulo $p$, where $r$ is defined by \[ \log r = \varepsilon - \frac{1}{\gcd(d,p-1)}. \][i]Proposed by Shashwat Kishore[/i]

Determine all positive integers that cannot be written as $\frac{a}{b} + \frac{a+1}{b+1}$ where $a$ and $b$ are positive integers.

Prove that for every partition of $ \{ 1,2,3,4,5,6,7,8,9\} $ into two subsets, one of the subsets contains three numbers such that the sum of two of them is equal to the double of the third.

Calculate $1 + 3 + 5 +\cdots+ 195 + 197 + 199$

Sequence of positive integers $\{x_k\}_{k\geq 1}$ is given such that $x_1=1$ and for all $n\geq 1$ we have $$x_{n+1}^2+P(n)=x_n x_{n+2}$$ where $P(x)$ is a polynomial with non-negative integer coefficients. Prove that $P(x)$ is the constant polynomial. Proposed by [i]Navid Safaei[/i]

Solve the equation $[x] \cdot \{x\} = 1991x$. (Here $[x]$ denotes the greatest integer less than or equal to $x$, and $\{x\}=x-[x]$.)

A scout troop buys $ 1000$ candy bars at a price of five for $ \$2$. They sell all the candy bars at a price of two for $ \$1$. What was their profit, in dollars? $ \textbf{(A)}\ 100 \qquad \textbf{(B)}\ 200 \qquad \textbf{(C)}\ 300 \qquad \textbf{(D)}\ 400 \qquad \textbf{(E)}\ 500$

Lautaro, Camilo and Rafael give the same exams. Each note is a positive integer. Camilo was the first in physics. Lautaro obtained a total score of $20$, Camilo, a total of $10$ and Rafael, a total of $9$. Among all the tests, there were no two scores that were repeated. Determine how many They took exams, and who was second in math.

Let $ \sigma = (a_1, a_2, \cdots , a_n)$ be permutation of $ (1, 2 ,\cdots, n)$. A pair $ (a_i, a_j)$ is said to correspond to an [b]inversion[/b] of $\sigma$ if $ i<j$ but $ a_i>a_j$. How many permutations of $ (1,2,\cdots,n)$, $ n \ge 3$, have exactly [b]two[/b] inversions? For example, In the permutation $(2,4,5,3,1)$, there are 6 inversions corresponding to the pairs $ (2,1),(4,3),(4,1),(5,3),(5,1),(3,1)$.

For any positive real numbers $a, b, c, d$, prove the following inequality: $$(a^2+b^2)(b^2+c^2)(c^2+d^2)(d^2+a^2) \geq 64abcd|(a-b)(b-c)(c-d)(d-a)|$$ [i]Proposed by Anton Trygub[/i]

Let $(a_1, a_2,..., a_n)$ and $(b_1, b_2, ..., b_n)$ be two sequences of positive real numbers. Let $\pi$ be a permutation of the set $\{1, 2, ..., n\}$, for which the sum $a_{\pi(1)}(b_{\pi(1)}+b_{\pi(2)}+...+b_{\pi(n)})+a_{\pi(2)}(b_{\pi(3)}+b_{\pi(3)}+...+b_{\pi(n)})+...+a_{\pi(n)}b_{\pi(n)}$ is minimal. Proce for this permutation $\pi$, that $$ \frac{a_{\pi(1)}}{b_{\pi(1)}}\le \frac{a_{\pi(2})}{b_{\pi(2)}}\le ... \le \frac{a_{\pi(n)}}{b_{\pi(n)}}$$ Application: In an idealized role-playing game you fight against $n$ opponents at the same time. In order to minimize the damage you suffer yourself, you should first take care of your opponent for the ratio of the time it takes to defeat him (if you only focus on him), and the damage it does per second is minimal; next, one should fight the opponent with the second smallest such ratio, and so on.

Consider the sequence $a(n)$ defined by the following conditions:$$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ How many perfect squares no greater in value than $1000 000$ will be found among the first terms of the sequence? ( (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.) (A Andjans)

Find the number of positive integer solutions to $(x_1 + x_2 + x_3)(y_1 + y_2 + y_3 + y_4) = 91$

Two players take turns entering a symbol in an empty cell of a $1 \times n$ chessboard, where $n$ is an integer greater than $1$. Aaron always enters the symbol $X$ and Betty always enters the symbol $O$. Two identical symbols may not occupy adjacent cells. A player without a move loses the game. If Aaron goes first, which player has a winning strategy?

Write two ones, then a $2$ between them, then a $3$ between the numbers whose sum is $3$, then a $4$ between the numbers whose sum is $4$, as shown below: $$(1, 1), (1, 2, 1),(1, 3, 2, 3, 1), (1, 4, 3, 2, 3, 4, 1)$$ and so on. Prove that the number of times $n$ appears, ($n\ge 2$), is equal to the number of positive integers less than $n$ and relative prime with $n$..

Let $ABC$ be a triangle and let $\omega$ be its incircle. Denote by $D_1$ and $E_1$ the points where $\omega$ is tangent to sides $BC$ and $AC$, respectively. Denote by $D_2$ and $E_2$ the points on sides $BC$ and $AC$, respectively, such that $CD_2=BD_1$ and $CE_2=AE_1$, and denote by $P$ the point of intersection of segments $AD_2$ and $BE_2$. Circle $\omega$ intersects segment $AD_2$ at two points, the closer of which to the vertex $A$ is denoted by $Q$. Prove that $AQ=D_2P$.

Let $ ABCDE$ be a convex pentagon such that \[ \angle BAC \equal{} \angle CAD \equal{} \angle DAE\qquad \text{and}\qquad \angle ABC \equal{} \angle ACD \equal{} \angle ADE. \]The diagonals $BD$ and $CE$ meet at $P$. Prove that the line $AP$ bisects the side $CD$. [i]Proposed by Zuming Feng, USA[/i]

For any positive integer $d$, prove there are infinitely many positive integers $n$ such that $d(n!)-1$ is a composite number.