Nick has a terrible sleep schedule. He randomly picks a time between 4 AM and 6 AM to fall asleep, and wakes up at a random time between 11 AM and 1 PM of the same day. What is the probability that Nick gets between 6 and 7 hours of sleep?

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

[b]p1.[/b] $ABCD$ is a convex quadrilateral such that $AB = 20$, $BC = 24$, $CD = 7$, $DA = 15$, and $\angle DAB$ is a right angle. What is the area of $ABCD$? [b]p2.[/b] A triangular number is one that can be written in the form $1 + 2 +...·+n$ for some positive number $n$. $ 1$ is clearly both triangular and square. What is the next largest number that is both triangular and square? [b]p3.[/b] Find the last (i.e. rightmost) three digits of $9^{2008}$. [b]p4.[/b] When expressing numbers in a base $b \ge 11$, you use letters to represent digits greater than $9$. For example, $A$ represents $10$ and $B$ represents $11$, so that the number $110$ in base $10$ is $A0$ in base $11$. What is the smallest positive integer that has four digits when written in base $10$, has at least one letter in its base $12$ representation, and no letters in its base $16$ representation? [b]p5.[/b] A fly starts from the point $(0, 16)$, then flies straight to the point $(8, 0)$, then straight to the point $(0, -4)$, then straight to the point $(-2, 0)$, and so on, spiraling to the origin, each time intersecting the coordinate axes at a point half as far from the origin as its previous intercept. If the fly flies at a constant speed of $2$ units per second, how many seconds will it take the fly to reach the origin? [b]p6.[/b] A line segment is divided into two unequal lengths so that the ratio of the length of the short part to the length of the long part is the same as the ratio of the length of the long part to the length of the whole line segment. Let $D$ be this ratio. Compute $$D^{-1} + D^{[D^{-1}+D^{(D^{-1}+D^2)}]}.$$ [b]p7.[/b] Let $f(x) = 4x + 2$. Find the ordered pair of integers $(P, Q)$ such that their greatest common divisor is $1, P$ is positive, and for any two real numbers $a$ and $b$, the sentence: “$P a + Qb \ge 0$” is true if and only if the following sentence is true: “For all real numbers x, if $|f(x) - 6| < b$, then $|x - 1| < a$.” [b]p8.[/b] Call a rectangle “simple” if all four of its vertices have integers as both of their coordinates and has one vertex at the origin. How many simple rectangles are there whose area is less than or equal to $6$? [b]p9.[/b] A square is divided into eight congruent triangles by the diagonals and the perpendicular bisectors of its sides. How many ways are there to color the triangles red and blue if two ways that are reflections or rotations of each other are considered the same? [b]p10.[/b] In chess, a knight can move by jumping to any square whose center is $\sqrt5$ units away from the center of the square that it is currently on. For example, a knight on the square marked by the horse in the diagram below can move to any of the squares marked with an “X” and to no other squares. How many ways can a knight on the square marked by the horse in the diagram move to the square with a circle in exactly four moves? [img]https://cdn.artofproblemsolving.com/attachments/d/9/2ef9939642362182af12089f95836d4e294725.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the smallest positive integer $n$ for which the number \[ A_n = \prod_{k=1}^n \binom{k^2}{k} = \binom{1}{1} \binom{4}{2} \cdots \binom{n^2}{n} \] ends in the digit $0$ when written in base ten. [i]Proposed by Evan Chen[/i]

Rational Man and Irrational Man both buy new cars, and they decide to drive around two racetracks from time $t=0$ to time $t=\infty$. Rational Man drives along the path parametrized by \begin{align*}x&=\cos(t)\\y&=\sin(t)\end{align*} and Irrational Man drives along the path parametrized by \begin{align*}x&=1+4\cos\frac{t}{\sqrt{2}}\\ y&=2\sin\frac{t}{\sqrt{2}}.\end{align*} Find the largest real number $d$ such that at any time $t$, the distance between Rational Man and Irrational Man is not less than $d$.

For an arbitrary prime number $p$, show that there exists infinitely many multiples of $p$ that can be expressed as the form $$\frac{x^2+y+1}{x+y^2+1}$$ Where $x, y$ are some positive integers.

$(BEL 1)$ A parabola $P_1$ with equation $x^2 - 2py = 0$ and parabola $P_2$ with equation $x^2 + 2py = 0, p > 0$, are given. A line $t$ is tangent to $P_2.$ Find the locus of pole $M$ of the line $t$ with respect to $P_1.$

Let us name a move of the chess knight horizontal if it moves two cells horizontally and one vertically, and vertical otherwise. It is required to place the knight on a cell of a ${46} \times {46}$ board and alternate horizontal and vertical moves. Prove that if each cell is visited not more than once then the number of moves does not exceed 2024. Alexandr Gribalko

Let triangle $\vartriangle ABC$ be a triangle with $AB = 5$, $BC = 7$, and $CA = 8$, and let $I$ be the incenter of $\vartriangle ABC$. Let circle $C_A$ denote the circle with center $A$ and radius $\overline{AI}$, denote $C_B$ and circle $C_C$ similarly. Besides all intersecting at $I$, the circles $C_A$,$C_B$,$C_C$ also intersect pairwise at $F$, $G$, and $H$. Compute the area of triangle $\vartriangle FGH$.

$A$ and $B$ are any two subsets of $\{1, 2,...,n - 1\}$ such that $|A| +|B|> n - 1$. Prove that one can find $a$ in $A$ and $b$ in $B$ such that $a + b = n$.

For a positive integer $n$, let $A_n$ be the set of all positive numbers greater than $1$ and less than $n$ which are coprime to $n$. Find all $n$ such that all the elements of $A_n$ are prime numbers.

Consider a rectangular grid of $ 10 \times 10$ unit squares. We call a [i]ship[/i] a figure made up of unit squares connected by common edges. We call a [i]fleet[/i] a set of ships where no two ships contain squares that share a common vertex (i.e. all ships are vertex-disjoint). Find the greatest natural number that, for each its representation as a sum of positive integers, there exists a fleet such that the summands are exactly the numbers of squares contained in individual ships.

Yannick is playing a game with $100$ rounds, starting with $1$ coin. During each round, there is an $n\%$ chance that he gains an extra coin, where $n$ is the number of coins he has at the beginning of the round. What is the expected number of coins he will have at the end of the game?

Show that for any $8$ distinct positive real numbers, one can choose a quadraple of them $(a,b,c,d)$ , all distinct such that $$(ac+bd)^2 \ge \frac{2+\sqrt3}{4}\left(a^2+b^2 \right)\left(c^2+d^2 \right)$$ [i]Proposed by Evan Chang (squareman), USA[/i]

The sequence $x_0, x_1, x_2, ...$ is defined by $x_0 = 0$, $x_{k+1} = [(n - \sum_0^k x_i)/2]$. Show that $x_k = 0$ for all sufficiently large $k$ and that the sum of the non-zero terms $x_k$ is $n-1$.

After the schoolday is over, Juku must attend an extra math class. The teacher writes a quadratic equation $ x^2\plus{} p_1x\plus{}q_1 \equal{} 0$ with integer coefficients on the blackboard and Juku has to find its solutions. If they are not both integers, Jukumay go home. If the solutions are integers, then the teacher writes a new equation $ x^2 \plus{} p_2x \plus{} q_2 \equal{} 0,$ where $ p_2$ and $ q_2$ are the solutions of the previous equation taken in some order, and everything starts all over. Find all possible values for $ p_1$ and $ q_1$ such that the teacher can hold Juku at school forever.

Inside $\angle BAC = 45 {} ^ \circ$ the point $P$ is selected that the conditions $\angle APB = \angle APC = 45 {} ^ \circ $ are fulfilled. Let the points $M$ and $N$ be the projections of the point $P$ on the lines $AB$ and $AC$, respectively. Prove that $BC\parallel MN $. (Serdyuk Nazar)

Find all continuous functions $f: R \to R$ such that for all reals $x$ and $y$, $f(x+f(y)) = y+f(x+1)$.

Given the circumradius $R$ of a triangle, a side length $c$, and the ratio $a/b$ of the other two side lengths, determine all three sides and angles of this triangle.

Is it possible to pair up the numbers $0, 1, 2, 3,... , 61$ in such a way that when we sum each pair, the product of the $31$ numbers we get is a perfect f ifth power?

Let $h$ be a semicircle with diameter $AB$. The two circles $k_1$ and $k_2$, $k_1 \ne k_2$, touch the segment $AB$ at the points $C$ and $D$, respectively, and the semicircle $h$ fom the inside at the points $E$ and $F$, respectively. Prove that the four points $C$, $D$, $E$ and $F$ lie on a circle. [i](Walther Janous)[/i]

In the language of wolves has two letters $F$ and $P$, any finite sequence which forms a word. А word $Y$ is called 'subpart' of word $X$ if Y is obtained from X by deleting some letters (for example, the word $FFPF$ has 8 'subpart's: F, P, FF, FP, PF, FFP, FPF, FFF). Determine $n$ such that the $n$ is the greatest number of 'subpart's can have n-letter word language of wolves. F. Petrov, V. Volkov

Daniel, Ethan, and Zack are playing a multi-round game of Tetris. Whoever wins $11$ rounds first is crowned the champion. However Zack is trying to pull off a "reverse-sweep", where (at-least) one of the other two players first hits $10$ wins while Zack is still at $0$, but Zack still ends up being the first to reach $11$. How many possible sequences of round wins can lead to Zack pulling off a reverse sweep? [i]Proposed by Dilhan Salgado[/i]

Let $P$ be an interior point of the isosceles triangle $ABC$ with $\hat{A} = 90^{\circ}$. If $$\widehat{PAB} + \widehat{PBC} + \widehat{PCA} = 90^{\circ},$$ prove that $AP \perp BC$. Proposed by [i]Mehmet Akif Yıldız, Turkey[/i]

Each of the sides $AB$ and $CD$ of a convex quadrilateral $ABCD$ is divided into three equal parts, $|AE| = |EF| = |F B|$ , $|DP| = |P Q| = |QC|$. The diagonals of $AEPD$ and $FBCQ$ intersect at $M$ and $N$, respectively. Prove that the sum of the areas of $\vartriangle AMD$ and $\vartriangle BNC$ is equal to the sum of the areas of $\vartriangle EPM$ and $\vartriangle FNQ$.