In a triangle $ABC$, let $D$ and $E$ be points of the sides $ BC$ and $AC$ respectively. Segments $AD$ and $BE$ intersect at $O$. Suppose that the line connecting midpoints of the triangle and parallel to $AB$, bisects the segment $DE$. Prove that the triangle $ABO$ and the quadrilateral $ODCE$ have equal areas.

A classroom has $30$ seats arranged into $5$ rows of $6$ seats. Thirty students of distinct heights come to class every day, each sitting in a random seat. The teacher stands in front of all the rows, and if any student seated in front of you (in the same column) is taller than you, then the teacher cannot notice that you are playing games on your phone. What is the expected number of students who can safely play games on their phone?

Find all posible pairs of positive integers $x,y$ such that $$\text{lcm}(x,y+3001)=\text{lcm}(y,x+3001)$$

In the Crelle $[ABCD]$ tetrahedron, we note with $A',B',C',A'',B'',C''$ the tangent points of the hexatangent sphere $\varphi(J,\rho)$, associated with the tetrahedron, with the edges $|BC|,|CA|,|AB|,|DA|,|DB|,|DC|$. Show that these inequalities occur: a) $$2\sqrt3R\ge6\rho\ge A'A''+B'B''+C'C''\ge6\sqrt3r$$ b) $$4R^2\ge12\rho^2\ge(A'A'')^2+(B'B'')^2+(C'C'')^2\ge36r^2$$ c) $$\frac{8R^3}{3\sqrt3}\ge8\rho^3\ge A'A''\cdot B'B''\cdot C'C''\ge24\sqrt3r^3$$ where $r,R$ is the length of the radius of the sphere inscribed and respectively circumscribed to the tetrahedron. [i]Proposed by Marius Olteanu[/i]

In a certain geometry we operate with two types of elements, points and lines, related to each other by the following axioms: [b]I.[/b] Given two points $A$ and $B$, there is a unique line $(AB)$ that passes through both. [b]II. [/b]There are at least two points on a line. There are three points not situated on a straight line. [b]III.[/b] When a point $B$ is located between $A$ and $C$, then $B$ is also between $C$ and $A$. ($A, B, C$ are three different points on a line.) [b]IV.[/b] Given two points $A$ and $C$, there exists at least one point $B$ on the line $(AC)$ of the form that C is between $A$ and $B$. [b]V.[/b] Among three points located on the same straight line, one at most is between the other two. [b]VI.[/b] If $A, B, C$ are three points not lying on the same line and a is a line that does not contain any of the three, when the line passes through a point on segment [AB] , then it goes through one of the $[BC]$ , or it goes through one of the [AC] . (We designate by [AB] the set of points that lie between $A$ and $B$.) From the previous axioms, prove the following propositions: Theorem 1. Between points A and C there is at least one point $B$. Theorem 2. Among three points located on a line, one is always between the two others.

A circle $C$ with radius $3$ has an equilateral triangle inscribed in it. Let $D$ be a circle lying outside the equilateral triangle, tangent to $C$, and tangent to the equilateral triangle at the midpoint of one of its sides. The radius of $D$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

The maze is an $8 \times 8 $square, each cell contains $1 \times 1$ which has one of four arrows drawn (up, down, right, left). The upper side of the upper right cell is the exit from the maze.In the lower left cell there is a chip that, with each move, moves one square in the direction indicated by the arrow. After each move, the shooter in the cell in which there was just a chip rotates $90^o$ clockwise. If a chip must move, taking it outside the $8 \times 8$ square, it remains in place, and the arrow also rotates $90^o$ clockwise. Prove that sooner or later, the chip will come out of the maze.

Let $\nu$ be an irrational positive number, and let $m$ be a positive integer. A pair of $(a,b)$ of positive integers is called [i]good[/i] if \[a \left \lceil b\nu \right \rceil - b \left \lfloor a \nu \right \rfloor = m.\] A good pair $(a,b)$ is called [i]excellent[/i] if neither of the pair $(a-b,b)$ and $(a,b-a)$ is good. Prove that the number of excellent pairs is equal to the sum of the positive divisors of $m$.

In the following list of numbers, the integer $n$ appears $n$ times in the list for $1 \leq n \leq 200.$ $$1, 2, 2, 3, 3, 3, 4, 4, 4, 4, …, 200, 200, …, 200$$ What is the median of the numbers in this list? $\textbf{(A)}\ 100.5 \qquad\textbf{(B)}\ 134 \qquad\textbf{(C)}\ 142 \qquad\textbf{(D)}\ 150.5 \qquad\textbf{(E)}\ 167$

A triangle with vertices as $A=(1,3)$, $B=(5,1)$, and $C=(4,4)$ is plotted on a $6\times5$ grid. What fraction of the grid is covered by the triangle? $\textbf{(A) }\frac{1}{6} \qquad \textbf{(B) }\frac{1}{5} \qquad \textbf{(C) }\frac{1}{4} \qquad \textbf{(D) }\frac{1}{3} \qquad \textbf{(E) }\frac{1}{2}$ [asy] draw((1,0)--(1,5),linewidth(.5)); draw((2,0)--(2,5),linewidth(.5)); draw((3,0)--(3,5),linewidth(.5)); draw((4,0)--(4,5),linewidth(.5)); draw((5,0)--(5,5),linewidth(.5)); draw((6,0)--(6,5),linewidth(.5)); draw((0,1)--(6,1),linewidth(.5)); draw((0,2)--(6,2),linewidth(.5)); draw((0,3)--(6,3),linewidth(.5)); draw((0,4)--(6,4),linewidth(.5)); draw((0,5)--(6,5),linewidth(.5)); draw((0,0)--(0,6),EndArrow); draw((0,0)--(7,0),EndArrow); draw((1,3)--(4,4)--(5,1)--cycle); label("$y$",(0,6),W); label("$x$",(7,0),S); label("$A$",(1,3),dir(230)); label("$B$",(5,1),SE); label("$C$",(4,4),dir(50)); [/asy]

Given several numbers, one of them, $a$, is chosen and replaced by the three numbers $\frac{a}{3}, \frac{a}{3}, \frac{a}{3}$. This process is repeated with the new set of numbers, and so on. Originally, there are $1000$ ones, and we apply the process several times. A number $m$ is called [i]good[/i] if there are $m$ or more numbers that are the same after each iteration, no matter how many or what operations are performed. Find the largest possible good number.

Let $x_1, x_2, \dots, x_n$ be different real numbers. Prove that \[\sum_{1 \leqslant i \leqslant n} \prod_{j \neq i} \frac{1-x_{i} x_{j}}{x_{i}-x_{j}}=\left\{\begin{array}{ll} 0, & \text { if } n \text { is even; } \\ 1, & \text { if } n \text { is odd. } \end{array}\right.\]

For $n\geq 2$ , an equilateral triangle is divided into $n^2$ congruent smaller equilateral triangles. Detemine all ways in which real numbers can be assigned to the $\frac{(n+1)(n+2)}{2}$ vertices so that three such numbers sum to zero whenever the three vertices form a triangle with edges parallel to the sides of the big triangle.

Are there positive integers $a$, $b$, $c$ and $d$ such that: a) $a^{2021} + b^{2023} = 11(c^{2022} + d^{2024})$; b) $a^{2022} + b^{2022} = 11(c^{2022} + d^{2022})$?

Find all nonzero integers $a, b, c, d$ with $a>b>c>d$ that satisfy $ab+cd=34$ and $ac-bd=19.$

What is the largest two-digit integer for which the product of its digits is $17$ more than their sum?

Start with a six-digit whole number $X$, and for a new whole number $Y$, by moving the first three digits of $X$ after the last three digits. (For example, if $X = \textbf{154},377$, then $Y = 377,\textbf{154}$.) Show that, when divided by $27$, both $X$ and $Y$ give the same remainder.

A teacher creates a fraction using numbers from $1$ to $12$ (including $12$). He writes some of the numbers on the numerator, and writes $\times$ (multiplication) between each number. Then he writes the rest of the numbers in the denominator and also writes $\times$ between each number. There is at least one number both in numerator and denominator. The teacher ensures that the fraction is equal to the smallest possible integer possible. What is this positive integer, which is also the value of the fraction?

Let $ k>1$ be an integer. Prove that there exists infinitely many natural numbers such as $ n$ such that: \[ n|1^n\plus{}2^n\plus{}\dots\plus{}k^n\]

Let $ N$ be the greatest integer multiple of $ 36$ all of whose digits are even and no two of whose digits are the same. Find the remainder when $ N$ is divided by $ 1000$.

Let $f(m,1)=f(1,n)=1$ for $m\geq 1, n\geq 1$ and let $f(m,n)=f(m-1, n)+ f(m, n-1) +f(m-1 ,n-1)$ for $m>1$ and $n>1$. Also let $$ S(n)= \sum_{a+b=n} f(a,b) \,\,\;\; a\geq 1 \,\, \text{and} \,\; b\geq 1.$$ Prove that $$S(n+2) =S(n) +2S(n+1) \,\, \; \text{for} \, \, n \geq 2.$$

Let $P(X)$ be a nonconstant polynomial with real coefficients such that for every rational number $q{}$ the equation $P(X)=q$ has no irrational solutions. Show that $P(X)$ is a first degree polynomial.

Let $A$ be a non-empty set of integers with the following property: For each $a \in A$, there exist not necessarily distinct integers $b,c \in A$ so that $a=b+c$. (a) Proof that there are examples of sets $A$ fulfilling above property that do not contain $0$ as element. (b) Proof that there exist $a_1,\ldots,a_r \in A$ with $r \ge 1$ and $a_1+\cdots+a_r=0$. (c) Proof that there exist pairwise distinct $a_1,\ldots,a_r$ with $r \ge 1$ and $a_1+\cdots+a_r=0$.

There are six lines in the plane. No two of them are parallel and no point lies on more than three lines. What is the minimum possible number of points that lie on at least two lines?

Let $P(x) = x^{2022} + x^{1011} + 1$. Which of the following polynomials divides $P(x)$? $\textbf{(A)}~x^2 - x + 1\qquad\textbf{(B)}~x^2 + x + 1\qquad\textbf{(C)}~x^4 + 1\qquad\textbf{(D)}~x^6 - x^3 + 1\qquad\textbf{(E)}~x^6 + x^3 + 1$