Let $ABCD$ be a rhombus with $\angle BAD < 90^o$. The circle passing through $D$ with center $A$ intersects the line $CD$ a second time in point $E$. Let $S$ be the intersection of the lines $BE$ and $AC$. Prove that the points $A$, $S$, $D$ and $E$ lie on a circle. [i](Karl Czakler)[/i]

Given positive integer $n$. Prove that for any integers $a_1,a_2,\cdots,a_n,$ at least $\lceil \tfrac{n(n-6)}{19} \rceil$ numbers from the set $\{ 1,2, \cdots, \tfrac{n(n-1)}{2} \}$ cannot be represented as $a_i-a_j (1 \le i, j \le n)$.

Two right circular cones with vertices facing down as shown in the figure below contain the same amount of liquid. The radii of the tops of the liquid surfaces are $3 \text{ cm}$ and $6 \text{ cm}$. Into each cone is dropped a spherical marble of radius $1 \text{ cm}$, which sinks to the bottom and is completely submerged without spilling any liquid. What is the ratio of the rise of the liquid level in the narrow cone to the rise of the liquid level in the wide cone? $\textbf{(A) }1:1 \qquad \textbf{(B) }47:43 \qquad \textbf{(C) }2:1 \qquad \textbf{(D) }40:13 \qquad \textbf{(E) }4:1$ [asy] size(350); defaultpen(linewidth(0.8)); real h1 = 10, r = 3.1, s=0.75; pair P = (r,h1), Q = (-r,h1), Pp = s * P, Qp = s * Q; path e = ellipse((0,h1),r,0.9), ep = ellipse((0,h1*s),r*s,0.9); draw(ellipse(origin,r*(s-0.1),0.8)); fill(ep,gray(0.8)); fill(origin--Pp--Qp--cycle,gray(0.8)); draw((-r,h1)--(0,0)--(r,h1)^^e); draw(subpath(ep,0,reltime(ep,0.5)),linetype("4 4")); draw(subpath(ep,reltime(ep,0.5),reltime(ep,1))); draw(Qp--(0,Qp.y),Arrows(size=8)); draw(origin--(0,12),linetype("4 4")); draw(origin--(r*(s-0.1),0)); label("$3$",(-0.9,h1*s),N,fontsize(10)); real h2 = 7.5, r = 6, s=0.6, d = 14; pair P = (d+r-0.05,h2-0.15), Q = (d-r+0.05,h2-0.15), Pp = s * P + (1-s)*(d,0), Qp = s * Q + (1-s)*(d,0); path e = ellipse((d,h2),r,1), ep = ellipse((d,h2*s+0.09),r*s,1); draw(ellipse((d,0),r*(s-0.1),0.8)); fill(ep,gray(0.8)); fill((d,0)--Pp--Qp--cycle,gray(0.8)); draw(P--(d,0)--Q^^e); draw(subpath(ep,0,reltime(ep,0.5)),linetype("4 4")); draw(subpath(ep,reltime(ep,0.5),reltime(ep,1))); draw(Qp--(d,Qp.y),Arrows(size=8)); draw((d,0)--(d,10),linetype("4 4")); draw((d,0)--(d+r*(s-0.1),0)); label("$6$",(d-r/4,h2*s-0.06),N,fontsize(10)); [/asy]

Segments connecting an inner point of a convex non-equilateral n-gon to its vertices divide the n-gon into n equal triangles. What is the least possible n?

Let $f: \mathbb R \to \mathbb R$ and $g: \mathbb R \to \mathbb R$ be two functions satisfying \[\forall x,y \in \mathbb R: \begin{cases} f(x+y)=f(x)f(y),\\ f(x)= x g(x)+1\end{cases} \quad \text{and} \quad \lim_{x \to 0} g(x)=1.\] Find the derivative of $f$ in an arbitrary point $x.$

Prove that there is no inclined plane such that any tetrahedron placed arbitrarily with a certain face on the plane will not fall over. It means the following: Given a plane $ \pi $ and a line $ l $ not perpendicular to it. Prove that there is a tetrahedron $ T $ such that for each of its faces $ S $ there is in the plane $ \pi $ a triangle $ ABC $ congruent to $ S $ and there is a point $ D $ such that the tetrahedron $ ABCD $ congruent to $ T $ and the line parallel to $ l $ passing through the center of gravity of the tetrahedron $ ABCD $ does not intersect the triangle $ ABC $. Note. The center of gravity of a tetrahedron is the intersection point of the segments connecting the centers of gravity of the faces of this tetrahedron with the opposite vertices (it is known that such a point always exists).

In the electoral college, each of $51$ places get some positive number of electoral votes for a nationwide total of $538$. Thus, $270$ electoral votes guarantees a win. Across all distributions of electoral votes to each place, let $M$ be the maximum number of sets of places that combine to have at least $270$ electoral votes. Find $M$.

A line passing through $(20,21)$ intersects the curve $y = x^3-2x^2-3x+5$ at three distinct points $A, B,$ and $C,$ such that $B$ is the midpoint of $\overline{AC}$. The slope of this line is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $k$ be the incircle of the triangle $ABC$ with the center of the incircle $I$. The circle $k$ touches the sides $BC, CA$ and $AB$ in points $D, E$ and $F$. Let $G$ be the intersection of the straight line $AI$ and the circle $k$, which lies between $A$ and $I$. Assume $BE$ and $FG$ are parallel. Show that $BD = EF$.

Suppose that real numbers $x,y,z$ satisfy $$\frac{\cos x+\cos y+\cos z}{\cos(x+y+z)}=\frac{\sin x+\sin y+\sin z}{\sin(x+y+z)}=p.$$Prove that $\cos(x+y)+\cos(y+z)+\cos(x+z)=p$.

Find the number of pairs of integers $(a,b)$ with $0 \le a,b \le 2019$ where $ax \equiv b \pmod{2020}$ has exactly $2$ integer solutions $0 \le x \le 2019$. [i]Proposed by Richard Chen[/i]

Let $n$ be a positive integer. Let $\mathcal{F}$ be a family of sets that contains more than half of all subsets of an $n$-element set $X$. Prove that from $\mathcal{F}$ we can select $\lceil \log_2 n \rceil + 1$ sets that form a separating family on $X$, i.e., for any two distinct elements of $X$ there is a selected set containing exactly one of the two elements. Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=614827&hilit=Schweitzer+2014+separating

Prove that $1\cdot2\cdot3\cdots 2002<\left(\frac{2003}{2}\right)^{2002}.$

Let $\Gamma_1$ be a circle with centre $A$ and $\Gamma_2$ be a circle with centre $B$, with $A$ lying on $\Gamma_2$. On $\Gamma_2$ there is a (variable) point $P$ not lying on $AB$. A line through $P$ is a tangent of $\Gamma_1$ at $S$, and it intersects $\Gamma_2$ again in $Q$, with $P$ and $Q$ lying on the same side of $AB$. A different line through $Q$ is tangent to $\Gamma_1$ at $T$. Moreover, let $M$ be the foot of the perpendicular to $AB$ through $P$. Let $N$ be the intersection of $AQ$ and $MT$. Show that $N$ lies on a line independent of the position of $P$ on $\Gamma_2$.

Let $ABC$ be a triangle, and let $D$ and $E$ be two points on side $BC$ such that $BD = EC$. Let $X$ be a point on segment $AD$ such that $CX$ is parallel to the bisector of $\angle ADB$. Similarly, let $Y$ be a point on segment $AD$ such that $BY$ is parallel to the bisector of $\angle ADC$. Prove that $DE = XY$.

In a triangle $ABC$, the bisectors of the angles at $B$ and $A$ meet the opposite sides at $P$ and $Q$, respectively. Suppose that the circumcircle of triangle $PQC$ passes through the incenter $R $ of $\vartriangle ABC$. Given that $PQ = l$, find all sides of triangle $PQR$.

In a class of $30$ students, each students knows exactly six other students. (Of course, knowing is a mutual relation, so if $A$ knows $B$, then $B$ knows $A$). A group of three students is balanced if either all three students know each other, or no one knows anyone else within that group. How many balanced groups exist?

Let $f$ be a function that associates a positive integer $(x, y)$ with each pair of positive integers $f(x, y)$. Suppose that $f(x, y) \le xy$ for all positive integers $x$, $y$. Show that there are $2023$ different pairs $(x_1, y_1)$,$...$, $ (x_{2023}, y_{2023}$) such that $$f(x_1, y_1) = f(x_2, y_2) = ....= f(x_{2023}, y_{2023}).$$

Prove that $\frac{a^3}{bc} + \frac{b^3}{ca} + \frac{c^3}{ba} \ge a + b + c$, for all positive real numbers $a, b$, and $c$.

Let $ABC$ be a triangle, and let $O$ be its circumcenter. Let $\overline{CO}\cap AB\equiv D$. Let $\angle BAC=\alpha$, and $\angle CBA=\beta$. Prove that $$\dfrac{OD}{OC}=\Bigg|\dfrac{\cos(\alpha+\beta)}{\cos(\alpha-\beta)}\Bigg|$$\\ For clarification, $\overline{CO}$ represents the line $CO$, and $AC$ represents the segment $AC$. Cases in which $D$ doesn't exist should be ignored.

Prove that if the product $1\cdot 2\cdot ...\cdot n$ ($n> 3$) is not divisible by $n + 1$, then $n + 1$ is prime.

Let $C: y=\ln x$. For each positive integer $n$, denote by $A_n$ the area of the part enclosed by the line passing through two points $(n,\ \ln n),\ (n+1,\ \ln (n+1))$ and denote by $B_n$ that of the part enclosed by the tangent line at the point $(n,\ \ln n)$, $C$ and the line $x=n+1$. Let $g(x)=\ln (x+1)-\ln x$. (1) Express $A_n,\ B_n$ in terms of $n,\ g(n)$ respectively. (2) Find $\lim_{n\to\infty} n\{1-ng(n)\}$.

There are several contestants at a math olympiad. We say that two contestants $ A$ and $ B$ are [i]indirect friends[/i] if there are contestants $ C_1, C_2, ..., C_n$ such that $ A$ and $ C_1$ are friends, $ C_1$ and $ C_2$ are friends, $ C_2$ and $ C_3$ are friends, ..., $ C_n$ and $ B$ are friends. In particular, if $ A$ and $ B$ are friends themselves, they are [i]indirect friends[/i] as well. Some of the contestants were friends before the olympiad. During the olympiad, some contestants make new friends, so that after the olympiad every contestant has at least one friend among the other contestants. We say that a contestant is [i]special[/i] if, after the olympiad, he has exactly twice as indirect friends as he had before the olympiad. Prove that the number of special contestants is less or equal than $ \frac{2}{3}$ of the total number of contestants.

Find all polynomials $P(x)$ which have the properties: 1) $P(x)$ is not a constant polynomial and is a mononic polynomial. 2) $P(x)$ has all real roots and no duplicate roots. 3) If $P(a)=0$ then $P(a|a|)=0$ [i](nooonui)[/i]

In rectangular coodinate system $Oxy$, consider the line $y=3x$ and point $A(4,3)$. Find on the line $y=3x$, point $B\ne O$ such that the area of triangle $OBC$ is the minimum possible, where $C= AB\cap Ox$.