The $n$ points $P_1,P_2, \ldots, P_n$ are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance $D_n$ between any two of these points has its largest possible value $D_n.$ Calculate $D_n$ for $n = 2$ to 7. and justify your answer.

Given a graph $G$, consider the following two quantities, $\bullet$ Assign to each vertex a number in $\{0,1,2\}$ such that for every edge $e=uv$, the numbers assigned to $u$ and $v$ have sum at least $2$. Let $A(G)$ be the minimum possible sum of the numbers written to each vertex satisfying this condition. $\bullet$ Assign to each edge a number in $\{0,1,2\}$ such that for every vertex $v$, the sum of numbers on all edges containing $v$ is at most $2$. Let $B(G)$ be the maximum possible sum of the numbers written to each edge satisfying this condition. Prove that $A(G)=B(G)$ for every graph $G$. [Note: This question is not original] [Extra: Show that this statement is still true if we replace $2$ to $n$, if and only if $n$ is even (where we replace $\{0,1,2\}$ to $\{0,1,\cdots, n\}$)]

Find all positive integers $x$ such that $3^x + x^2 + 135$ is a perfect square.

Is there a continuous function $ f: \mathbb {R} ^ {2} \rightarrow \mathbb {R} $ for every $ d \in \mathbb {R} $ we have $ g_{m,d}(x) = f (x, m x + d) $ is strictly monotonic on $ \mathbb {R} $ if $ m \ge 0, $ and not monotone on any non-empty open interval if $ m <0? $

Points $A_1, A_2, \ldots, A_{2022}$ are chosen on a plane so that no three of them are collinear. Consider all angles $A_iA_jA_k$ for distinct points $A_i, A_j, A_k$. What largest possible number of these angles can be equal to $90^\circ$? [i]Proposed by Anton Trygub[/i]

Let $ABCDE$ be a convex pentagon, such that $AB=BC$, $CD=DE$, $\angle B+\angle D=180^{\circ}$, and it's area is $\sqrt2$. a) If $\angle B=135^{\circ}$, find the length of $[BD]$. b) Find the minimum of the length of $[BD]$.

Let $a,b,c$ be the answers to problems $4$, $5$, and $6$, respectively. In $\triangle ABC$, the measures of $\angle A$, $\angle B$, and $\angle C$ are $a$, $b$, $c$ in degrees, respectively. Let $D$ and $E$ be points on segments $AB$ and $AC$ with $\frac{AD}{BD} = \frac{AE}{CE} = 2013$. A point $P$ is selected in the interior of $\triangle ADE$, with barycentric coordinates $(x,y,z)$ with respect to $\triangle ABC$ (here $x+y+z=1$). Lines $BP$ and $CP$ meet line $DE$ at $B_1$ and $C_1$, respectively. Suppose that the radical axis of the circumcircles of $\triangle PDC_1$ and $\triangle PEB_1$ pass through point $A$. Find $100x$. [i]Proposed by Evan Chen[/i]

Find all integer solutions to $2(x^5 +y^5 +1)=5xy(x^2 +y^2 +1)$.

Let $ABC$ be an acute triangle with $AB<AC$, and let $D$ and $E$ be points on side $BC$ such that $BD=CE$ and $D$ lies between $B$ and $E$. Suppose there exists a point $P$ inside $ABC$ such that $PD\parallel AE$ and $\angle PAB=\angle EAC$. Prove that $\angle PBA=\angle PCA$. [i]Calvin Deng.[/i]

Let $M$ be the set of positive odd integers. For every positive integer $n$, denote $A(n)$ the number of the subsets of $M$ whose sum of elements equals $n$. For instance, $A(9) = 2$, because there are exactly two subsets of $M$ with the sum of their elements equal to $9$: $\{9\}$ and $\{1, 3, 5\}$. a) Prove that $A(n) \le A(n + 1)$ for every integer $n \ge 2$. b) Find all the integers $n \ge 2$ such that $A(n) = A(n + 1)$

Sasha’s computer can do the following two operations: If you load the card with number $a$, it will return that card back and also prints another card with number $a+1$, and if you consecutively load the cards with numbers $a$ and $b$, it will return them back and also prints cards with all the roots of the quadratic trinomial $x^2+ax+b$ (possibly one, two, or none cards.) Initially, Sasha had only one card with number $s$. Is it true that, for any $s> 0$, Sasha can get a card with number $\sqrt{s}$?

For $a>0$, let $l$ be the line created by rotating the tangent line to parabola $y=x^{2}$, which is tangent at point $A(a,a^{2})$, around $A$ by $-\frac{\pi}{6}$. Let $B$ be the other intersection of $l$ and $y=x^{2}$. Also, let $C$ be $(a,0)$ and let $O$ be the origin. (1) Find the equation of $l$. (2) Let $S(a)$ be the area of the region bounded by $OC$, $CA$ and $y=x^{2}$. Let $T(a)$ be the area of the region bounded by $AB$ and $y=x^{2}$. Find $\lim_{a \to \infty}\frac{T(a)}{S(a)}$.

Let $S$ be a class of functions from $[0,\infty)$ to $[0,\infty)$ that satisfies: (i) The functions $f_1(x)=e^x-1$ and $f_2(x)=\ln(x+1)$ are in $S;$ (ii) If $f(x)$ and $g(x)$ are in $S,$ the functions $f(x)+g(x)$ and $f(g(x))$ are in $S;$ (iii) If $f(x)$ and $g(x)$ are in $S$ and $f(x)\ge g(x)$ for all $x\ge 0,$ then the function $f(x)-g(x)$ is in $S.$ Prove that if $f(x)$ and $g(x)$ are in $S,$ then the function $f(x)g(x)$ is also in $S.$

The sum $\sum_{x=-5}^5\sum_{y=-5}^5\frac{2^x3^y}{(1+2^x)(1+3^y)}$ can be expressed as a fraction $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

We are given $1988$ unit cubes. Using some or all of these cubes, we form three quadratic boards $A, B,C$ of dimensions $a \times a \times 1$, $b \times b \times 1$, and $c \times c \times 1$ respectively, where $a \le b \le c$. Now we place board $B$ on board $C$ so that each cube of $B$ is precisely above a cube of $C$ and $B$ does not overlap $C$. Similarly, we place $A$ on $B$. This gives us a three-floor tower. What choice of $a, b$ and $c$ gives the maximum number of such three-floor towers?

Let $k$ be a fixed odd integer, $k>3$. Prove: There exist infinitely many positive integers $n$, such that there are two positive integers $d_1, d_2$ satisfying $d_1,d_2$ each dividing $\frac{n^2+1}{2}$, and $d_1+d_2=n+k$.

Finds the sum of the infinite series $1+2\left(\dfrac{1}{1998}\right)+3\left(\dfrac{1}{1998}\right)^2+4\left(\dfrac{1}{1998}\right)^3+\cdots$.

For any integer $a$, let $f(a) = |a^4 - 36a^2 + 96a - 64|$. What is the sum of all values of $f(a)$ that are prime? [i]Proposed by Alexander Wang[/i]

Let a [i]lattice tetrahedron[/i] denote a tetrahedron whose vertices have integer coordinates. Given a lattice tetrahedron, a [i]move[/i] consists of picking some vertex and moving it parallel to one of the three edges of the face opposite the vertex so that it lands on a different point with integer coordinates. Prove that any two lattice tetrahedra with the same volume can be transformed into each other by a series of moves

Consider on the first quadrant of the trigonometric circle the arcs $AM_1 = x_1,AM_2 = x_2,AM_3 = x_3, \ldots , AM_v = x_v$ , such that $x_1 < x_2 < x_3 < \cdots < x_v$. Prove that \[\sum_{i=0}^{v-1} \sin 2x_i - \sum_{i=0}^{v-1} \sin (x_i- x_{i+1}) < \frac{\pi}{2} + \sum_{i=0}^{v-1} \sin (x_i + x_{i+1})\]

Let $ABC$ be a triangle and $\ell_1,\ell_2$ be two parallel lines. Let $\ell_i$ intersects line $BC,CA,AB$ at $X_i,Y_i,Z_i$, respectively. Let $\Delta_i$ be the triangle formed by the line passed through $X_i$ and perpendicular to $BC$, the line passed through $Y_i$ and perpendicular to $CA$, and the line passed through $Z_i$ and perpendicular to $AB$. Prove that the circumcircles of $\Delta_1$ and $\Delta_2$ are tangent.

A function $f(x)$ is such that for any integer $x$, $f(x)+xf(2-x)=6$. Compute $-2019f(2020)$.

Given $n$ lines on the plane, they divide the plane onto several bounded or bounded polygonal regions. Define the rank of a region as the number of vertices on its boundary (a vertex is a point which belongs to at least two lines). Prove that the sum of squares of ranks of all regions does not exceed $10n^2$. (D. Fomin)

Prove that for each prime number $p$ and positive integer $n$, $p^n$ divides \[\binom{p^n}{p}-p^{n-1}. \]

Let $ AB$ be the diameter of semicircle $O$ , $C, D $ be points on the arc $AB$, $P, Q$ be respectively the circumcenter of $\triangle OAC $ and $\triangle OBD $ . Prove that:$CP\cdot CQ=DP \cdot DQ$.[asy] import cse5; import olympiad; unitsize(3.5cm); dotfactor=4; pathpen=black; real h=sqrt(55/64); pair A=(-1,0), O=origin, B=(1,0),C=shift(-3/8,h)*O,D=shift(4/5,3/5)*O,P=circumcenter(O,A,C), Q=circumcenter(O,D,B); D(arc(O,1,0,180),darkgreen); D(MP("A",A,W)--MP("C",C,N)--MP("P",P,SE)--MP("D",D,E)--MP("Q",Q,E)--C--MP("O",O,S)--D--MP("B",B,E)--cycle,deepblue); D(O); [/asy]