A convex polygon of $n$ sides is considered. All its diagonals are drawn and we suppose that any three of them can only intersect on a vertex and that there is no pair of parallel diagonals. Under these conditions, we wish to compute a) The total number of intersection points of these diagonals, excluding the vertices. b) How many points, of these intersections, lie inside the polygon and how many lie outside.

Find the maximal value of \[S = \sqrt[3]{\frac{a}{b+7}} + \sqrt[3]{\frac{b}{c+7}} + \sqrt[3]{\frac{c}{d+7}} + \sqrt[3]{\frac{d}{a+7}},\] where $a$, $b$, $c$, $d$ are nonnegative real numbers which satisfy $a+b+c+d = 100$. [i]Proposed by Evan Chen, Taiwan[/i]

Compute the probability that a random permutation of the letters in BERKELEY does not have the three E’s all on the same side of the Y.

Let $p=2017$ be a prime. Find the remainder when \[\left\lfloor\dfrac{1^p}p\right\rfloor + \left\lfloor\dfrac{2^p}p\right\rfloor+\left\lfloor\dfrac{3^p}p\right\rfloor+\cdots+\left\lfloor\dfrac{2015^p}p\right\rfloor \] is divided by $p$. Here $\lfloor\cdot\rfloor$ denotes the greatest integer function. [i]Proposed by David Altizio[/i]

A staircase-brick with 3 steps of width 2 is made of 12 unit cubes. Determine all integers $ n$ for which it is possible to build a cube of side $ n$ using such bricks.

There are $101$ positive integers $a_1, a_2, \ldots, a_{101}$ such that for every index $i$, with $1 \leqslant i \leqslant 101$, $a_i+1$ is a multiple of $a_{i+1}$. Determine the greatest possible value of the largest of the $101$ numbers.

Let the line $L$ be perpendicular to the plane $P$. Three spheres touch each other in pairs so that each sphere touches the plane $P$ and the line $L$. The radius of the larger sphere is $1$. Find the minimum radius of the smallest sphere.

Fix a point $A$, a circle $\Omega$ centered at $O$, and reals $r$ and $\theta$. Let $X$ and $Y$ be variable points on $\Omega$ so that $\measuredangle XOY = \theta$. The tangents to $\Omega$ at $X$ and $Y$ meet at $T$, and a dilation at $T$ with scale factor $r$ sends $A$ to $A'$. Let $P$ be the foot from $A'$ to $TX$. $ $ $ $ $ $ $ $ $ $ Suppose that some point $P^*$ is the same for two different $X$. Show that $\measuredangle TXY = \measuredangle AP^\ast O$. (All angles are directed.) Proposed by [i]Karn Chutinan[/i]

A warehouse contains $175$ boots of size $8$, $175$ boots of size $9$ and $200$ boots of size $10$. Of these $550$ boots, $250$ are for the left foot and $300$ for the right foot. Let $n$ denote the total number of usable pairs of boots in the warehouse. (A usable pair consists of a left and a right boot of the same size.) (a) Is $n=50$ possible? (b) Is $n=51$ possible?

Let $ x,y,z$ be real numbers greater than or equal to $ 1.$ Prove that \[ \prod(x^{2} \minus{} 2x \plus{} 2)\le (xyz)^{2} \minus{} 2xyz \plus{} 2.\]

Let $(G, \cdot )$ be a group and $e$ an identity element. Prove that if all elements $x$ of $G$ satisfy $x\cdot x = e$ then $(G, \cdot)$ is abelian (that is, commutative).

Let $(a_1,a_2,\ldots, a_{13})$ be a permutation of $(1, 2, \ldots, 13)$. Ayvak takes this permutation and makes a series of [i]moves[/i], each of which consists of choosing an integer $i$ from $1$ to $12$, inclusive, and swapping the positions of $a_i$ and $a_{i+1}$. Define the [i]weight[/i] of a permutation to be the minimum number of moves Ayvak needs to turn it into $(1, 2, \ldots, 13)$. The arithmetic mean of the weights of all permutations $(a_1, \ldots, a_{13})$ of $(1, 2, \ldots, 13)$ for which $a_5 = 9$ is $\frac{m}{n}$, for coprime positive integers $m$ and $n$. Find $100m+n$. [i]Proposed by Alex Gu[/i]

Does there exist an positive integer $n$, so that for any positive integer $m<1002$, there exists an integer $k$ so that \[\displaystyle \frac{m}{1002} < \frac{k}{n} < \frac {m+1}{1003}\] holds? If $n$ does not exist, prove it; if $n$ exists, determine the minimum value of it. I know this problem was easy, but it still appeared on our TST, and so I posted it here.

Consider an acute scalene triangle $\triangle{ABC}$. The interior bisector of $A$ intersects $BC$ at $E$ and the minor arc of $\overarc {BC}$ in circumcircle of $\triangle{ABC}$ at $M$. Suppose that $D$ is a point on the minor arc of $\overarc {BC}$ such that $ED=EM$. $P$ is a point on the line segment of $AD$ such that $\angle ABP=\angle ACP \not= 0$. $O$ is the circumcenter of $\triangle{ABC}$. Prove that $OP \perp AM$.

Consider the $5$ by $5$ equilateral triangular grid as shown: [img]https://cdn.artofproblemsolving.com/attachments/1/2/cac43ae24fd4464682a7992e62c99af4acaf8f.png[/img] How many equilateral triangles are there with sides along the gridlines?

Prove that the arithmetic sequence $5, 11, 17, 23, 29, \ldots$ contains infinitely many primes.

Find all pairs of positive integers \(a, b\) such that the numbers \(a+1\), \(b+1\), \(2a+1\), \(2b+1\), \(a+3b\), and \(b+3a\) are all prime numbers.

[b]p1[/b]. Points $P_1,P_2,P_3,... ,P_n$ lie on a plane such that $P_aP_b = 1$,$P_cP_d = 2$, and $P_eP_f = 2018$ for not necessarily distinct indices $a,b,c,d,e, f \in \{1, 2,... ,n\}$. Find the minimum possible value of $n$. [b]p2.[/b] Find the coefficient of the $x^2y^4$ term in the expansion of $(3x +2y)^6$. [b]p3.[/b] Find the number of positive integers $n < 1000$ such that $n$ is a multiple of $27$ and the digit sum of $n$ is a multiple of $11$. [b]p4.[/b] How many times do the minute hand and hour hand of a $ 12$-hour analog clock overlap in a $366$-day leap year? [b]p5.[/b] Find the number of ordered triples of integers $(a,b,c)$ such that $(a +b)(b +c)(c + a) = 2018$. [b]p6.[/b] Let $S$ denote the set of the first $2018$ positive integers. Call the score of a subset the sum of its maximal element and its minimal element. Find the sum of score $(x)$ over all subsets $s \in S$ [b]p7.[/b] How many ordered pairs of integers $(a,b)$ exist such that $1 \le a,b \le 20$ and $a^a$ divides $b^b$? [b]p8.[/b] Let $f$ be a function such that for every non-negative integer $p$, $f (p)$ equals the number of ordered pairs of positive integers $(a,n)$ such that $a^n = a^p \cdot n$. Find $\sum^{2018}_{p=0}f (p)$. [b]p9.[/b] A point $P$ is randomly chosen inside a regular octagon $A_1A_2A_3A_4A_5A_6A_7A_8$. What is the probability that the projections of $P$ onto the lines $\overleftrightarrow{A_i A_{i+1}}$ for $i = 1,2,... ,8$ lie on the segments $\overline{A_iA_{i+1}}$ for $i = 1,2,... ,8$ (where indices are taken $mod \,\, 8$)? [b]p10. [/b]A person keeps flipping an unfair coin until it flips $3$ tails in a row. The probability of it landing on heads is $\frac23$ and the probability it lands on tails is $\frac13$ . What is the expected value of the number of the times the coin flips? PS. You had better use hide for answers.

Let $ABC$ be an isosceles triangle with vertex $A$ and $AB> BC$. Let $k$ be the circle with center $A$ passsing through $B$ and $C$. Let $H$ be the second intersection of $k$ with the altitude of the triangle $ABC$ through $B$. Further let $G$ be the second intersection of $k$ with the median through $B$ in triangle $ABC$. Let $X$ be the intersection of the lines $AC$ and $GH$. Show that $C$ is the midpoint of $AX$.

A bug travels from $A$ to $B$ along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there? [asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy] $ \textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400 $

After rationalizing the numerator of $ \frac {\sqrt{3}\minus{}\sqrt{2}}{\sqrt{3}}$, the denominator in simplest form is: $\textbf{(A)}\ \sqrt{3}(\sqrt{3}+\sqrt{2}) \qquad \textbf{(B)}\ \sqrt{3}(\sqrt{3}-\sqrt{2}) \qquad \textbf{(C)}\ 3-\sqrt{3}\sqrt{2} \qquad\\ \textbf{(D)}\ 3+\sqrt6 \qquad \textbf{(E)}\ \text{None of these answers}$

Let $Q=\{0,1\}^n$, and let $A$ be a subset of $Q$ with $2^{n-1}$ elements. Prove that there are at least $2^{n-1}$ pairs $(a,b)\in A\times (Q\setminus A)$ for which sequences $a$ and $b$ differ in only one term.

Let $BM$ be the median of right-angled triangle $ABC (\angle B = 90^{\circ})$. The incircle of triangle $ABM$ touches sides $AB, AM$ in points $A_{1},A_{2}$; points $C_{1}, C_{2}$ are defined similarly. Prove that lines $A_{1}A_{2}$ and $C_{1}C_{2}$ meet on the bisector of angle $ABC$.

Show that if $994$ integers are chosen from $1, 2,\cdots , 1992$ and one of the chosen integers is less than $64$, then there exist two among the chosen integers such that one of them is a factor of the other.

[u]Round 1[/u] [b]p1.[/b] Compute $(1 - 2(3 - 4(5 - 6)))(7 - (8 - 9))$. [b]p2.[/b] How many numbers are in the set $\{20, 21, 22, ..., 88, 89\}$? [b]p3.[/b] Three times the complement of the supplement of an angle is equal to $60$ degrees less than the angle itself. Find the measure of the angle in degrees. [u]Round 2[/u] [b]p4.[/b] A positive number is decreased by $10\%$, then decreased by $20\%$, and finally increased by $30\%$. By what percent has this number changed from the original? Give a positive answer for a percent increase and a negative answer for a percent decrease. [b]p5.[/b] What is the area of the triangle with vertices at $(2, 3)$, $(8, 11)$, and $(13, 3)$? [b]p6.[/b] There are three bins, each containing red, green, and/or blue pens. The first bin has $0$ red, $0$ green, and $3$ blue pens, the second bin has $0$ red, $2$ green, and $4$ blue pens, and the final bin has $1$ red, $5$ green, and $6$ blue pens. What is the probability that if one pen is drawn from each bin at random, one of each color pen will be drawn? [u]Round 3[/u] [b]p7.[/b] If a and b are positive integers and $a^2 - b^2 = 23$, what is the value of $a$? [b]p8.[/b] Find the prime factorization of the greatest common divisor of $2^3\cdot 3^2\cdot 5^5\cdot 7^4$ and $2^4\cdot 3^1\cdot 5^2\cdot 7^6$. [b]p9.[/b] Given that $$a + 2b + 3c = 5$$ $$2a + 3b + c = -2$$ $$3a + b + 2c = 3,$$ find $3a + 3b + 3c$. [u]Round 4[/u] [b]p10.[/b] How many positive integer divisors does $11^{20}$ have? [b]p11.[/b] Let $\alpha$ be the answer to problem $10$. Find the real value of $x$ such that $2^{x-5} = 64^{x/\alpha}$. [b]p12.[/b] Let $\beta$ be the answer to problem $11$. Triangle $LMT$ has a right angle at $M$, $LM = \beta$, and $LT = 4\beta - 3$. If $Z$ is the midpoint of $LT$, what is the length$ MZ$? PS. You should use hide for answers. Rounds 5-8 are [url=https://artofproblemsolving.com/community/c3h3133709p28395558]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134133p28400917]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].