A figure with area $1$ is cut out of paper. We divide this figure into $10$ parts and color them in $10$ different colors. Now, we turn around the piece of paper, divide the same figure on the other side of the paper in $10$ parts again (in some different way). Show that we can color these new parts in the same $10$ colors again (hereby, different parts should have different colors) such that the sum of the areas of all parts of the figure colored with the same color on both sides is $\geq \frac{1}{10}.$

We say that the real-valued function $ f(x)$ defined on the interval $ (0,1)$ is approximately continuous on $ (0,1)$ if for any $ x_0 \in (0,1)$ and $ \varepsilon >0$ the point $ x_0$ is a point of interior density $ 1$ of the set \[ H\equal{} \{x : \;|f(x)\minus{}f(x_0)|< \varepsilon \ \}.\] Let $ F \subset (0,1)$ be a countable closed set, and $ g(x)$ a real-valued function defined on $ F$. Prove the existence of an approximately continuous function $ f(x)$ defined on $ (0,1)$ such that \[ f(x)\equal{}g(x) \;\textrm{for all}\ \;x \in F\ .\] [i]M. Laczkovich, Gy. Petruska[/i]

Show that for any $n\geq 2$, $2^{2^n}+1$ ends with 7

[b]p1.[/b] Sujay sees a shooting star go across the night sky, and took a picture of it. The shooting star consists of a star body, which is bounded by four quarter-circle arcs, and a triangular tail. Suppose $AB = 2$, $AC = 4$. Let the area of the shooting star be $X$. If $6X = a-b\pi$ for positive integers $a, b$, find $a + b$. [img]https://cdn.artofproblemsolving.com/attachments/0/f/f9c9ff23416565760df225c133330e795b9076.png[/img] [b]p2.[/b] Assuming that each distinct arrangement of the letters in $DISCUSSIONS$ is equally likely to occur, what is the probability that a random arrangement of the letters in $DISCUSSIONS$ has all the $S$’s together? [b]p3.[/b] Evaluate $$\frac{(1 + 2022)(1 + 2022^2)(1 + 2022^4) ... (1 + 2022^{2^{2022}})}{1 + 2022 + 2022^2 + ... + 2022^{2^{2023}-1}} .$$ [b]p4.[/b] Dr. Kraines has $27$ unit cubes, each of which has one side painted red while the other five are white. If he assembles his cubes into one $3 \times 3 \times 3$ cube by placing each unit cube in a random orientation, what is the probability that the entire surface of the cube will be white, with no red faces visible? If the answer is $2^a3^b5^c$ for integers $a$, $b$, $c$, find $|a + b + c|$. [b]p5.[/b] Let S be a subset of $\{1, 2, 3, ... , 1000, 1001\}$ such that no two elements of $S$ have a difference of $4$ or $7$. What is the largest number of elements $S$ can have? [b]p6.[/b] George writes the number $1$. At each iteration, he removes the number $x$ written and instead writes either $4x+1$ or $8x+1$. He does this until $x > 1000$, after which the game ends. What is the minimum possible value of the last number George writes? [b]p7.[/b] List all positive integer ordered pairs $(a, b)$ satisfying $a^4 + 4b^4 = 281 \cdot 61$. [b]p8.[/b] Karthik the farmer is trying to protect his crops from a wildfire. Karthik’s land is a $5 \times 6$ rectangle divided into $30$ smaller square plots. The $5$ plots on the left edge contain fire, the $5$ plots on the right edge contain blueberry trees, and the other $5 \times 4$ plots of land contain banana bushes. Fire will repeatedly spread to all squares with bushes or trees that share a side with a square with fire. How many ways can Karthik replace $5$ of his $20$ plots of banana bushes with firebreaks so that fire will not consume any of his prized blueberry trees? [b]p9.[/b] Find $a_0 \in R$ such that the sequence $\{a_n\}^{\infty}_{n=0}$ defined by $a_{n+1} = -3a_n + 2^n$ is strictly increasing. [b]p10.[/b] Jonathan is playing with his life savings. He lines up a penny, nickel, dime, quarter, and half-dollar from left to right. At each step, Jonathan takes the leftmost coin at position $1$ and uniformly chooses a position $2 \le k \le 5$. He then moves the coin to position $k$, shifting all coins at positions $2$ through $k$ leftward. What is the expected number of steps it takes for the half-dollar to leave and subsequently return to position $5$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f:R^{*} \rightarrow R$ such that $f(x)\not = x$ and $$ f(y(f(x)-x))=\frac{f(x)}{y}-\frac{f(y)}{x} $$ for any $x,y \not = 0$.

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$