On fields of $n \times n$ chessboard $n^2$ different integers have been arranged, one in each field. In each column, field with biggest number was colored in red. Set of $n$ fields of chessboard name [i]admissible[/i], if no two of that fields aren't in the same row and aren't in the same column. From all admissible sets, set with biggest sum of numbers in it's fields has been chosen. Prove that red field is in this set.

In a class, some pupils learn German, the other learn French. The number of girls learning French and the number of boys learning German total to 16. There are 11 pupils learning French, and there are 10 girls in the class. In addition to the girls learning French, there are 16 pupils. How many pupils are there in the class? A. 18 B. 21 C. 23 D. 27 E. 31

Let $n$ and $k$ be two integers which are greater than $1$. Let $a_1,a_2,\ldots,a_n,c_1,c_2,\ldots,c_m$ be non-negative real numbers such that i) $a_1\ge a_2\ge\ldots\ge a_n$ and $a_1+a_2+\ldots+a_n=1$; ii) For any integer $m\in\{1,2,\ldots,n\}$, we have that $c_1+c_2+\ldots+c_m\le m^k$. Find the maximum of $c_1a_1^k+c_2a_2^k+\ldots+c_na_n^k$.

For positive integers $a$ and $b$, let $M(a,b)$ denote their greatest common divisor. Determine all pairs of positive integers $(m,n)$ such that for any two positive integers $x$ and $y$ such that $x\mid m$ and $y\mid n$, $$M(x+y,mn)>1.$$ [i]Proposed by Ivan Novak[/i]

Let $\{a_n \}_{n=0}^{\infty}$ be a sequence given recrusively such that $a_0=1$ and $$a_{n+1}=\frac{7a_n+\sqrt{45a_n^2-36}}{2}$$ for $n\geq 0$ Show that : a) $a_n$ is a positive integer. b) $a_n a_{n+1}-1$ is a square of an integer. [i]Proposed by Stefan Gyurki (Matej Bel University, Banska Bystrica).[/i]

Find all functions $f: \mathbb{R}\to\mathbb{R}$ satisfying: $\frac{f(xy)+f(xz)}{2} - f(x)f(yz) \geq \frac{1}{4}$ for all $x,y,z \in \mathbb{R}$

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all real numbers $x$ and $y$, $$f(x^2)+2f(xy)=xf(x+y)+yf(x).$$ [i]Proposed by Dorlir Ahmeti, Kosovo[/i]

Jude repeatedly flips a coin. If he has already flipped $n$ heads, the coin lands heads with probability $\tfrac{1}{n+2}$ and tails with probability $\tfrac{n+1}{n+2}.$ If Jude continues flipping forever, let $p$ be the probability that he flips $3$ heads in a row at some point. Compute $\lfloor 180p \rfloor.$

Let $x$ be a real number such that $x^3+4x=8$. Determine the value of $x^7+64x^2$.

Is there an integer $n$ such that $\sqrt{n-1}+\sqrt{n+1}$ is a rational number?

In preparation for the family's upcoming vacation, Tony puts together five bags of jelly beans, one bag for each day of the trip, with an equal number of jelly beans in each bag. Tony then pours all the jelly beans out of the five bags and begins making patterns with them. One of the patterns that he makes has one jelly bean in a top row, three jelly beans in the next row, five jelly beans in the row after that, and so on: \[\begin{array}{ccccccccc}&&&&*&&&&\\&&&*&*&*&&&\\&&*&*&*&*&*&&\\&*&*&*&*&*&*&*&\\ *&*&*&*&*&*&*&*&*\\&&&&\vdots&&&&\end{array}\] Continuing in this way, Tony finishes a row with none left over. For instance, if Tony had exactly $25$ jelly beans, he could finish the fifth row above with no jelly beans left over. However, when Tony finishes, there are between $10$ and $20$ rows. Tony then scoops all the jelly beans and puts them all back into the five bags so that each bag once again contains the same number. How many jelly beans are in each bag? (Assume that no marble gets put inside more than one bag.)

Determine all pairs of positive integers $ (m,n)$ such that $ (1\plus{}x^n\plus{}x^{2n}\plus{}\cdots\plus{}x^{mn})$ is divisible by $ (1\plus{}x\plus{}x^2\plus{}\cdots\plus{}x^{m})$.

Given a polynomial $p(x)$ with real coefficients, we denote by $S(p)$ the sum of the squares of its coefficients. For example $S(20x+ 21)=20^2+21^2=841$. Prove that if $f(x)$, $g(x)$, and $h(x)$ are polynomials with real coefficients satisfying the indentity $f(x) \cdot g(x)=h(x)^ 2$, then $$S(f) \cdot S(g) \ge S(h)^2$$ [i]Proposed by Bhavya Tiwari[/i]

Which natural numbers cannot be presented in that way: $[n+\sqrt{n}+\frac{1}{2}]$, $n\in\mathbb{N}$ $[y]$ is the greatest integer function.

We call a coloring $f$ of the elements in the set $M = \{(x, y) | x = 0, 1, \dots , kn - 1; y = 0, 1, \dots , ln - 1\}$ with $n$ colors allowable if every color appears exactly $k$ and $ l$ times in each row and column and there are no rectangles with sides parallel to the coordinate axes such that all the vertices in $M$ have the same color. Prove that every allowable coloring $f$ satisfies $kl \leq n(n + 1).$

Points $B_1,C_1$ are on $AC$ and $AB$ and $B_1C_1 \parallel BC$. Circumcircle of $ABB_1$ intersect $CC_1$ at $L$. Circumcircle $CLB_1$ is tangent to $AL$. Prove $AL \leq \frac{AC+AC_1}{2}$

Let $p\ge 3$ be a prime number. Show that there exist $p$ positive integers $a_1,a_2,\ldots ,a_p$ not exceeding $2p^2$ such that the $\frac{p(p-1)}{2}$ sums $a_i+a_j\ (i<j)$ are all distinct.

Let $ABC$ be a triangle where $\angle BAC = 30^\circ$. Construct $D$ in $\triangle ABC$ such that $\angle ABD = \angle ACD = 30^\circ$. Let the circumcircle of $\triangle ABD$ intersect $AC$ at $X$. Let the circumcircle of $\triangle ACD$ intersect $AB$ at $Y$. Given that $DB - DC = 10$ and $BC = 20$, find $AX \cdot AY$.

Two people play a game on a graph with $2022$ points. Initially, there are no edges in the graph. They take turns and connect two non-neighbouring vertices with an edge. Whoever makes the graph connected loses. Which player has a winning strategy? [i]ST, danny2915[/i]

Find all positive integers $x>1, y$ and primes $p,q$ such that $p^{x}=2^{y}+q^{x}$

Show that for all real numbers $x$ and $y$ with $x > -1$ and $y > -1$ and $x + y = 1$ the inequality $$\frac{x}{y + 1} +\frac{y}{x + 1} \ge \frac23$$ holds. When does equality apply? [i](Walther Janous)[/i]

A positive integer $n$ is called [i]mythical[/i] if every divisor of $n$ is two less than a prime. Find the unique mythical number with the largest number of divisors. [i]Proposed by Evan Chen[/i]

$ABCD$ is a regular tetrahedron with side length $1$. Find the area of the cross section of $ABCD$ cut by the plane that passes through the midpoints of $AB$, $AC$, and $CD$.

a) The triangle $ABC$ was turned around the centre of the circumscribed circle by the angle less than $180$ degrees and thus was obtained the triangle $A_1B_1C_1$. The corresponding segments $[AB]$ and $[A_1B_1]$ intersect in the point $C_2, [BC]$ and $[B_1C_1]$ -- $A_2, [AC]$ and $[A_1C_1]$ -- $B_2$. Prove that the triangle $A_2B_2C_2$ is similar to the triangle $ABC$. b) The quadrangle $ABCD$ was turned around the centre of the circumscribed circle by the angle less than $180$ degrees and thus was obtained the quadrangle $A_1B_1C_1D_1$. Prove that the points of intersection of the corresponding lines ( $(AB$) and $(A_1B_1), (BC)$ and $(B_1C_1), (CD)$ and $(C_1D_1), (DA)$ and $(D_1A_1)$ ) are the vertices of the parallelogram.

Let $n$ be a positive integer and let $t$ be an integer. $n$ distinct integers are written on a table. Bob, sitting in a room nearby, wants to know whether there exist some of these numbers such that their sum is equal to $t$. Alice is standing in front of the table and she wants to help him. At the beginning, she tells him only the initial sum of all numbers on the table. After that, in every move he says one of the $4$ sentences: $i.$ Is there a number on the table equal to $k$? $ii.$ If a number $k$ exists on the table, erase him. $iii.$ If a number $k$ does not exist on the table, add him. $iv.$ Do the numbers written on the table can be arranged in two sets with equal sum of elements? On these questions Alice answers yes or no, and the operations he says to her she does (if it is possible) and does not tell him did she do it. Prove that in less than $3n$ moves, Bob can find out whether there exist numbers initially written on the board such that their sum is equal to $t$