Five members of the Lexington Math Team are sitting around a table. Each flips a fair coin. Given that the probability that three consecutive members flip heads is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Proposed by Alex Li[/i]

Let $N$ be a positive integer. A non-decreasing sequence $a_1 \le a_2 \le \dots$ of positive integers is said to be $N$-rioplatense if there exists an index $i$ such that $N = \frac{i}{a_i}$. Show that every sequence $2024$-rioplatense is $k$-rioplatense for $k=1, 2, 3, \dots, 2023$.

A graup of pirates had an argument and not each of them holds some other two at gunpoint.All the pirates are called one by one in some order.If the called pirate is still alive , he shoots both pirates he is aiming at ( some of whom might already be dead .) All shorts are immediatcly lethal . After all the pirates have been called , it turns out the exactly $28$ pirates got killed . Prove that if the pirates were called in whatever other order , at least $10$ pirates would have been killed anyway.

In an island there are $n$ castles, and each castle is in country $A$ or $B$. There is one commander per castle, and each commander belongs to the same country as the castle he's initially in. There are some (two-way) roads between castles (there may be roads between castles of different countries), and call two castles adjacent if there is a road between them. Prove that the following two statements are equivalent: (1) If some commanders from country $B$ move to attack an adjacent castle in country $A$, some commanders from country $A$ could appropriately move in defense to adjacent castles in country $A$ so that in every castle of country $A$, the number of country $A$'s commanders defending that castle is not less than the number of country $B$'s commanders attacking that castle. (Each commander can defend or attack only one castle at a time.) (2) For any arbitrary set $X$ of castles in country $A$, the number of country $A$'s castles that are in $X$ or adjacent to at least one of the castle in $X$ is not less than the number of country $B$'s castles that are adjacent to at least one of the castles in $X$.

Two distinct positive factors of $144$ are selected at random. What is the probability that their product is greater than $144$?

Let $n$ be a positive integer and $p$ a fixed prime. We have a deck of $n$ cards, numbered $1,\ 2,\ldots,\ n$ and $p$ boxes for put the cards on them. Determine all posible integers $n$ for which is possible to distribute the cards in the boxes in such a way the sum of the numbers of the cards in each box is the same.

Equilateral triangle $ABC$ has side length $6$. Circles with centers at $A$, $B$, and $C$ are drawn such that their respective radii $r_A$, $r_B$, and $r_C$ form an arithmetic sequence with $r_A<r_B<r_C$. If the shortest distance between circles $A$ and $B$ is $3.5$, and the shortest distance between circles $A$ and $C$ is $3$, then what is the area of the shaded region? Express your answer in terms of pi. [asy] size(8cm); draw((0,0)--(6,0)--6*dir(60)--cycle); draw(circle((0,0),1)); draw(circle(6*dir(60),1.5)); draw(circle((6,0),2)); filldraw((0,0)--arc((0,0),1,0,60)--cycle, grey); filldraw(6*dir(60)--arc(6*dir(60),1.5,240,300)--cycle, grey); filldraw((6,0)--arc((6,0),2,120,180)--cycle, grey); label("$A$",(0,0),SW); label("$B$",6*dir(60),N); label("$C$",(6,0),SE); [/asy]

Let $x, y, z$ be positive reals such that $xyz = 1$. Prove that $$\sum_{cyc} \frac{1}{\sqrt{x+2y+6}}\leq\sum_{cyc} \frac{x}{\sqrt{x^2+4\sqrt{y}+4\sqrt{z}}}.$$

The trapezoid ABCD has bases with lengths 7 and 17 and area 120. Find the difference of the areas of $\triangle$ACD and $\triangle$CDB. [asy] pair A, B, C, D; A = (0, 0); B = (17, 0); C = (1, 10); D = (10, 10); draw(A--B--D--C--cycle); label("$A$", A, W); label("$B$", B, E); label("$C$", C, W); label("$D$", D, E); draw(B--C); draw(A--D); [/asy]

Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

Suppose $P$ is an interior point of a triangle $ABC$ such that the ratios \[ \frac{d(A,BC)}{d(P,BC)} , \frac{d(B,CA)}{d(P,CA)} , \frac{d(C,AB)}{d(P,AB)} \] are all equal. Find the common value of these ratios. $d(X,YZ)$ represents the perpendicular distance fro $X$ to the line $YZ$.

Define $\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the number of integers $2 \le n \le 50$ such that $n$ divides $\phi^{!}(n)+1$.

An integer is square-free if it is not divisible by $a^2$ for any integer $a>1$. Let $S$ be the set of positive square-free integers. Determine, with justification, the value of\[\sum_{k\epsilon S}\left[\sqrt{\frac{10^{10}}{k}}\right]\]where $[x]$ denote the greatest integer less than or equal to $x$

On circle there are $2009$ positive integers which sum is $7036$. Show that it is possible to find two pairs of neighboring numbers such that sum of both pairs is greater or equal to $8$

We match sets $ M$ of points in the coordinate plane to sets $ M*$ according to the rule that $ (x*,y*) \in M*$ if and only if $ x \cdot x* \plus{} y \cdot y* \leq 1$ whenever $ (x,y) \in M.$ Find all triangles $ Q$ such that $ Q*$ is the reflection of $ Q$ in the origin.

Let $n>2$ be a positive integer and $b=2^{2^n}$. Let $a$ be an odd positive integer such that $a\le b \le 2a$. Show that $a^2+b^2-ab$ is not a square.

Into how many regions do $n$ circles divide the plane, if each pair of circles intersects in two points and no point lies on three circles?