The lines $\ell_1$ and \ell_2 are parallel. The points $A_1,A_2, ...,A_7$ are on $\ell_1$ and the points $B_1,B_2,...,B_8$ are on $\ell_2$. The points are arranged in such a way that the number of internal intersections among the line segments is maximized (example Figure). The [b]greatest number[/b] of intersection points is [img]https://cdn.artofproblemsolving.com/attachments/4/9/92153dce5a48fcba0f5175d67e0750b7980e84.png[/img] A. $580$ B. $585$ C. $588$ D. $590$ E. $593$

For some positive integer $n,$ Elmo writes down the equation \[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\] Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation \[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\] Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$? [i]Srinivas Arun[/i]

For which natural $ n \geq 3 $ numbers from 1 to $ n $ can be arranged by a circle so that each number does not exceed $60$ % of the sum of its two neighbors?

Prove or disprove that if a real sequence $(a_n)$ satisfies $a_{n+1}-a_n\to0$ and $a_{2n}-2a_n\to0$ as $n\to\infty$, then $a_n\to0$.

Let $ \{a_n\}_{n \in \mathbb{N}_0}$ be a sequence defined as follows: $ a_1=0$, $ a_n=a_{[\frac{n}{2}]}+(-1)^{n(n+1)/2}$, where $ [x]$ denotes the floor function. For every $ k \ge 0$, find the number $ n(k)$ of positive integers $ n$ such that $ 2^k \le n < 2^{k+1}$ and $ a_n=0$.

Define $\overline{a}$ of a positive integer $a$ to be the number $a$ with its digits reversed. For example, $\overline{31564} = 46513.$ Find the sum of all positive integers $n \leq 100$ such that $(\overline{n})^2=\overline{n^2}.$ (Note: For a number that ends with a zero, like 450, the reverse would exclude the zero, so $\overline{450}=54$).

We color the numbers $1, 2, 3,....,20$ with two colors white and black in such a way that both colors are used. Find the number of ways, we can perform this coloring if the product of white numbers and the product of black numbers have greatest common divisor equal to $1$.

Let $X$ and $Y$ be the diameter's extremes of a circunference $\Gamma$ and $N$ be the midpoint of one of the arcs $XY$ of $\Gamma$. Let $A$ and $B$ be two points on the segment $XY$. The lines $NA$ and $NB$ cuts $\Gamma$ again in $C$ and $D$, respectively. The tangents to $\Gamma$ at $C$ and at $D$ meets in $P$. Let $M$ the the intersection point between $XY$ and $NP$. Prove that $M$ is the midpoint of the segment $AB$.

Prove that any irreducible fraction $p/q$, where $p$ and $q$ are positive integers and $q$ is odd, is equal to a fraction $\frac{n}{2^k-1}$ for some positive integers $n$ and $k$.

We have a $6 \times 6$ square, partitioned into 36 unit squares. We select some of these unit squares and draw some of their diagonals, subject to the condition that no two diagonals we draw have any common points. What is the maximal number of diagonals that we can draw?

Call an $n$-digit integer with distinct digits [i]mountainous [/i]if, for some integer $1 \le k \le n$, the first $k$ digits are in strictly ascending order and the following $n - k$ digits are in strictly descending order. How many $5$-digit mountainous integers with distinct digits are there?

Let $n \geq 1$ be an integer. Ruben takes a test with $n$ questions. Each question on this test is worth a different number of points. The first question is worth $1$ point, the second question $2$, the third $3$ and so on until the last question which is worth $n$ points. Each question can be answered either correctly or incorrectly. So an answer for a question can either be awarded all, or none of the points the question is worth. Let $f(n)$ be the number of ways he can take the test so that the number of points awarded equals the number of questions he answered incorrectly. Do there exist infinitely many pairs $(a; b)$ with $a < b$ and $f(a) = f(b)$?

Prove that any rigid flat triangle $T$ of area less than $4$ can be inserted through a triangular hole $Q$ with area $3$.

Using a table of a certain height, two identical blocks of wood are placed as shown in Figure 1. Length $r$ is found to be $32$ inches. After rearranging the blocks as in Figure 2, length $s$ is found to be $28$ inches. How high is the table? [asy] size(300); defaultpen(linewidth(0.8)+fontsize(13pt)); path table = origin--(1,0)--(1,6)--(6,6)--(6,0)--(7,0)--(7,7)--(0,7)--cycle; path block = origin--(3,0)--(3,1.5)--(0,1.5)--cycle; path rotblock = origin--(1.5,0)--(1.5,3)--(0,3)--cycle; draw(table^^shift((14,0))*table); filldraw(shift((7,0))*block^^shift((5.5,7))*rotblock^^shift((21,0))*rotblock^^shift((18,7))*block,gray); draw((7.25,1.75)--(8.5,3.5)--(8.5,8)--(7.25,9.75),Arrows(size=5)); draw((21.25,3.25)--(22,3.5)--(22,8)--(21.25,8.25),Arrows(size=5)); unfill((8,5)--(8,6.5)--(9,6.5)--(9,5)--cycle); unfill((21.5,5)--(21.5,6.5)--(23,6.5)--(23,5)--cycle); label("$r$",(8.5,5.75)); label("$s$",(22,5.75)); [/asy] $\textbf{(A) }28\text{ inches}\qquad\textbf{(B) }29\text{ inches}\qquad\textbf{(C) }30\text{ inches}\qquad\textbf{(D) }31\text{ inches}\qquad\textbf{(E) }32\text{ inches}$

The point $M$ moves such that the sum of squares of the lengths from $M$ to faces of a cube, is fixed. Find the locus of $M.$

A bee travels in a series of steps of length $1$: north, west, north, west, up, south, east, south, east, down. (The bee can move in three dimensions, so north is distinct from up.) There exists a plane $P$ that passes through the midpoints of each step. Suppose we orthogonally project the bee’s path onto the plane $P$, and let $A$ be the area of the resulting figure. What is $A^2$?

Alice and Bob are each secretly given a real number between 0 and 1 uniformly at random. Alice states, “My number is probably greater than yours.” Bob repudiates, saying, “No, my number is probably greater than yours!” Alice concedes, muttering, “Fine, your number is probably greater than mine.” If Bob and Alice are perfectly reasonable and logical, what is the probability that Bob’s number is actually greater than Alice’s?

Let $ABCD$ be a parallelogram and a circle $k$ passes through $A, C$ and meets rays $AB, AD$ at $E, F$. If $BD, EF$ and the tangent at $C$ concur, show that $AC$ is diameter of $k$.

Let $ABC$ be a right triangle with leg $CB = 2$ and hypotenuse $AB= 4$. Point $K$ is chosen on the hypotenuse $AB$, and point $L$ is chosen on the leg $AC$. a) Describe and justify how to construct such points $K$ and $ L$ so that the sum of the distances $CK+KL$ is the smallest possible. b) Find the smallest possible value of $CK+KL$. (Olexii Panasenko)

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

In the country of Drilandia, which has at least three cities, there are bidirectional roads connecting some pairs of cities such that any city can be reached from any other. Two cities are called [i]close[/i] if one can reach the other by using at most two intermediary cities. The mayor, Drilago, fortified the road system by building a direct road between each pair of close cities that were not already connected. Prove that after the expansion, there exists a journey that starts and ends at the same city, where each city except the first is visited exactly once, and the first city is visited twice (once at the beginning and once at the end).

Let $P$ be a point inside a tetrahedron $ABCD$ and let $S_A,S_B,S_C,S_D$ be the centroids (i.e. centers of gravity) of the tetrahedra $PBCD,PCDA,PDAB,PABC$. Show that the volume of the tetrahedron $S_AS_BS_CS_D$ equals $1/64$ the volume of $ABCD$.

It is known that there is a straight line dividing the perimeter and area of a certain polygon circumscribed around a circle in the same ratio. Prove that this line passes through the center of the indicated circle.

Find all pairs of positive integers $(n, k)$ such that all sufficiently large odd positive integers $m$ are representable as $$m=a_1^{n^2}+a_2^{(n+1)^2}+\ldots+a_k^{(n+k-1)^2}+a_{k+1}^{(n+k)^2}$$ for some non-negative integers $a_1, a_2, \ldots, a_{k+1}$.

Let $ABC$ be an acute triangle with circumcircle $\Omega$. Let $B_0$ be the midpoint of $AC$ and let $C_0$ be the midpoint of $AB$. Let $D$ be the foot of the altitude from $A$ and let $G$ be the centroid of the triangle $ABC$. Let $\omega$ be a circle through $B_0$ and $C_0$ that is tangent to the circle $\Omega$ at a point $X\not= A$. Prove that the points $D,G$ and $X$ are collinear. [i]Proposed by Ismail Isaev and Mikhail Isaev, Russia[/i]