A circle with diameter $AB$ is drawn, and the point $ P$ is chosen on segment $AB$ so that $\frac{AP}{AB} =\frac{1}{42}$ . Two new circles $a$ and $b$ are drawn with diameters $AP$ and $PB$ respectively. The perpendicular line to $AB$ passing through $ P$ intersects the circle twice at points $S$ and $T$ . Two more circles $s$ and $t$ are drawn with diameters $SP$ and $ST$ respectively. For any circle $\omega$ let $A(\omega)$ denote the area of the circle. What is $\frac{A(s)+A(t)}{A(a)+A(b)}$?

Call a positive integer an uphill integer if every digit is strictly greater than the previous digit. For example, $1357, 89,\text{and } 5$ are all uphill integers, but $32, 1240, \text{and } 466$ are not. How many uphill integers are divisible by $15$? $\textbf{(A)}\ 4 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 8$

The plane shows $2020$ straight lines in general position, that is, there are none three intersecting at one point but no two parallel. Let's say, that the drawn line $a$ [i]detaches [/i] the drawn line $b$ if all intersection points of line $b$ with the other drawn lines lie in one half plane wrt to line $a$ (given the most straightforward $a$). Prove that you can be guaranteed find two drawn lines $a$ and $b$ that $a$ detaches $b$, but $b$ does not detach $a$.

Find all non-constant functions $f : Q^+ \to Q^+$ satisfying the equation $$f(ab + bc + ca) =f(a)f(b) +f(b)f(c)+f(c)f(a)$$ for all $a, b,c \in Q^+$ .

Let $S_n$ be the sum of the first $n$ prime numbers. For example, \[ S_5 = 2 + 3 + 5 + 7 + 11 = 28.\] Does there exist an integer $k$ such that $S_{2023} < k^2 < S_{2024}$?

Through a point $P$ within a triangle $ABC$ the lines $l, m$, and $n$ perpendicular respectively to $AP,BP,CP$ are drawn. Prove that if $l$ intersects the line $BC$ in $Q$, $m$ intersects $AC$ in $R$, and $n$ intersects $AB$ in $S$, then the points $Q, R$, and $S$ are collinear.

Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC = 20$, and $CD = 30$. Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E$, and $AE = 5$. What is the area of quadrilateral $ABCD$? $\textbf{(A) } 330 \qquad\textbf{(B) } 340 \qquad\textbf{(C) } 350 \qquad\textbf{(D) } 360 \qquad\textbf{(E) } 370$

In a culturing of bacteria, there are two species of them: red and blue bacteria. When two red bacteria meet, they transform into one blue bacterium. When two blue bacteria meet, they transform into four red bacteria. When a red and a blue bacteria meet, they transform into three red bacteria. Find, in function of the amount of blue bacteria and the red bacteria initially in the culturing, all possible amounts of bacteria, and for every possible amount, the possible amounts of red and blue bacteria.

The product $$\left(\frac{1+1}{1^2+1}+\frac{1}{4}\right)\left(\frac{2+1}{2^2+1}+\frac{1}{4}\right)\left(\frac{3+1}{3^2+1}+\frac{1}{4}\right)\cdots\left(\frac{2022+1}{2022^2+1}+\frac{1}{4}\right)$$ can be written as $\frac{q}{2^r\cdot s}$, where $r$ is a positive integer, and $q$ and $s$ are relatively prime odd positive integers. Find $s$.

Solve in $ \mathbb{C} $ the following equation: $ |z|+|z-5i|=|z-2i|+|z-3i|. $

Find the number of positive integers $n < 100$ such that $\gcd(n^2,2023) \neq \gcd(n,2023^2).$

Prove that $\sqrt[3]{5}$ is irrational.

The Fibonacci Sequence $ 1,1,2,3,5,8,13,21,\ldots$ starts with two 1s and each term afterwards is the sum of its predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci Sequence? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 9$

Let $ABCD$ be a square with side length $4$. Consider points $P$ and $Q$ on segments $AB$ and $BC$, respectively, with $BP=3$ and $BQ=1$. Let $R$ be the intersection of $AQ$ and $DP$. If $BR^2$ can be expressed in the form $\frac{m}{n}$ for coprime positive integers $m,n$, compute $m+n$. [i]Proposed by Brandon Wang[/i]

find all the function $f,g:R\rightarrow R$ such that (1)for every $x,y\in R$ we have $f(xg(y+1))+y=xf(y)+f(x+g(y))$ (2)$f(0)+g(0)=0$

The following figure shows a $3^2 \times 3^2$ grid divided into $3^2$ subgrids of size $3 \times 3$. This grid has $81$ cells, $9$ in each subgrid. [asy] draw((0,0)--(9,0)--(9,9)--(0,9)--cycle, linewidth(2)); draw((0,1)--(9,1)); draw((0,2)--(9,2)); draw((0,3)--(9,3), linewidth(2)); draw((0,4)--(9,4)); draw((0,5)--(9,5)); draw((0,6)--(9,6), linewidth(2)); draw((0,7)--(9,7)); draw((0,8)--(9,8)); draw((1,0)--(1,9)); draw((2,0)--(2,9)); draw((3,0)--(3,9), linewidth(2)); draw((4,0)--(4,9)); draw((5,0)--(5,9)); draw((6,0)--(6,9), linewidth(2)); draw((7,0)--(7,9)); draw((8,0)--(8,9)); [/asy] Now consider an $n^2 \times n^2$ grid divided into $n^2$ subgrids of size $n \times n$. Find the number of ways in which you can select $n^2$ cells from this grid such that there is exactly one cell coming from each subgrid, one from each row and one from each column.

The squares of an $8 \times 8$ board are colored black and white in such a way that every row and every column contains exactly four black squares. Prove that the number of pairs of neighboring white squares is the same as the number of pairs of neighboring black squares. (Two squares are neighboring if they have a side in common.)

Determine the number of ordered triples $(a, b, c)$, with $0 \le a, b, c \le 10$ for which there exists $(x, y)$ such that $ax^2 + by^2 \equiv c$ (mod $11$)

Let $r>0$ be a real number. We call a monic polynomial with complex coefficients $r$-[i]good[/i] if all of its roots have absolute value at most $r$. We call a monic polynomial with complex coefficients [i]primordial[/i] if all of its coefficients have absolute value at most $1$. a) Prove that any $1$-good polynomial has a primordial multiple. b) If $r>1$, prove that there exists an $r$-good polynomial that does not have a primordial multiple. [i]Proposed by Pranjal Srivastava[/i]

How many solutions does the equation $\tan{(2x)} = \cos{(\tfrac{x}{2})}$ have on the interval $[0, 2\pi]?$ $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 3 \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 5$

For the infinite series $1-\frac12-\frac14+\frac18-\frac{1}{16}-\frac{1}{32}+\frac{1}{64}-\frac{1}{128}-\cdots$ let $S$ be the (limiting) sum. Then $S$ equals: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ \frac27\qquad\textbf{(C)}\ \frac67\qquad\textbf{(D)}\ \frac{9}{32}\qquad\textbf{(E)}\ \frac{27}{32} $

There are only two letters in the Mumu tribe alphabet: M and $U$. The word in the Mumu language is any sequence of letters $M$ and $U$, in which next to each letter $M$ there is a letter $U$ (for example, $UUU$ and $UMMUM$ are words and $MMU$ is not). Let $f(m,u)$ denote the number of words in the Mumu language which have $m$ times the letter $M$ and $u$ times the letter $U$. Prove that $f (m, u) - f (2u - m + 1, u) = f (m, u - 1) - f (2u - m + 1, u - 1)$ for any $u \ge 2,3 \le m \le 2u$.

A train traveling at $ 80$ mph begins to cross a $ 1$ mile long bridge. At this moment, a man begins to walk from the front of the train to the back of the train at a speed of $5$ mph. The man reaches the back of the train as soon as the train is completely off the bridge. What is the length of the train (as a fraction of a mile)?

Let $A,B,C$ be real square matrices of order $n$ such that $A^3=-I$, $BA^2+BA=C^6+C+I$ and $C$ is symmetric. Is it possible that $n=2005$?

Suppose $x,y\in\mathbb{Z}$ satisfy $$y^4+4y^3+28y+8x^3+6y^2+32x+1=(x^2-y^2)(x^2+y^2+24).$$ Find the sum of all possible values of $|xy|$.