Let $a \ge b \ge c > 0$. Prove that $$(a-b+c)\left(\frac{1}{a}-\frac{1}{b}+\frac{1}{c}\right) \ge 1$$

Within an equilateral triangle of side $ 15$ are $ 111$ points. Prove that it is always possible to cover three of these points by a round coin of diameter $ \sqrt{3}$, part of which may lie outside the triangle.

The triangular plot of ACD lies between Aspen Road, Brown Road and a railroad. Main Street runs east and west, and the railroad runs north and south. The numbers in the diagram indicate distances in miles. The width of the railroad track can be ignored. How many square miles are in the plot of land ACD? [asy] size(250); defaultpen(linewidth(0.55)); pair A=(-6,0), B=origin, C=(0,6), D=(0,12); pair ac=C+2.828*dir(45), ca=A+2.828*dir(225), ad=D+2.828*dir(A--D), da=A+2.828*dir(D--A), ab=(2.828,0), ba=(-6-2.828, 0); fill(A--C--D--cycle, gray); draw(ba--ab); draw(ac--ca); draw(ad--da); draw((0,-1)--(0,15)); draw((1/3, -1)--(1/3, 15)); int i; for(i=1; i<15; i=i+1) { draw((-1/10, i)--(13/30, i)); } label("$A$", A, SE); label("$B$", B, SE); label("$C$", C, SE); label("$D$", D, SE); label("$3$", (1/3,3), E); label("$3$", (1/3,9), E); label("$3$", (-3,0), S); label("Main", (-3,0), N); label(rotate(45)*"Aspen", A--C, SE); label(rotate(63.43494882)*"Brown", A--D, NW); [/asy] $\textbf{(A)}\ 2\qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4.5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 9$

At the start of this problem, six frogs are sitting at each of the six vertices of a regular hexagon, one frog per vertex. Every minute, we choose a frog to jump over another frog using one of the two rules illustrated below. If a frog at point $F$ jumps over a frog at point $P$ the frog will land at point $F'$ such that $F, P,$ and $F'$ are collinear and: - using Rule 1, $F'P = 2FP$. - using Rule 2, $F'P = FP/2$. [img]https://cdn.artofproblemsolving.com/attachments/7/0/2936bda61eb60c7b89bcd579386041022ba81f.png[/img] It is up to us to choose which frog to take the leap and which frog to jump over. (a) If we only use Rule 1, is it possible for some frog to land at the center of the original hexagon after a finite amount of time? (b) If both Rule 1 and Rule 2 are allowed (freely choosing which rule to use, which frog to jump, and which frog it jumps over), is it possible for some frog to land at the center of the original hexagon after a finite amount of time?

Show that a segment of length $ h$ can go through or be tangent to at most $ 2\lfloor h/\sqrt{2}\rfloor\plus{}2$ nonoverlapping unit spheres. [i]L.Fejes-Toth, A. Heppes[/i]

Outside of the plane of the triangle $ABC$ is given point $D$. (a) prove that if the segment $DA$ is perpendicular to the plane $ABC$ then orthogonal projection of the orthocenter of the triangle $ABC$ on the plane $BCD$ coincides with the orthocenter of the triangle $BCD$. (b) for all tetrahedrons $ABCD$ with base, the triangle $ABC$ with smallest of the four heights that from the vertex $D$, find the locus of the foot of that height.

A point $D$ is chosen on the side $AC$ of a triangle $ABC$ with $\angle C < \angle A < 90^\circ$ in such a way that $BD=BA$. The incircle of $ABC$ is tangent to $AB$ and $AC$ at points $K$ and $L$, respectively. Let $J$ be the incenter of triangle $BCD$. Prove that the line $KL$ intersects the line segment $AJ$ at its midpoint.

Al told Bob that he was thinking of $2011$ distinct positive integers. He also told Bob the sum of those $2011$ distinct positive integers. From this information, Bob was able to determine all $2011$ integers. How many possible sums could Al have told Bob? [i]Author: Ray Li[/i]

Let $(M,g)$ be an $n$-dimensional complete Riemannian manifold with $n \ge 2$. Suppose $M$ is connected and $\text{Ric} \ge (n-1)g$, where $\text{Ric}$ is the Ricci tensor of $(M,g)$. Denote by $\text{d}g$ the Riemannian measure of $(M,g)$ and by $d(x,y)$ the geodesic distance between $x$ and $y$. Prove that \[\int_{M \times M} \cos d(x,y) \text{d}g(x)\text{d}g(y) \ge 0.\] Moreover, equality holds if and only if $(M,g)$ is isometric to the unit round sphere $S^n$.

An infinite sequence $a_1, a_2,\ldots$ of positive integers is such that $a_n \geq 2$ and $a_{n+2}$ divides $a_{n+1} + a_n$ for all $n \geq 1$. Prove that there exists a prime which divides infinitely many terms of the sequence.

Let $x>y>2022$ be positive integers such that $xy+x+y$ is a perfect square. Is it possible for every positive integer $z$ from the interval $[x+3y+1,3x+y+1]$ the numbers $x+y+z$ and $x^2+xy+y^2$ not to be coprime?

Define a \emph{crossword puzzle} to be a $15 \times 15$ grid of squares, each of which is either black or white. In a crossword puzzle, define a \emph{word} to be a sequence of one or more consecutive white squares in a row or column such that the squares immediately before and after the sequence both are either black or nonexistent. (The latter case would occur if an end of a word coincides with an end of a row or column of the grid.) A crossword puzzle is \emph{tasty} if every word consists of an even number of white squares. Compute the sum of all nonnegative integers $n$ such that there exists a tasty crossword puzzle with exactly $n$ white squares. [i]Proposed by Luke Robitaille[/i]

Let $x_1<x_2< \ldots <x_{2024}$ be positive integers and let $p_i=\prod_{k=1}^{i}(x_k-\frac{1}{x_k})$ for $i=1,2, \ldots, 2024$. What is the maximal number of positive integers among the $p_i$?

Given an equilateral $\Delta ABC$, in which ${{A} _ {1}}, {{B} _ {1}}, {{C} _ {1}}$ are the midpoint of the sides $ BC, \, \, AC, \, \, AB$ respectively. The line $l$ passes through the vertex $A$, we denote by $P, Q$ the projection of the points $B, C$ on the line $l$, respectively (the line $ l $ and the point $Q, \, \, A, \, \, P$ are located as shown in fig.). Denote by $T $ the intersection point of the lines ${{B} _ {1}} P$ and ${{C} _ {1}} Q$. Prove that the line ${{A} _ {1}} T$ is perpendicular to the line $l$. [img]https://cdn.artofproblemsolving.com/attachments/4/b/61f2f4ec9e6b290dfcd47e9351110bebd3bd43.png[/img] (Serdyuk Nazar)

Consider triangle $P_1P_2P_3$ and a point $p$ within the triangle. Lines $P_1P, P_2P, P_3P$ intersect the opposite sides in points $Q_1, Q_2, Q_3$ respectively. Prove that, of the numbers \[ \dfrac{P_1P}{PQ_1}, \dfrac{P_2P}{PQ_2}, \dfrac{P_3P}{PQ_3} \] at least one is $\leq 2$ and at least one is $\geq 2$

In acute triangle $ABC,$ the feet of the altitudes are $A_1,B_1,$ and $C_1$ (with the usual notations on sides $BC,CA,$ and $AB$ respectively). The circumcircles of triangles $AB_1C_1$ and $BC_1A_1$ intersect at the circumcircle of triangle $ABC$ ar points $P\neq A$ and $Q\neq B,$ respectively. Prove that lines $AQ, BP$ and the Euler line of triangle $ABC$ are either concurrent or parallel to each other. [i]Proposed by Géza Kós, Budapest[/i]