Show that for any vectors $a, b$ in Euclidean space, \[|a \times b|^3 \leq \frac{3 \sqrt 3}{8} |a|^2 |b|^2 |a-b|^2\] Remark. Here $\times$ denotes the vector product.

In triangle $ABC$, side $BC$ is equal to $a$, and the angles of the triangle adjacent to it are equal to $\alpha$ and $\beta$. A circle passing through points $A $and $B$ intersects lines $CA$ and $CB$ for second time at points $ P$ and $M$. It is known that straight line $RM$ passes through the center of the circle circumscribed around $ABC$. Find the length of the segment $PM$

In a cyclic quadrilateral $ABCD$, let the diagonals $AC$ and $BD$ intersect at $X$. Let the circumcircles of triangles $AXD$ and $BXC$ intersect again at $Y$ . If $X$ is the incentre of triangle $ABY$ , show that $\angle CAD = 90^o$.

For odd positive integers $n$, define $f(n)$ to be the smallest odd integer greater than $n$ that is not relatively prime to $n$. Compute the smallest $n$ such that $f(f(n))$ is not divisible by $3$.

Let $X=(x_1,x_2,......,x_9)$ be a permutation of the set $\{1,2,\ldots,9\}$ and let $A$ be the set of all such $X$ . For any $X \in A$, denote $f(X)=x_1+2x_2+\cdots+9x_9$ and $ M=\{f(X)|X \in A \}$. Find $|M|$. ($|S|$ denotes number of members of the set $S$.)

Prove that if $n$ is a positive integer then $2 (n^2 + 1) - n$ is not a square of an integer.

Compute the sum of all positive integers $n$ such that $n^n$ has 325 positive integer divisors. (For example, $4^4=256$ has 9 positive integer divisors: 1, 2, 4, 8, 16, 32, 64, 128, 256.)

Parallel lines $\ell_1$ and $\ell_2$ are drawn in a plane. Points $A_1, A_2, \dots, A_n$ are chosen on $\ell_1$, and points $B_1, B_2, \dots, B_{n+1}$ are chosen on $\ell_2$. All segments $A_iB_j$ are drawn, such that $1 \le i \le n$ and $1 \le j \le n+1$. Let the number of total intersections between these segments (not including endpoints) be denoted by $Q$. Given that no three segments are concurrent, besides at endpoints, prove that $Q$ is divisible by 3. [i]Proposed by Lewis Chen[/i]

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 $

The road that goes from the town to the mountain cottage is $76$ km long. A group of hikers finished it in $10$ days, never travelling more than $16$ km in two consecutive days, but travelling at least $23$ km in three consecutive days. Find the maximum ammount of kilometers that the hikers may have traveled in one day.

Points $A,B,C$ are on a plane such that $AB=BC=CA=6$. At any step, you may choose any three existing points and draw that triangle's circumcentre. Prove that you can draw a point such that its distance from an previously drawn point is: $(a)$ greater than 7 $(b)$ greater than 2019

Let $ ABCDE$ be a convex pentagon such that \[ \angle BAC \equal{} \angle CAD \equal{} \angle DAE\qquad \text{and}\qquad \angle ABC \equal{} \angle ACD \equal{} \angle ADE. \]The diagonals $BD$ and $CE$ meet at $P$. Prove that the line $AP$ bisects the side $CD$. [i]Proposed by Zuming Feng, USA[/i]

A cockroach is crawling along the walls inside a cubical room that has an edge length of $\text{3 m}$. If the cockroach starts from the back lower left hand corner of the cube and finishes at the front upper right hand corner, what is the magnitude of the displacement of the cockroach? (a) $\text{3}\sqrt{2} \ \text{m}$ (b) $\text{3}\sqrt[3]{2} \ \text{m}$ (c) $\text{3}\sqrt{3} \ \text{m}$ (d) $\text{3 m}$ (e) $\text{9 m}$

Find all triples of positive integers $(x, y, z)$ with $$\frac{xy}{z}+ \frac{yz}{x}+\frac{zx}{y}= 3$$

How many triples of positive integers $(a,b,c)$ are there such that $a!+b^3 = 18+c^3$? $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ 0 $

Alice is planning a trip from the Bay Area to one of $5$ possible destinations (each of which is serviced by only $1$ airport) and wants to book two flights, one to her destination and one returning. There are $3$ airports within the Bay Area from which she may leave and to which she may return. In how many ways may she plan her flight itinerary?

Find the sum of the squares of all solutions to $$(x^2 + 7x + 9)^2 = 9.$$ [i]Lightning 1.1[/i]

Real numbers $w$, $x$, $y$, and $z$ satisfy $w+x+y = 3$, $x+y+z = 4,$ and $w+x+y+z = 5$. What is the value of $x+y$? $\textbf{(A) }-\frac{1}{2}\qquad\textbf{(B) }1\qquad\textbf{(C) }\frac{3}{2}\qquad\textbf{(D) }2\qquad\textbf{(E) }3$

Alice, Bob, and Charlie were on a hike and were wondering how far away the nearest town was. When Alice said, "We are at least 6 miles away," Bob replied, "We are at most 5 miles away." Charlie then remarked, "Actually the nearest town is at most 4 miles away." It turned out that none of the three statements were true. Let $d$ be the distance in miles to the nearest town. Which of the following intervals is the set of all possible values of $d$? $\textbf{(A) } (0,4) \qquad \textbf{(B) } (4,5) \qquad \textbf{(C) } (4,6) \qquad \textbf{(D) } (5,6) \qquad \textbf{(E) } (5,\infty) $

[b]p1.[/b] Suppose that $20\%$ of a number is $17$. Find $20\%$ of $17\%$ of the number. [b]p2.[/b] Let $A, B, C, D$ represent the numbers $1$ through $4$ in some order, with $A \ne 1$. Find the maximum possible value of $\frac{\log_A B}{C +D}$. Here, $\log_A B$ is the unique real number $X$ such that $A^X = B$. [b]p3. [/b]There are six points in a plane, no four of which are collinear. A line is formed connecting every pair of points. Find the smallest possible number of distinct lines formed. [b]p4.[/b] Let $a,b,c$ be real numbers which satisfy $$\frac{2017}{a}= a(b +c), \frac{2017}{b}= b(a +c), \frac{2017}{c}= c(a +b).$$ Find the sum of all possible values of $abc$. [b]p5.[/b] Let $a$ and $b$ be complex numbers such that $ab + a +b = (a +b +1)(a +b +3)$. Find all possible values of $\frac{a+1}{b+1}$. [b]p6.[/b] Let $\vartriangle ABC$ be a triangle. Let $X,Y,Z$ be points on lines $BC$, $CA$, and $AB$, respectively, such that $X$ lies on segment $BC$, $B$ lies on segment $AY$ , and $C$ lies on segment $AZ$. Suppose that the circumcircle of $\vartriangle XYZ$ is tangent to lines $AB$, $BC$, and $CA$ with center $I_A$. If $AB = 20$ and $I_AC = AC = 17$ then compute the length of segment $BC$. [b]p7. [/b]An ant makes $4034$ moves on a coordinate plane, beginning at the point $(0, 0)$ and ending at $(2017, 2017)$. Each move consists of moving one unit in a direction parallel to one of the axes. Suppose that the ant stays within the region $|x - y| \le 2$. Let N be the number of paths the ant can take. Find the remainder when $N$ is divided by $1000$. [b]p8.[/b] A $10$ digit positive integer $\overline{a_9a_8a_7...a_1a_0}$ with $a_9$ nonzero is called [i]deceptive [/i] if there exist distinct indices $i > j$ such that $\overline{a_i a_j} = 37$. Find the number of deceptive positive integers. [b]p9.[/b] A circle passing through the points $(2, 0)$ and $(1, 7)$ is tangent to the $y$-axis at $(0, r )$. Find all possible values of $ r$. [b]p10.[/b] An ellipse with major and minor axes $20$ and $17$, respectively, is inscribed in a square whose diagonals coincide with the axes of the ellipse. Find the area of the square. PS. You had better use hide for answers.

Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

A quadrilateral $ABCD$ is inscribed in a circle $k$ where $AB$ $>$ $CD$,and $AB$ is not paralel to $CD$.Point $M$ is the intersection of diagonals $AC$ and $BD$, and the perpendicular from $M$ to $AB$ intersects the segment $AB$ at a point $E$.If $EM$ bisects the angle $CED$ prove that $AB$ is diameter of $k$. Proposed by Emil Stoyanov,Bulgaria

A sequence of vertices $v_1,v_2,\ldots,v_k$ in a graph, where $v_i=v_j$ only if $i=j$ and $k$ can be any positive integer, is called a $\textit{cycle}$ if $v_1$ is attached by an edge to $v_2$, $v_2$ to $v_3$, and so on to $v_k$ connected to $v_1$. Rotations and reflections are distinct: $A,B,C$ is distinct from $A,C,B$ and $B,C,A$. Supposed a simple graph $G$ has $2013$ vertices and $3013$ edges. What is the minimal number of cycles possible in $G$?

$A_1A_2A_3A_4$ is a cyclic quadrilateral inscribed in circle $\Omega$, with side lengths $A_1A_2 = 28$, $A_2A_3 =12\sqrt3$, $A_3A_4 = 28\sqrt3$, and $A_4A_1 = 8$. Let $X$ be the intersection of $A_1A_3, A_2A_4$. Now, for $i = 1, 2, 3, 4$, let $\omega_i$ be the circle tangent to segments$ A_iX$, $A_{i+1}X$, and $\Omega$, where we take indices cyclically (mod $4$). Furthermore, for each $i$, say $\omega_i$ is tangent to $A_1A_3$ at $X_i $, $A_2A_4$ at $Y_i$ , and $\Omega$ at $T_i$ . Let $P_1$ be the intersection of $T_1X_1$ and $T_2X_2$, and $P_3$ the intersection of $T_3X_3$ and $T_4X_4$. Let $P_2$ be the intersection of $T_2Y_2$ and $T_3Y_3$, and $P_4$ the intersection of $T_1Y_1$ and $T_4Y_4$. Find the area of quadrilateral $P_1P_2P_3P_4$.

Let $n$ be an integer greater than $1$. Let $x\in\mathbb R$. (a) Evaluate $S(x,n)=\sum(x+p)(x+q)$, where the summation is over all pairs $(p,q)$ of different numbers from $\{1,2,\ldots,n\}$. (b) Do there exist integers $x,n$ for which $S(x,n)=0$?