What is the smallest possible value of the least common multiple of $a, b, c, d$ if we know that these four numbers are distinct and $a + b + c + d = 1000$?

Kayla rolls four fair $6$-sided dice. What is the probability that at least one of the numbers Kayla rolls is greater than $4$ and at least two of the numbers she rolls are greater than $2$? $\textbf{(A)}\frac{2}{3}~\textbf{(B)}\frac{19}{27}~\textbf{(C)}\frac{59}{81}~\textbf{(D)}\frac{61}{81}~\textbf{(E)}\frac{7}{9}$

Find maximal numbers of planes, such there are $6$ points and 1) $4$ or more points lies on every plane. 2) No one line passes through $4$ points.

$f(x)$ is a quartic polynomial with a leading coefficient $1$ where $f(2)=4$, $f(3)=9$, $f(4)=16$, and $f(5)=25$. Compute $f(8)$.

In tetrahedron $ ABCD$, radius four circumcircles of four faces are equal. Prove that $ AB\equal{}CD$, $ AC\equal{}BD$ and $ AD\equal{}BC$.

Given positive integers $k, m, n$ such that $1 \leq k \leq m \leq n$. Evaluate \[\sum^{n}_{i=0} \frac{(-1)^i}{n+k+i} \cdot \frac{(m+n+i)!}{i!(n-i)!(m+i)!}.\]

On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.

In how many different ways can you write $2016$ as the sum of a sequence of consecutive natural numbers?

Find largest possible constant $M$ such that, for any sequence $a_n$, $n=0,1,2,...$ of real numbers, that satisfies the conditions : i) $a_0=1$, $a_1=3$ ii) $a_0+a_1+...+a_{n-1} \ge 3 a_n - a_{n+1}$ for any integer $n\ge 1$ to be true that $$\frac{a_{n+1}}{a_n} >M$$ for any integer $n\ge 0$.

Initially, all the squares of an $8\times 8$ grid are white. You start by choosing one of the squares and coloring it gray. After that, you may color additional squares gray one at a time, but you may only color a square gray if it has exactly $1$ or $3$ gray neighbors at that moment (where a neighbor is a square sharing an edge). For example, the configuration below (of a smaller $3\times 4$ grid) shows a situation where six squares have been colored gray so far. The squares that can be colored at the next step are marked with a dot. Is it possible to color all the squares gray? Justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/1/c/d50ab269f481e4e516dace06a991e6b37f2a85.png[/img]

Fifty students take part in a mathematical competition where a set of $8$ problems is given (same set to each participant). The final result showed that a total of $171$ correct solutions were obtained. Prove that there are $3$ of the given problems that have been correctly solved by the same $3$ students.

(1) Let $a,b,c$ be positive real numbers satisfying $(a^2+b^2+c^2)^2>2(a^4+b^4+c^4)$. Prove that $a,b,c$ can be the lengths of three sides of a triangle respectively. (2) Let $a_1,a_2,\dots ,a_n$ be $n$ ($n>3$) positive real numbers satisfying $(a_1^2+a_2^2+\dots +a_n^2)^2>(n-1)(a_1^4+ a_2^4+\dots +a_n^4)$. Prove that any three of $a_1,a_2,\dots ,a_n$ can be the lengths of three sides of a triangle respectively.

Let $G$ be a graph whose vertices are the integers. Assume that any two integers are connected by a finite path in $G$. For two integers $x$ and $y$, we denote by $d(x, y)$ the length of the shortest path from $x$ to $y$, where the length of a path is the number of edges in it. Assume that $d(x, y) \mid x-y$ for all integers $x, y$ and define $S(G)=\{d(x, y) | x, y \in \mathbb{Z}\}$. Find all possible sets $S(G)$.

An ant starts at the origin of the Cartesian coordinate plane. Each minute it moves randomly one unit in one of the directions up, down, left, or right, with all four directions being equally likely; its direction each minute is independent of its direction in any previous minutes. It stops when it reaches a point $(x,y)$ such that $|x|+|y|=3$. The expected number of moves it makes before stopping can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $100m+n$. [i]Proposed by Yannick Yao[/i]

A pentagon $ABCDE$ is inscribed in a circle $O$, and satises $AB = BC , AE = DE$. The circle that is tangent to $DE$ at $E$ and passing $A$ hits $EC$ at $F$ and $BF$ at $G (\ne F)$. Let $DG\cap O = H (\ne D)$. Prove that the tangent to $O$ at $E$ is perpendicular to $HA$.

Let $ABC$ be an acute triangle with circumcenter $O$, and let $D$, $E$, and $F$ be the feet of altitudes from $A$, $B$, and $C$ to sides $BC$, $CA$, and $AB$, respectively. Denote by $P$ the intersection of the tangents to the circumcircle of $ABC$ at $B$ and $C$. The line through $P$ perpendicular to $EF$ meets $AD$ at $Q$, and let $R$ be the foot of the perpendicular from $A$ to $EF$. Prove that $DR$ and $OQ$ are parallel.

Points $P, Q, R$ were marked on the sides $BC, CA, AB$, respectively. Let $a$ be tangent at point $A$ to the circumcircle of triangle $AQR$, $b$ be tangent at point $B$ to the circumcircle of the triangle BPR, $c$ be tangent at point $C$ to the circumscribed circle triangle $CPQ$. Let $X$ be the point of intersection of the lines $b$ and $c, Y$ be the point the intersection of lines $c$ and $a, Z$ is the point of intersection of lines $a$ and $b$. Prove that the lines $AX, BY, CZ$ intersect at one point if and only if the lines $AP, BQ, CR$ intersect at one point.

Two projectiles are launched from a $35$ meter ledge as shown in the diagram. One is launched from a $37$ degree angle above the horizontal and the other is launched from $37$ degrees below the horizontal. Both of the launches are given the same initial speed of $v_\text{0} = \text{50 m/s}$. [asy] size(300); import graph; draw((-8,0)--(0,0)--(0,-11)--(30,-11)); draw((0,-11)--(-4.5,-11),dashdotted); draw((0,0)--(12,0),dashdotted); label(scale(0.75)*"35 m",(0,-5.5),5*W); draw((-4,-4.5)--(-4,-0.5),EndArrow(size=5)); draw((-4,-6)--(-4,-10.5),EndArrow(size=5)); // Projectiles real f(real x){ return -11x^2/49; } draw(graph(f,0,7),dashed+linewidth(1.5)); real g(real x){ return -6x^2/145+119x/145; } draw(graph(g,0,29),dashed+linewidth(1.5)); // Labels label(scale(0.75)*"Projectile 1",(20,2),E); label(scale(0.75)*"Projectile 2",(6,-7),E); [/asy] The difference in the times of flight for these two projectiles, $t_1-t_2$, is closest to (A) $\text{3 s}$ (B) $\text{5 s}$ (C) $\text{6 s}$ (D) $\text{8 s}$ (E) $\text{10 s}$

Can you find five prime numbers $p, q, r, s, t$ such that $p^3+q^3+r^3+s^3 =t^3$?

Let $ABC$ be an acute scalene triangle with circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to the side $BC$. The lines $BC$ and $AO$ intersect at $E$. Let $s$ be the line through $E$ perpendicular to $AO$. The line $s$ intersects $AB$ and $AC$ at $K$ and $L$, respectively. Denote by $\omega$ the circumcircle of triangle $AKL$. Line $AD$ intersects $\omega$ again at $X$. Prove that $\omega$ and the circumcircles of triangles $ABC$ and $DEX$ have a common point.

Find the smallest positive integer $N$ satisfies : 1 . $209$│$N$ 2 . $ S (N) = 209 $ ( # Here $S(m)$ means the sum of digits of number $m$ )

Let $ABC$ be a triangle with the medians $AA_1, BB_1$ and $CC_1{}$. Prove that if the circumcircles of $BCB_1, CAC_1$ and $ABA_1$ are congruent then $ABC$ is equilateral.

The equations $x^2 +2ax+b^2 = 0$ and $x^2 +2bx+c^2 = 0$ both have two different real roots. Determine the number of real roots of the equation $x^2 + 2cx + a^2 = 0.$

Let $ABCD$ be a cyclic quadrilateral such that $\angle ACB = 2\angle CAD$ and $\angle ACD = 2\angle BAC$. Prove that $|CA| = |CB| + |CD|$.

For integer $k \ge 1$, let $a_k =\frac{k}{4k^4 + 1}$. Find the least integer $n$ such that $a_1 + a_2 + a_3 + ... + a_n > \frac{505.45}{2022}$.