The numbers from $ 51$ to $ 150$ are arranged in a $ 10\times 10$ array. Can this be done in such a way that, for any two horizontally or vertically adjacent numbers $ a$ and $ b$, at least one of the equations $ x^2 \minus{} ax \plus{} b \equal{} 0$ and $ x^2 \minus{} bx \plus{} a \equal{} 0$ has two integral roots?

$ABCD$ is a parallelogram in which angle $DAB$ is acute. Points $A, P, B, D$ lie on one circle in exactly this order. Lines $AP$ and $CD$ intersect in $Q$. Point $O$ is the circumcenter of the triangle $CPQ$. Prove that if $D \neq O$ then the lines $AD$ and $DO$ are perpendicular.

Find all positive integers $a, b, c$ such that $ab + 1$, $bc + 1$, and $ca + 1$ are all equal to factorials of some positive integers. Proposed by [i]Nikola Velov, Macedonia[/i]

Find the number of ways to partition a set of $10$ elements, $S = \{1, 2, 3, . . . , 10\}$ into two parts; that is, the number of unordered pairs $\{P, Q\}$ such that $P \cup Q = S$ and $P \cap Q = \emptyset$.

For a real number $x$, the minimum value of the expression $$\frac{2x^2 + x - 3}{x^2 - 2x + 3}$$ can be written in the form $\frac{a-\sqrt{b}}{c}$, where $a, b$, and $c$ are positive integers such that $a$ and $c$ are relatively prime. Find $a + b + c$

Let $f$ be a quadratic polynomial with real coefficients, and let $g_1, g_2, g_3, \ldots$ be a geometric progression of real numbers. Define $a_n=f(n)+g_n.$ Given that $a_1, a_2, a_3, a_4,$ and $a_5$ are equal to $1, 2, 3, 14,$ and $16,$ respectively, compute $\tfrac{g_2}{g_1}.$

Determine all natural numbers $n \ge 2$ with the property that there are two permutations $(a_1, a_2,... , a_n) $ and $(b_1, b_2,... , b_n)$ of the numbers $1, 2,..., n$ such that $(a_1 + b_1, a_2 +b_2,..., a_n + b_n)$ are consecutive natural numbers. [i](Walther Janous)[/i]

Is it possible to cut a regular triangular prism into two equal pyramids?

Let $D$ be the foot of the altitude of triangle $ABC$ drawn from vertex $A$. Let $E$ and $F$ be points symmetric to $D$ w.r.t. lines $AB$ and $AC$, respectively. Let $R_1$ and $R_2$ be the circumradii of triangles $BDE$ and $CDF$, respectively, and let $r_1$ and $r_2$ be the inradii of the same triangles. Prove that $|S_{ABD} - S_{ACD}| > |R_1r_1 - R_2r_2|$

Three disks touch pairwise from outside in the points $X,Y,Z$. Then the radiuses of the disks were expanded by $2/\sqrt3$ times, and the centres were reserved. Prove that the triangle $XYZ$ is completely covered by the expanded disks.

Andrew rolls two fair six sided die each numbered from $1$ to $6$, and Brian rolls one fair $12$ sided die numbered from $1$ to $12$. The probability that the sum of the numbers obtained from Andrew's two rolls is less than the number obtained from Brian's roll can be expressed as a common fraction in the form $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find $n$ such that each of the numbers $n,(n+1),...,(n+20)$ has the common divider greater than one with the number $30030 = 2\cdot 3\cdot 5\cdot 7\cdot 11\cdot 13$.

[b]6.[/b] Prove that if $a_n \geq 0$ and $\frac{1}{n}\sum_{k=1}^{n} a_k \geq \sum_{k=n+1}^{2n}a_k$ $(n=1, 2, \dots)$ , then $\sum_{k=1}^{\infty} a_k $ is convergent and its sum is less than $2ea_1$. [b](S. 9)[/b]

For each subset $T$ of $S = \{1, 2, ... , 7\}$, the result $r(T)$ of T is computed as follows: the elements of $T$ are written, largest to smallest, and alternating signs $(+, -)$ starting with $+$ are put in front of each number. The value of the resulting expression is$ r(T)$. (For example, for $T =\{2, 4, 7\}$, we have $r(T) = +7 - 4 + 2 = 5$.) Compute the sum of $r(T)$ as $T$ ranges over all subsets of $S$.

Find the maximal positive number $r$ with the following property: If all altitudes of a tetrahedron are $\geq 1$, then a sphere of radius $r$ fits into the tetrahedron.

Let $S$ be a set of $n$ points in the plane such that no four points are collinear. Let $\{d_1,d_2,\cdots ,d_k\}$ be the set of distances between pairs of distinct points in $S$, and let $m_i$ be the multiplicity of $d_i$, i.e. the number of unordered pairs $\{P,Q\}\subseteq S$ with $|PQ|=d_i$. Prove that $\sum_{i=1}^k m_i^2\leq n^3-n^2$.

A line passes through the center $O$ of an equilateral triangle $ABC$ and intersects the side $BC$. At what angle wrt $BC$ should this line be drawn this line so that its segment inside the triangle has the smallest possible length?

Which of the following claims are true, and which of them are false? If a fact is true you should prove it, if it isn't, find a counterexample. a) Let $a,b,c$ be real numbers such that $ a^{2013} + b^{2013} + c^{2013} = 0 $. Then $ a^{2014} + b^{2014} + c^{2014} = 0 $. b) Let $a,b,c$ be real numbers such that $ a^{2014} + b^{2014} + c^{2014} = 0 $. Then $ a^{2015} + b^{2015} + c^{2015} = 0 $. c) Let $a,b,c$ be real numbers such that $ a^{2013} + b^{2013} + c^{2013} = 0 $ and $ a^{2015} + b^{2015} + c^{2015} = 0 $. Then $ a^{2014} + b^{2014} + c^{2014} = 0 $. [i]Proposed by Matko Ljulj[/i]

Let $A(XYZ)$ be the area of the triangle $XYZ$. A non-regular convex polygon $P_1 P_2 \ldots P_n$ is called [i]guayaco[/i] if exists a point $O$ in its interior such that \[A(P_1OP_2) = A(P_2OP_3) = \cdots = A(P_nOP_1).\] Show that, for every integer $n \ge 3$, a guayaco polygon of $n$ sides exists.

A large gathering of people stand in a triangular array with $2020$ rows, such that the first row has $1$ person, the second row has $2$ people, and so on. Every day, the people in each row infect all of the people adjacent to them in their own row. Additionally, the people at the ends of each row infect the people at the ends of the rows in front of and behind them that are at the same side of the row as they are. Given that two people are chosen at random to be infected with COVID at the beginning of day 1, what is the earliest possible day that the last uninfected person will be infected with COVID? [i]Proposed by Richard Chen[/i]

Let $n > 2$ be an integer. Show that it is possible to choose $n$ points in the plane, not all of them lying on the same line, such that the distance between any pair of points is an integer (that is, $\sqrt{(x_1 -x_2)^2 +(y_1 -y_2)^2}$ is an integer for all pairs $(x_1, y_1)$ and $(x_2, y_2)$ of points).

Four points $ A, B, C, D$ are chosen on a circle in such a way that arcs $ AB, BC,$ and $ CD$ are of the same length and the $ arc DA$ is longer than these three. Line $ AD$ and the line tangent to the circle at $ B$ intersect at $ E$. Let $ F$ be the other endpoint of the diameter starting at $ C$ of the circle. Prove that triangle $ DEF$ is equilateral.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

On a planet, far, far away, the Yaliens have defined: $x$ "equals" $y$ if and only if $|x-y| \le 3.$ Let $S$ be a set of positive integers. What is the smallest possible number of elements in $S$ such that, for any positive integer $r,$ where $1 \le r \le 2024,$ $r$ "equals" some element in $S$?

In this diagram the center of the circle is $O$, the radius is $a$ inches, chord $EF$ is parallel to chord $CD, O, G, H, J$ are collinear, and $G$ is the midpoint of $CD$. Let $K$ (sq. in.) represent the area of trapezoid $CDFE$ and let $R$ (sq. in.) represent the area of rectangle $ELMF$. Then, as $CD$ and $EF$ are translated upward so that $OG$ increases toward the value $a$, while $JH$ always equals $HG$, the ratio $K:R$ become arbitrarily close to: [asy] size((270)); draw((0,0)--(10,0)..(5,5)..(0,0)); draw((5,0)--(5,5)); draw((9,3)--(1,3)--(1,1)--(9,1)--cycle); draw((9.9,1)--(.1,1)); label("O", (5,0), S); label("a", (7.5,0), S); label("G", (5,1), SE); label("J", (5,5), N); label("H", (5,3), NE); label("E", (1,3), NW); label("L", (1,1), S); label("C", (.1,1), W); label("F", (9,3), NE); label("M", (9,1), S); label("D", (9.9,1), E); [/asy] $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ \sqrt{2} \qquad\textbf{(D)}\ \frac{1}{\sqrt{2}}+\frac{1}{2} \qquad\textbf{(E)}\ \frac{1}{\sqrt{2}}+1$