Let $\mathbb{Z}/n\mathbb{Z}$ denote the set of integers considered modulo $n$ (hence $\mathbb{Z}/n\mathbb{Z}$ has $n$ elements). Find all positive integers $n$ for which there exists a bijective function $g: \mathbb{Z}/n\mathbb{Z} \to \mathbb{Z}/n\mathbb{Z}$, such that the 101 functions \[g(x), \quad g(x) + x, \quad g(x) + 2x, \quad \dots, \quad g(x) + 100x\] are all bijections on $\mathbb{Z}/n\mathbb{Z}$. [i]Ashwin Sah and Yang Liu[/i]

Find the largest positive integer $n$ such that the following is true: There exists $n$ distinct positive integers $x_1,~x_2,\dots,x_n$ such that whatever the numbers $a_1,~a_2,\dots,a_n\in\left\{-1,0,1\right\}$ are, not all null, the number $n^3$ do not divide $\sum_{k=1}^n a_kx_k$.

In triangle $ABC$ let $X$ be some fixed point on bisector $AA'$ while point $B'$ be intersection of $BX$ and $AC$ and point $C'$ be intersection of $CX$ and $AB$. Let point $P$ be intersection of segments $A'B'$ and $CC'$ while point $Q$ be intersection of segments $A'C'$ and $BB'$. Prove τhat $\angle PAC = \angle QAB$.

Let $\gamma,\Gamma$ be two concentric circles with radii $r,R$ with $r<R$. Let $ABCD$ be a cyclic quadrilateral inscribed in $\gamma$. If $\overrightarrow{AB}$ denotes the Ray starting from $A$ and extending indefinitely in $B's$ direction then Let $\overrightarrow{AB}, \overrightarrow{BC}, \overrightarrow{CD} , \overrightarrow{DA}$ meet $\Gamma$ at the points $C_1,D_1,A_1,B_1$ respectively. Prove that \[\frac{[A_1B_1C_1D_1]}{[ABCD]} \ge \frac{R^2}{r^2}\] where $[.]$ denotes area.

A cube with side length $ 1$ is sliced by a plane that passes through two diagonally opposite vertices $ A$ and $ C$ and the midpoints $ B$ and $ D$ of two opposite edges not containing $ A$ and $ C$, ac shown. What is the area of quadrilateral $ ABCD$? [asy]import three; size(200); defaultpen(fontsize(8)+linewidth(0.7)); currentprojection=obliqueX; dotfactor=4; draw((0.5,0,0)--(0,0,0)--(0,0,1)--(0,0,0)--(0,1,0),linetype("4 4")); draw((0.5,0,1)--(0,0,1)--(0,1,1)--(0.5,1,1)--(0.5,0,1)--(0.5,0,0)--(0.5,1,0)--(0.5,1,1)); draw((0.5,1,0)--(0,1,0)--(0,1,1)); dot((0.5,0,0)); label("$A$",(0.5,0,0),WSW); dot((0,1,1)); label("$C$",(0,1,1),NE); dot((0.5,1,0.5)); label("$D$",(0.5,1,0.5),ESE); dot((0,0,0.5)); label("$B$",(0,0,0.5),NW);[/asy]$ \textbf{(A)}\ \frac {\sqrt6}{2} \qquad \textbf{(B)}\ \frac {5}{4} \qquad \textbf{(C)}\ \sqrt2 \qquad \textbf{(D)}\ \frac {3}{2} \qquad \textbf{(E)}\ \sqrt3$

Find all integers $n$, $n \ge 1$, such that $n \cdot 2^{n+1}+1$ is a perfect square.

[b]E[/b]milia wishes to create a basic solution with 7% hydroxide (OH) ions. She has three solutions of different bases available: 10% rubidium hydroxide (Rb(OH)), 8% cesium hydroxide (Cs(OH)), and 5% francium hydroxide (Fr(OH)). (The Rb(OH) solution has both 10% Rb ions and 10% OH ions, and similar for the other solutions.) Since francium is highly radioactive, its concentration in the final solution should not exceed 2%. What is the highest possible concentration of rubidium in her solution?

A set of points is $\emph{convex}$ if the points are the vertices of a convex polygon (that is, a non-self-intersecting polygon with all angles less than or equal to $180^\circ$). Let $S$ be the set of points $(x,y)$ such that $x$ and $y$ are integers and $ 1 \le x, y \le 26 $. Find the number of ways to choose a convex subset of $S$ that contains exactly $98$ points.

Let $ a\in\mathbb{R}. $ Prove the following proposition: $$ \left( x,y\in\mathbb{R}\implies x^4+y^4+axy+2\ge 0 \right)\iff |a|\le 4. $$

In a parallelogram $ABCD$, the bisector of $\angle A$ intersects $BC$ at $M$ and the extension of $DC$ at $N$. Let $O$ be the circumcircle of the triangle $MCN$. Prove that $\angle OBC = \angle ODC$

[b]p1.[/b] Anne purchased yesterday at WalMart in Puerto Rico $6$ identical notebooks, $8$ identical pens and $7$ identical erasers. Anne remembers that each eraser costs $73$ cents. She did not buy anything else. Anne told her mother that she spent $12$ dollars and $76$ cents at Walmart. Can she be right? Note that in Puerto Rico there is no sales tax. [b]p2.[/b] Two men ski one after the other first in a flat field and then uphill. In the field the men run with the same velocity $12$ kilometers/hour. Uphill their velocity drops to $8$ kilometers/hour. When both skiers enter the uphill trail segment the distance between them is $300$ meters less than the initial distance in the field. What was the initial distance between skiers? (There are $1000$ meters in 1 kilometer.) [b]p3.[/b] In the equality $** + **** = ****$ all the digits are replaced by $*$. Restore the equality if it is known that any numbers in the equality does not change if we write all its digits in the opposite order. [b]p4.[/b] If a polyleg has even number of legs he always tells truth. If he has an odd number of legs he always lies. Once a green polyleg told a dark-blue polyleg ”- I have $8$ legs. And you have only $6$ legs!” The offended dark-blue polyleg replied ”-It is me who has $8$ legs, and you have only $7$ legs!” A violet polyleg added ”-The dark-blue polyleg indeed has $8$ legs. But I have $9$ legs!” Then a stripped polyleg started: ”-None of you has $8$ legs. Only I have 8 legs!” Which polyleg has exactly $8$ legs? [b]p5.[/b] Cut the figure shown below in two equal pieces. (Both the area and the form of the pieces must be the same.) [img]https://cdn.artofproblemsolving.com/attachments/e/4/778678c1e8748e213ffc94ba71b1f3cc26c028.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a regular tetrahedron $OABC$. Take points $P,\ Q,\ R$ on the sides $OA,\ OB,\ OC$ respectively. Note that $P,\ Q,\ R$ are different from the vertices of the tetrahedron $OABC$. If $\triangle{PQR}$ is an equilateral triangle, then prove that three sides $PQ,\ QR,\ RP$ are pararell to three sides $AB,\ BC,\ CA$ respectively. 30 points

There are $n(n\ge 8)$ airports, some of which have one-way direct routes between them. For any two airports $a$ and $b$, there is at most one one-way direct route from $a$ to $b$ (there may be both one-way direct routes from $a$ to $b$ and from $b$ to $a$). For any set $A$ composed of airports $(1\le | A| \le n-1)$, there are at least $4\cdot \min \{|A|,n-|A| \}$ one-way direct routes from the airport in $A$ to the airport not in $A$. Prove that: For any airport $x$, we can start from $x$ and return to the airport by no more than $\sqrt{2n}$ one-way direct routes.

In an acute triangle $ABC$ the points $D, E$ are the feet of the altitudes through $B, C$ respectively. Let $L$ be the point on segment $BD$ such that $AD=DL$. Similarly, let $K$ be the point on segment $CE$ such that $AE=EK$. Let $M$ be the midpoint of $KL$. The circumcircle of $ABC$ intersect the lines $AL$ and $AK$ for a second time at $T, S$ respectively. Prove that the lines $BS, CT, AM$ are concurrent.

Let $-1 \le x, y \le 1$. Prove the inequality $$2\sqrt{(1- x^2)(1 - y^2) } \le 2(1 - x)(1 - y) + 1 $$

$2$ darts are thrown randomly at a circular board with center $O$, such that each dart has an equal probability of hitting any point on the board. The points at which they land are marked $A$ and $B$. What is the probability that $\angle AOB$ is acute?

Given integer $n\geq 2$ and real numbers $x_1,x_2,\cdots, x_n$ in the interval $[0,1]$. Prove that there exist real numbers $a_0,a_1,\cdots,a_n$ satisfying the following conditions: (1) $a_0+a_n=0$; (2) $|a_i|\leq 1$, for $i=0,1,\cdots,n$; (3) $|a_i-a_{i-1}|=x_i$, for $i=1,2,\cdots,n$.

Ten square cardboards of $3$ centimeters on a side are cut by a line, as indicated in the figure. After the cuts, there are $20$ pieces: $10$ triangles and $10$ trapezoids. Assemble a square that uses all $20$ pieces without overlaps or gaps. [img]https://cdn.artofproblemsolving.com/attachments/7/9/ec2242cca617305b02eef7a5409e6a6b482d66.gif[/img]

Let $ABC$ be a triangle with interior angle bisectors $AA_1, BB_1, CC_1$ and incenter $I$. If $\sigma[IA_1B] + \sigma[IB_1C] + \sigma[IC_1A] = \frac{1}{2}\sigma[ABC]$, where $\sigma[ABC]$ denotes the area of $ABC$, show that $ABC$ is isosceles.

The $[A_0A_5]$ diameter divides a circumference with the $O$ centre onto two hemicircumferences. One of them is divided onto five equal arcs $A_0A_1, A_1A_2, A_2A_3, A_3A_4, A_4A_5$. The $(A_1A_4)$ line crosses $(OA_2)$ and $(OA_3)$ lines in $M$ and $N$ points. Prove that $(|A_2A_3| + |MN|)$ equals to the circumference radius.

For all nonempty finite sets of point $S$ on the plane satisfying: $|S|$ is even and for all partitions of $S$ into two subsets $A,B$ of equal size, there is a reflection that maps $A$ to $B$.

Let $\zeta = \cos \frac {2pi}{13} + i \sin \frac {2pi}{13}$ . Suppose $a > b > c > d$ are positive integers satisfying $$|\zeta^a + \zeta^b + \zeta^c +\zeta^d| =\sqrt3.$$ Compute the smallest possible value of $1000a + 100b + 10c + d$.

In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$. What is $N$? [asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy] $\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$

Let $n$ be a positive integer. Suppose we are given $2^n+1$ distinct sets, each containing finitely many objects. Place each set into one of two categories, the red sets and the blue sets, so that there is at least one set in each category. We define the [i]symmetric difference[/i] of two sets as the set of objects belonging to exactly one of the two sets. Prove that there are at least $2^n$ different sets which can be obtained as the symmetric difference of a red set and a blue set.

Given a positive real number $t$ , determine the sets $A$ of real numbers containing $t$ , for which there exists a set $B$ of real numbers depending on $A$ , $|B| \geq 4$ , such that the elements of the set $AB =\{ ab \mid a\in A , b \in B \}$ form a finite arithmetic progression .