We have two triangles that lengths of its sides are $3,4,5$, one triangle that lengths of its sides are $4,5,\sqrt{41}$, one triangle that lengths of its sides are $\frac{5}{6}\sqrt2,4,5$. The number of tetrahedrons with such four surfaces is________.

Let $ ABCD$ be a trapezoid with $ AB\parallel{}CD$, $ AB\equal{}11$, $ BC\equal{}5$, $ CD\equal{}19$, and $ DA\equal{}7$. Bisectors of $ \angle A$ and $ \angle D$ meet at $ P$, and bisectors of $ \angle B$ and $ \angle C$ meet at $ Q$. What is the area of hexagon $ ABQCDP$? $ \textbf{(A)}\ 28\sqrt{3}\qquad \textbf{(B)}\ 30\sqrt{3}\qquad \textbf{(C)}\ 32\sqrt{3}\qquad \textbf{(D)}\ 35\sqrt{3}\qquad \textbf{(E)}\ 36\sqrt{3}$

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

Consider the triangle $ ABC $ with $ \angle BAC>60^{\circ } $ and $ \angle BCA>30^{\circ } . $ On the other semiplane than that determined by $ BC $ and $ A $ we have the points $ D $ and $ E $ so that $$ \angle ABE =\angle CBD =\angle BAE +30^{\circ } =\angle BCD +30^{\circ } =90^{\circ } . $$ Note by $ F,H $ the midpoints of $ AE, $ respectively, $ CD, $ and with $ G $ the intersection of $ AC $ and $ DE. $ Show: [b]a)[/b] $ EBD\sim ABC $ [b]b)[/b] $ FGH\equiv ABC $

Suppose that the positive divisors of a positive integer $n$ are $1=d_1<d_2<\ldots<d_k=n$, where $k \geq 5$. Given that $k \leq 1000$ and $n={d_2}^{d_3}{d_4}^{d_5}$, compute, with proof, all possible values of $k$.

Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying \begin{align*} f(x+f(y)) &= g(x) + h(y) \\ g(x+g(y)) &= h(x) + f(y) \\ h(x+h(y)) &= f(x) + g(y) \end{align*} for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.) [i]Proposed by Evan Chen[/i]

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

A regular $n$-gon is inscribed in a circle radius $1$. Let $X$ be the set of all arcs $PQ$, where $P, Q$ are distinct vertices of the $n$-gon. $5$ elements $L_1, L_2, ... , L_5$ of $X$ are chosen at random (so two or more of the $L_i$ can be the same). Show that the expected length of $L_1 \cap L_2 \cap L_3 \cap L_4 \cap L_5$ is independent of $n$.

Let $n > 2$ be an integer. The numbers $1, 2, . . . , n$ are written at the vertices of an $n$-gon in that order. A move consists of choosing two adjacent vertices and adding $1$ to the numbers written there. Determine all n for which it is possible to achieve that all numbers are identical after a finite number of moves.

Given a chessboard $n \times n$, where $n\geq 4$ and $p=n+1$ is a prime number. A set of $n$ unit squares is called [i]tactical[/i] if after putting down queens on these squares, no two queens are attacking each other. Prove that there exists a partition of the chessboard into $n-2$ tactical sets, not containing squares on the main diagonals. Queens are allowed to move horizontally, vertically and diagonally.

A number consists of 3 different digits. The sum of the 5 other numbers formed with those digits is 2003. Find the number.

Problem 3. Suppose that the equation x^3-ax^2+bx-a=0 has three positive real roots (b>0). Find the minimum value of the expression: (b-a)(b^3+3a^3)

Let $a$ and $b$ be real numbers. It is known that the graph of the parabola $y =ax^2 +b$ cuts the graph of the curve $y = x+1/x$ in exactly three points. Prove that $3ab < 1$.

Let $A = \overline{abcd}$ be a $4$-digit positive integer, such that $a\ge 7$ and $a > b >c > d > 0$. Let us consider a positive integer $B = \overline{dcba}$. If all digits of $A+B$ are odd, determine all possible values of $A$.

Let $a_1, a_2, ...,a_n$ be positive real numbers such that $$a_1 + a_2 + ... + a_n = a_1^2 + a_2^2 + ... + a_n^2$$ Prove that $$\sum_{1\le i<j\le n} a_ia_j(1 - a_ia_j) \ge 0$$ Võ Quốc Bá Cẩn.

Let $ n>1$ and for $ 1 \leq k \leq n$ let $ p_k \equal{} p_k(a_1, a_2, . . . , a_n)$ be the sum of the products of all possible combinations of k of the numbers $ a_1,a_2,...,a_n$. Furthermore let $ P \equal{} P(a_1, a_2, . . . , a_n)$ be the sum of all $ p_k$ with odd values of $ k$ less than or equal to $ n$. How many different values are taken by $ a_j$ if all the numbers $ a_j (1 \leq j \leq n)$ and $ P$ are prime?

Three boxes with at least one marble in each are given. In each step we double the number of marbles in one of the boxes, taking the required number of boxes from one of the other two boxes. Is it always possible to have one of the boxes empty after several steps?

Let $a,b,c$ be positive real numbers for which $a+b+c=3$. Prove the inequality \[\frac{a^3+2}{b+2}+\frac{b^3+2}{c+2}+\frac{c^3+2}{a+2}\ge3\]

If $ a$, $ b$, $ c$ are the sidelengths of a triangle, then prove that $ \frac {3\left(a^4 \plus{} b^4 \plus{} c^4\right)}{\left(a^2 \plus{} b^2 \plus{} c^2\right)^2} \plus{} \frac {bc \plus{} ca \plus{} ab}{a^2 \plus{} b^2 \plus{} c^2}\geq 2$.

A square with center $F$ was constructed on the side $AC$ of triangle $ABC$ outside it. After this, everything was erased except $F$ and the midpoints $N,K$ of sides $BC,AB$. Restore the triangle.

Let $n > 1$ be an integer and let $a_1, a_2,... , a_n$ be $n$ different integers. Show that the polynomial $f(x) = (x -a_1)(x - a_2)\cdot ... \cdot (x -a_n) - 1$ is not divisible by any polynomial with integer coefficients and of degree greater than zero but less than $n$ and such that the highest power of $x$ has coefficient $1$.

In the plane, let $C$ be a closed convex set that contains $(0,0)$ but no other point with integer coordinates. Suppose that $A(C)$, the area of $C$, is equally distributed among the four quadrants. Prove that $A(C) \leq 4.$

Two players are playing a game with $n$ pieces. At each turn, the player takes $2^i$ pieces where $i \geq 0$. The player who takes the last piece will win the game. If the game is played for each $n=1000, 2000, 2011, 3000, 4000$ once, in how many of them the first player can guarantee to win? $\textbf{(A)}\ 4 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{None}$

In convex quadrilateral $ABCD$, $\angle CAB = \angle BCD$. $P$ lies on line $BC$ such that $AP = PC$, $Q$ lies on line $AP$ such that $AC$ and $DQ$ are parallel, $R$ is the point of intersection of lines $AB$ and $CD$, and $S$ is the point of intersection of lines $AC$ and $QR$. Line $AD$ meets the circumcircle of $AQS$ again at $T$. Prove that $AB$ and $QT$ are parallel.