Your team receives up to $100$ points total for the team round. To play this minigame for up to $10$ bonus points, you must decide how to construct an optimal army with number of soldiers equal to the points you receive. Construct an army of $100$ soldiers with $5$ flanks; thus your army is the union of battalions $B_1$, $B_2$, $B_3$, $B_4$, and $B_5$. You choose the size of each battalion such that $|B_1|+|B_2|+|B_3|+|B_4|+|B_5|=100$. The size of each batallion must be integral and non-negative. Then, suppose you receive $n$ points for the Team Round. We will then "supply" your army as follows: if $n>B_1$, we fill in battalion $1$ so that it has $|B_1|$ soldiers; then repeat for the next battalion with $n-|B_1|$ soldiers. If at some point there are not enough soldiers to fill the battalion, the remainder will be put in that battalion and subsequent battalions will be empty. (Ex: suppose you tell us to form battalions of size $\{20,30,20,20,10\}$, and your team scores $73$ points. Then your battalions will actually be $\{20,30,20,3,0\}$.) Your team's army will then "fight" another's. The $B_i$ of both teams will be compared with the other $B_i$, and the winner of the overall war is the army who wins the majority of the battalion fights. The winner receives $1$ victory point, and in case of ties, both teams receive $\tfrac12$ victory points. Every team's army will fight everyone else's and the team war score will be the sum of the victory points won from wars. The teams with ranking $x$ where $7k\leq x\leq 7(k+1)$ will earn $10-k$ bonus points. For example: Team Princeton decides to allocate its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $20$, $20$, $20$, $20$, $20$. Team MIT allocates its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $10$, $10$, $10$, $10$, $60$. Now suppose Princeton scores $80$ points on the Team Round, and MIT scores $90$ points. Then after supplying, the armies will actually look like $\{20, 20, 20, 20, 0\}$ for Princeton and $\{10, 10, 10, 10, 50\}$ for MIT. Then note that in a war, Princeton beats MIT in the first four battalion battles while MIT only wins the last battalion battle; therefore Princeton wins the war, and Princeton would win $1$ victory point.

Kelvin the Frog was bored in math class one day, so he wrote all ordered triples $(a, b, c)$ of positive integers such that $abc=2310$ on a sheet of paper. Find the sum of all the integers he wrote down. In other words, compute $$\sum_{\stackrel{abc=2310}{a,b,c\in \mathbb{N}}} (a+b+c),$$ where $\mathbb{N}$ denotes the positive integers.

Given a set $S$ of positive real numbers, let $$\Sigma (S) = \Bigg\{ \sum_{x \in A} x : \emptyset \neq A \subset S \Bigg\}.$$ be the set of all the sums of elements of non-empty subsets of $S$. Find the least constant $L> 0$ with the following property: for every integer greater than $1$ and every set $S$ of $n$ positive real numbers, it is possible partition $\Sigma(S)$ into $n$ subsets $\Sigma_1,\ldots, \Sigma_n$ so that the ratio between the largest and smallest element of each $\Sigma_i$ is at most $L$.

Find all positive integers $n$ such that if $S=\{d_1,d_2,\cdots,d_k\}$ is the set of positive integer divisors of $n$, then $S$ is a complete residue system modulo $k$. (In other words, for every pair of distinct indices $i$ and $j$, we have $d_i\not\equiv d_j \pmod{k}$). Proposed by Heidar Shushtari

Let $ ABC $ be a triangle with $ \angle BAC <90^{\circ } . $ In the exterior of $ ABC, $ choose the points $ D,E $ such that $ DA=DB,EA=EC $ and $ \angle ADB =\angle AEC =2\angle BAC . $ Show that the symmetric of $ A $ with respect to the midpoint of the segment $ DE $ is the circumcircle of $ ABC. $

What is the radius of the largest circle centered at $(2, 2)$ that is completely bounded within the parabola $y = x^2 - 4x + 5$?

Let $\mathcal{P}_n$ be the set of all real monic polynomial functions of degree $n$. Prove that for any $a<b$, $$\inf_{P\in\mathcal{P}_n}\int_a^b |P(x)|\, dx >0.$$ [i]Cristi Săvescu[/i]

Dürer explains art history to his students. The following gothic window is examined. Where the center of the arc of $BC$ is $A$, and similarly the center of the arc of $AC$ is $B$. The question is how much is the radius of the circle (radius marked $r$ in the figure).[img]https://cdn.artofproblemsolving.com/attachments/5/c/28e5ee47005bfde7f925908b519099d5e28d91.png[/img]

$(a)$ Prove that in a triangle the sum of the distances from the centroid to the sides is not less than three times the inradius, and find the cases of equality. $(b)$ Determine the points in a triangle that minimize the sum of the distances to the sides.

In an acute-angled triangle $ABC$ on the side $AC$, point $P$ is chosen in such a way that $2AP = BC$. Points $X$ and $Y$ are symmetric to $P$ with respect to vertices $A$ and $C$, respectively. It turned out that $BX = BY$. Find $\angle BCA$.

Let $a$ be a positive integer. We say that a positive integer $b$ is [i]$a$-good[/i] if $\tbinom{an}{b}-1$ is divisible by $an+1$ for all positive integers $n$ with $an \geq b$. Suppose $b$ is a positive integer such that $b$ is $a$-good, but $b+2$ is not $a$-good. Prove that $b+1$ is prime.

Given a triangle $ABC$, let $D$ be the midpoint of the side $AC$ and let $M$ be the point that divides the segment $BD$ in the ratio $1/2$; that is, $MB/MD=1/2$. The rays $AM$ and $CM$ meet the sides $BC$ and $AB$ at points $E$ and $F$, respectively. Assume the two rays perpendicular: $AM\perp CM$. Show that the quadrangle $AFED$ is cyclic if and only if the median from $A$ in triangle $ABC$ meets the line $EF$ at a point situated on the circle $ABC$.

Let $f : [a, b] \rightarrow [a, b]$ be a continuous function and let $p \in [a, b]$. Define $p_0 = p$ and $p_{n+1} = f(p_n)$ for $n = 0, 1, 2,...$. Suppose that the set $T_p = \{p_n : n = 0, 1, 2,...\}$ is closed, i.e., if $x \not\in T_p$ then $\exists \delta > 0$ such that for all $x' \in T_p$ we have $|x'-x|\ge\delta$. Show that $T_p$ has finitely many elements.

Consider n real numbers $x_0, x_1, . . . , x_{n-1}$ for an integer $n \ge 2$. Moreover, suppose that for any integer $i$, $x_{i+n} = x_i$ . Prove that $$\sum^{n-1}_{i=0} x_i(3x_i - 4x_{i+1} + x_{i+2}) \ge 0.$$

There are some segments on the plane such that no two of them intersect each other (even at the ending points). We say segment $AB$ [b]breaks[/b] segment $CD$ if the extension of $AB$ cuts $CD$ at some point between $C$ and $D$. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(4cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -5.267474904743955, xmax = 11.572179069738377, ymin = -10.642621257034536, ymax = 4.543526642434019; /* image dimensions */ /* draw figures */ draw((-4,-2)--(1.08,-2.03), linewidth(2)); draw(shift((-2.1866176795507295,-2.0107089507113147))*scale(0.21166666666666667)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((-0.16981767035094117,3.225314210196242)--(-2.1866176795507295,-2.0107089507113147), linewidth(2) + linetype("4 4")); draw((-0.16981767035094117,3.225314210196242)--(-0.8194002739586808,1.538865607509914), linewidth(2)); label("$A$",(-1.2684397405642523,3.860690076971137),SE*labelscalefactor,fontsize(16)); label("$B$",(-1.9211395070170559,2.002590777612728),SE*labelscalefactor,fontsize(16)); label("$C$",(-4.971261820527631,-1.6571211388676117),SE*labelscalefactor,fontsize(16)); label("$D$",(1.08925640451367566,-1.6571211388676117),SE*labelscalefactor,fontsize(16)); /* dots and labels */ dot((-4,-2),dotstyle); dot((1.08,-2.03),dotstyle); dot((-0.16981767035094117,3.225314210196242),dotstyle); dot((-0.8194002739586808,1.538865607509914),dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] $a)$ Is it possible that each segment when extended from both ends, breaks exactly one other segment from each way? [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(4cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -6.8, xmax = 8.68, ymin = -10.32, ymax = 3.64; /* image dimensions */ /* draw figures */ draw((-2.56,1.24)--(-0.36,1.4), linewidth(2)); draw((-3.32,-2.68)--(-1.24,-3.08), linewidth(2)); draw(shift((-2.551651190956802,-2.8277593863544612))*scale(0.17638888888888887)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw(shift((-0.8889576602618603,1.3615303519809556))*scale(0.17638888888888887)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((-2.551651190956802,-2.8277593863544612)--(-0.8889576602618603,1.3615303519809556), linewidth(2) + linetype("4 4")); draw((-1.4097008194020806,0.049476186483185636)--(-1.8514772275312024,-1.0636149148218605), linewidth(2)); /* dots and labels */ dot((-2.56,1.24),dotstyle); dot((-0.36,1.4),dotstyle); dot((-3.32,-2.68),dotstyle); dot((-1.24,-3.08),dotstyle); dot((-1.4097008194020806,0.049476186483185636),dotstyle); dot((-1.8514772275312024,-1.0636149148218605),dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] $b)$ A segment is called [b]surrounded[/b] if from both sides of it, there is exactly one segment that breaks it.\\ ([i]e.g.[/i] segment $AB$ in the figure.) Is it possible to have all segments to be surrounded? [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(7cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -10.70976151557872, xmax = 18.64292748469251, ymin = -16.354300717041443, ymax = 9.136192362141452; /* image dimensions */ /* draw figures */ draw((1.0313140845297686,0.748205038977829)--(-1.3,-4), linewidth(2.8)); draw((-5.780195085389632,-2.13088646583346)--(-2.549994860479401,-2.13088646583346), linewidth(2.8)); draw((4.121070821400425,-3.816208322308361)--(1.78,-1.88), linewidth(2.8)); draw(shift((-0.38228674372374466,-2.13088646583346))*scale(0.21166666666666667)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((-2.549994860479401,-2.13088646583346)--(-0.38228674372374466,-2.13088646583346), linewidth(2.8) + linetype("4 4")); draw(shift((0.32979226045261084,-0.6805897691262632))*scale(0.21166666666666667)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((4.121070821400425,-3.816208322308361)--(0.32979226045261084,-0.6805897691262632), linewidth(2.8) + linetype("4 4")); draw((-3.6313140845297687,-8.74820503897783)--(3.600422205681574,5.980726991931396), linewidth(2.8) + linetype("2 2")); label("$A$",(-0.397698406272906,1.754593418658662),SE*labelscalefactor,fontsize(16)); label("$B$",(-2.6377720405041316,-3.266261278756151),SE*labelscalefactor,fontsize(16)); /* dots and labels */ dot((1.0313140845297686,0.748205038977829),linewidth(6pt) + dotstyle); dot((-1.3,-4),linewidth(6pt) + dotstyle); dot((-5.780195085389632,-2.13088646583346),linewidth(6pt) + dotstyle); dot((-2.549994860479401,-2.13088646583346),linewidth(6pt) + dotstyle); dot((4.121070821400425,-3.816208322308361),linewidth(6pt) + dotstyle); dot((1.78,-1.88),linewidth(6pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Morteza Saghafian[/i]

The value of which property decreases with an increase in the strength of intermolecular forces? $ \textbf{(A)}\hspace{.05in}\text{viscosity}\qquad\textbf{(B)}\hspace{.05in}\text{boiling point}\qquad\textbf{(C)}\hspace{.05in}\text{surface tension}\qquad\textbf{(D)}\hspace{.05in}\text{vapor pressure}\qquad $