Prove that there exist infinitely many integers $n$ such that $n$, $n+1$, $n+2$ are each the sum of the squares of two integers. [Example: $0=0^2+0^2$, $1=0^2+1^2$, $2=1^2+1^2$.]

You are given a sequence of $58$ terms; each term has the form $P+n$ where $P$ stands for the product $2 \times 3 \times 5 \times... \times 61$ of all prime numbers less than or equal to $61$, and $n$ takes, successively, the values $2, 3, 4, ...., 59$. let $N$ be the number of primes appearing in this sequence. Then $N$ is: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 17\qquad\textbf{(D)}\ 57\qquad\textbf{(E)}\ 58 $

[b]p19.[/b] $A_1A_2...A_{12}$ is a regular dodecagon with side length $1$ and center at point $O$. What is the area of the region covered by circles $(A_1A_2O)$, $(A_3A_4O)$, $(A_5A_6O)$, $(A_7A_8O)$, $(A_9A_{10}O)$, and $(A_{11}A_{12}O)$? $(ABC)$ denotes the circle passing through points $A,B$, and $C$. [b]p20.[/b] Let $N = 2000... 0x0 ... 00023$ be a $2023$-digit number where the $x$ is the $23$rd digit from the right. If$ N$ is divisible by $13$, compute $x$. [b]p21.[/b] Alice and Bob each visit the dining hall to get a grilled cheese at a uniformly random time between $12$ PM and $1$ PM (their arrival times are independent) and, after arrival, will wait there for a uniformly random amount of time between $0$ and $30$ minutes. What is the probability that they will meet? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $n\in\mathbb{Z_+}$, positive real numbers $a+b=2$, then the minumum value of $\frac{1}{1+a^n}+\frac{1}{1+b^n}$ is________.

Several diagonals (possibly intersecting each other) are drawn in a convex $n$-gon in such a way that no three diagonals intersect in one point. If the $n$-gon is cut into triangles, what is the maximum possible number of these triangles?

For all positive integer $n$, define $f_n(x)$ such that $f_n(x) = \sum_{k=1}^n{|x - k|}$. Determine all solution from the inequality $f_n(x) < 41$ for all positive $2$-digit integers $n$ (in decimal notation).

A mathematician is walking through a library with twenty-six shelves, one for each letter of the alphabet. As he walks, the mathematician will take at most one book off each shelf. He likes symmetry, so if the letter of a shelf has at least one line of symmetry (e.g., M works, L does not), he will pick a book with probability $\frac12$. Otherwise he has a $\frac14$ probability of taking a book. What is the expected number of books that the mathematician will take?

Let $O$ be the circumcenter of triangle ABC, $H$ be its orthocenter, and $M$ be the midpoint of $AB$. The line $MH$ meets the line passing through $O$ and parallel to $AB$ at point $K$ lying on the circumcircle of $ABC$. Let $P$ be the projection of $K$ onto $AC$. Prove that $PH \parallel BC$.

Given a tetrahedron $PABC$, draw the height $PH$ from vertex $P$ to $ABC$. From point $H$, draw perpendiculars $HA’,HB’,HC’$ to the lines $PA,PB,PC$. Suppose the planes $ABC$ and $A’B’C’$ intersects at line $\ell$. Let $O$ be the circumcenter of triangle $ABC$. Prove that $OH\perp \ell$.

Compute the smallest nonnegative integer that can be written as the sum of 2020 distinct integers.

Let $\triangle ABC$ be inscribed in circle $O$ with $\angle ABC = 36^\circ$. $D$ and $E$ are on the circle such that $\overline{AD}$ and $\overline{CE}$ are diameters of circle $O$. List all possible positive values of $\angle DBE$ in degrees in order from least to greatest. [i]Proposed by Ambrose Yang[/i]

In the diagram below, $\overline{AB}$ and $\overline{CD}$ are parallel, $\angle BXY = 45^\circ$, $\angle DZY = 25^\circ$, and $XY = YZ$. What is the degree measure of $\angle YXZ$? [asy] import graph; usepackage("amsmath"); size(6cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw((-2,4)--(3,4)); draw((-2,2)--(3,2)); draw((0,4)--(1,3)); draw((1,3)--(-1.14,2)); label("$ A $",(-2.13,4.6),SE*labelscalefactor); label("$ B $",(2.8,4.6),SE*labelscalefactor); label("$ C $",(-2.29,1.8),SE*labelscalefactor); label("$ D $",(2.83,1.8),SE*labelscalefactor); label("$ 45^\circ $",(0.49,3.9),SE*labelscalefactor); label("$ 25^\circ $",(-0.26,2.4),SE*labelscalefactor); label("$ Y $",(1.21,3.2),SE*labelscalefactor); label("$ X $",(-0.16,4.6),SE*labelscalefactor); label("$ Z $",(-1.28,1.8),SE*labelscalefactor); dot((-2,4),dotstyle); dot((3,4),dotstyle); dot((-2,2),dotstyle); dot((3,2),dotstyle); dot((0,4),dotstyle); dot((1,3),dotstyle); dot((-1.14,2),dotstyle); [/asy]

Let $A$, $X$ and $Y$ be three non-collinear points on the plane. Construct with a straightedge and compass a square $ABCD$ such that $X$ is on the line $BC$ and $Y$ is on the line $CD$.

Find all prime numbers $p$ for which $x^4\equiv -1\, (mod\, p)$ has a solution.

The consecutive angles of a trapezoid form an arithmetic sequence. If the smallest angle is $75^\circ$, then the largest angle is $\textbf{(A) }95^\circ\qquad \textbf{(B) }100^\circ\qquad \textbf{(C) }105^\circ\qquad \textbf{(D) }110^\circ\qquad \textbf{(E) }115^\circ$

We color each unit square of a $8\times 8$ table into green or blue such that there are $a$ green unit squares in each $3 \times 3$ square and $b$ green unit squares in each $2 \times 4$ rectangle. Find all possible values of $(a, b)$. (Le Anh Vinh)