We have $n$ points in the plane, no three on a line. We call $k$ of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed $k$ the number of $k$ good points is $c_k$. Show that the following sum is independent of the structure of points and only depends on $n$ : \[ \sum_{i=3}^n (-1)^i c_i \]

The set $S$ contains nine numbers. The mean of the numbers in $S$ is $202.$ The mean of the five smallest of the numbers in $S$ is $100.$ The mean of the five largest numbers in $S$ is $300.$ What is the median of the numbers in $S?$

Given a triangle $ABC$, the points $D$, $E$, and $F$ lie on the sides $BC$, $CA$, and $AB$, respectively, are such that $$DC + CE = EA + AF = FB + BD.$$ Prove that $$DE + EF + FD \ge \frac12 (AB + BC + CA).$$

Let $ABCD$ be a rectangle inscribed in circle $\omega$ with center $O$. Line $l$ passes trough $O$ and intersects lines $BC$ and $AD$ at points $E$ and $F$ respectively. Points $K$ and $L$ are the intersection points of $l$ and $\omega$ and points $K, E, F, L$ lie in this order on the line $l$. Lines tangent to $w$ in $K$ and $L$ intersect $CD$ at $M$ and $N$ respectively. Prove that $E, F, M, N$ lie on a common circle.

Let $\mathcal{F}$ be the set of functions $f:\mathbb{R}\to\mathbb{R}$ such that $f(2x)=f(x)$ for all $x\in\mathbb{R}.$ [list=a] [*]Determine all functions $f\in\mathcal{F}$ which admit antiderivatives on $\mathbb{R}.$ [*]Give an example of a non-constant function $f\in\mathcal{F}$ which is integrable on any interval $[a,b]\subset\mathbb{R}$ and satisfies \[\int_a^bf(x) \ dx=0\]for all real numbers $a$ and $b.$ [/list][i]Mihai Piticari and Sorin Rădulescu[/i]

Prove that the sum of the lengths of the polyhedron edges exceeds its tripled diameter (distance between two farest vertices).

Octagon $A_1A_2A_3A_4A_5A_6A_7A_8$ is inscribed in a circle where $A_1A_2=A_2A_3=A_3A_4=A_6A_7=13$ and $A_4A_5=A_5A_6=A_7A_8=A_8A_1=5. $ The sum of all possible areas of $A_1A_2A_3A_4A_5A_6A_7A_8$ can be expressed as $a+b\sqrt{c}$ where $\gcd{a,b}=1$ and $c$ is squarefree. Find $abc.$ [asy] label("$A_1$",(5,0),E); label("$A_2$",(2.92, -4.05),SE); label("$A_3$",(-2.92,-4.05),SW); label("$A_4$",(-5,0),W); label("$A_5$",(-4.5,2.179),NW); label("$A_6$",(-3,4), NW); label("$A_7$",(3,4), NE); label("$A_8$",(4.5,2.179),NE); draw((5,0)--(2.9289,-4.05235)); draw((2.92898,-4.05325)--(-2.92,-4.05)); draw((-2.92,-4.05)--(-5,0)); draw((-5,0)--(-4.5, 2.179)); draw((-4.5, 2.179)--(-3,4)); draw((-3,4)--(3,4)); draw((3,4)--(4.5,2.179)); draw((4.5,2.179)--(5,0)); dot((0,0)); draw(circle((0,0),5)); [/asy]

In rectangle $ ABCD$, points $ F$ and $ G$ lie on $ \overline{AB}$ so that $ AF \equal{} FG \equal{} GB$ and $ E$ is the midpoint of $ \overline{DC}$. Also, $ \overline{AC}$ intersects $ \overline{EF}$ at $ H$ and $ \overline{EG}$ at $ J$. The area of the rectangle $ ABCD$ is $ 70$. Find the area of triangle $ EHJ$. [asy] size(180); pair A, B, C, D, E, F, G, H, J; A = origin; real length = 6; real width = 3.5; B = length*dir(0); C = (length, width); D = width*dir(90); F = length/3*dir(0); G = 2*length/3*dir(0); E = (length/2, width); H = extension(A, C, E, F); J = extension(A, C, E, G); draw(A--B--C--D--cycle); draw(G--E--F); draw(A--C); label("$A$", A, dir(180)); label("$D$", D, dir(180)); label("$B$", B, dir(0)); label("$C$", C, dir(0)); label("$F$", F, dir(270)); label("$E$", E, dir(90)); label("$G$", G, dir(270)); label("$H$", H, dir(140)); label("$J$", J, dir(340)); [/asy] $ \displaystyle \textbf{(A)} \ \frac {5}{2} \qquad \textbf{(B)} \ \frac {35}{12} \qquad \textbf{(C)} \ 3 \qquad \textbf{(D)} \ \frac {7}{2} \qquad \textbf{(E)} \ \frac {35}{8}$

Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

In the following, the point of intersection of two lines $ g$ and $ h$ will be abbreviated as $ g\cap h$. Suppose $ ABC$ is a triangle in which $ \angle A \equal{} 90^{\circ}$ and $ \angle B > \angle C$. Let $ O$ be the circumcircle of the triangle $ ABC$. Let $ l_{A}$ and $ l_{B}$ be the tangents to the circle $ O$ at $ A$ and $ B$, respectively. Let $ BC \cap l_{A} \equal{} S$ and $ AC \cap l_{B} \equal{} D$. Furthermore, let $ AB \cap DS \equal{} E$, and let $ CE \cap l_{A} \equal{} T$. Denote by $ P$ the foot of the perpendicular from $ E$ on $ l_{A}$. Denote by $ Q$ the point of intersection of the line $ CP$ with the circle $ O$ (different from $ C$). Denote by $ R$ be the point of intersection of the line $ QT$ with the circle $ O$ (different from $ Q$). Finally, define $ U \equal{} BR \cap l_{A}$. Prove that \[ \frac {SU \cdot SP}{TU \cdot TP} \equal{} \frac {SA^{2}}{TA^{2}}. \]

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 square of side 1 is decomposed into 9 equal squares of sides 1/3 and the one in the center is painted in black. The remaining eight squares are analogously divided into nine squares each and the square in the center is painted in black. Prove that after 1000 steps the total area of black region exceeds 0.999[/b]

Represent the hypotenuse of a right triangle by $ c$ and the area by $ A$. The atltidue on the hypotenuse is: $ \textbf{(A)}\ \frac{A}{c} \qquad \textbf{(B)}\ \frac{2A}{c} \qquad \textbf{(C)}\ \frac{A}{2c} \qquad \textbf{(D)}\ \frac{A^2}{c} \qquad \textbf{(E)}\ \frac{A}{c^2}$

[u]Round 1[/u] [b]p1.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p2.[/b] A positive number is placed on each of the $10$ circles in this picture. It turns out that for each of the nine little equilateral triangles, the number on one of its corners is the sum of the numbers on the other two corners. Is it possible that all $10$ numbers are different? [img]https://cdn.artofproblemsolving.com/attachments/b/f/c501362211d1c2a577e718d2b1ed1f1eb77af1.png[/img] [b]p3.[/b] Pablo and Nina take turns entering integers into the cells of a $3 \times 3$ table. Pablo goes first. The person who fills the last empty cell in a row must make the numbers in that row add to $0$. Can Nina ensure at least two of the columns have a negative sum, no matter what Pablo does? [b]p4. [/b]All possible simplified fractions greater than $0$ and less than $1$ with denominators less than or equal to $100$ are written in a row with a space before each number (including the first). Zeke and Qing play a game, taking turns choosing a blank space and writing a “$+$” or “$-$” sign in it. Zeke goes first. After all the spaces have been filled, Zeke wins if the value of the resulting expression is an integer. Can Zeke win no matter what Qing does? [img]https://cdn.artofproblemsolving.com/attachments/3/6/15484835686fbc2aa092e8afc6f11cd1d1fb88.png[/img] [b]p5.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/0/c/d827cf26c8eaabfd5b0deb92612a6e6ebffb47.png[/img] [u]Round 2[/u] [b]p6.[/b] Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$. [b]p7.[/b] Given a list of three numbers, a zap consists of picking two of the numbers and decreasing each of them by their average. For example, if the list is $(5, 7, 10)$ and you zap $5$ and $10$, whose average is $7.5$, the new list is $(-2.5, 7, 2.5)$. Is it possible to start with the list $(3, 1, 4)$ and, through some sequence of zaps, end with a list in which the sum of the three numbers is $0$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Ana and Carlos entertain themselves with the next game. At the beginning of game in each vertex of the square there is an empty box. In each step, the corresponding player has two possibilities: either he adds a stone to an arbitrary box, or move each box clockwise to the next vertex of the square. Carlos starts and they take 2012 steps in turn (each player 1006). So Carlos marks one of the vertices of the square and allows Ana to make a more play. Carlos wins if after this last step the number ofstones in some box is greater than the number of stones in the box which is at the vertex marked by Carlos; otherwise Ana wins. Which of the two players has a winning strategy?