We choose $n > 3$ points on a circle and number them $1$ to $ n$ in some order. We say that two non-adjacent points $A$ and $B$ are related if, in one of the arcs $AB$, all the points are marked with numbers less than those at $A,B$. Show that the number of pairs of related points is exactly $n-3$.

Let $f:\mathbb{R}_{+}^{*}$$\rightarrow$$\mathbb{R}_{+}^{*}$ such that $f'''(x)>0$ for all $x$ $\in$ $\mathbb{R}_{+}^{*}$. Prove that: $f(a^{2}+b^{2}+c^{2})+2f(ab+bc+ac)$ $\geq$ $f(a^{2}+2bc)+f(b^{2}+2ca)+f(c^{2}+2ab)$, for all $a,b,c$ $\in$ $\mathbb{R}_{+}^{*}$.

Let $a_1,a_2,a_3,\cdots $ be an infinite sequence of distinct integers. Prove that there are infinitely many primes $p$ that distinct positive integers $i,j,k$ can be found such that $p\mid a_ia_ja_k-1$. [i]Proposed by Mohsen Jamali[/i]

There are 24 different complex numbers $z$ such that $z^{24} = 1$. For how many of these is $z^6$ a real number? $\textbf{(A) }1\qquad\textbf{(B) }3\qquad\textbf{(C) }6\qquad\textbf{(D) }12\qquad\textbf{(E) }24$

Let $O$ be the circumcentre, and $\Omega$ be the circumcircle of an acute-angled triangle $ABC$. Let $P$ be an arbitrary point on $\Omega$, distinct from $A$, $B$, $C$, and their antipodes in $\Omega$. Denote the circumcentres of the triangles $AOP$, $BOP$, and $COP$ by $O_A$, $O_B$, and $O_C$, respectively. The lines $\ell_A$, $\ell_B$, $\ell_C$ perpendicular to $BC$, $CA$, and $AB$ pass through $O_A$, $O_B$, and $O_C$, respectively. Prove that the circumcircle of triangle formed by $\ell_A$, $\ell_B$, and $\ell_C$ is tangent to the line $OP$.

Let $A$ be a set with $1000$ members and $\mathcal F =${$A_1,A_2,\ldots,A_n$} a family of subsets of A such that (a) Each element in $\mathcal F$ consists of 3 members (b) For every five elements in $\mathcal F$, the union of them all will have at least $12$ members Find the largest value of $n$

Let $ n$ be a natural number equal or greater than 3 . A sequence of non-negative numbers $ (c_0,c_1,\ldots,c_n)$ satisfies the condition: $ c_{p}c_{s}\plus{}c_{r}c_{t}\equal{} c_{p\plus{}r}c_{r\plus{}s}$ for all non-negative $ p,q,r,s$ such that $ p\plus{}q\plus{}r\plus{}s\equal{}n$. Determine all possible values of $ c_2$ when $ c_1\equal{}1$.

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that $f(x^3)-f(y^3)=(x^2+xy+y^2)(f(x)-f(y))$.

Determine all integer $n > 1$ such that \[\gcd \left( n, \dfrac{n-m}{\gcd(n,m)} \right) = 1\] for all integer $1 \le m < n$.

A class consists of $7$ boys and $13$ girls. During the first three months of the school year, each boy has communicated with each girl at least once. Prove that there exist two boys and two girls such that both boys communicated with both girls first time in the same month.

Determine whether or not there exist positive integers $ a$ and $ b$ such that $ a$ does not divide $ b^n \minus{} n$ for all positive integers $ n$.

Find all prime numbers $p$ such that $y^2 = x^3+4x$ has exactly $p$ solutions in integers modulo $p$. In other words, determine all prime numbers $p$ with the following property: there exist exactly $p$ ordered pairs of integers $(x,y)$ such that $x,y \in \{0,1,\dots,p-1\}$ and \[ p \text{ divides } y^2 - x^3 - 4x. \]

Let $u, v$ be arbitrary positive real numbers. Prove that \[\min{(u, \frac{100}{v}, v+\frac{2023}{u})} \leq \sqrt{2123}.\]

Consider an equilateral triangle with side length $9$. Each side is divided into $3$ equal segments by $2$ points, for a total of $6$ points. Compute the area of the circle passing through these$ 6$ points. [img]https://cdn.artofproblemsolving.com/attachments/7/b/1860a3ff86a0e4b93a4891861300dcb09adad4.png[/img]

Let $p$ be a positive integer and $q, z$ be real numbers with $0\le q\le 1$ and $q^{p+1}\le z\le 1$. Prove that \[\prod_{k=1}^p \left|\frac{z - q^k}{z + q^k}\right| \le\prod_{k=1}^p \left|\frac{1 - q^k}{1 + q^k}\right|.\]

Suppose that $x,y$ are distinct positive reals, and $n>1$ is a positive integer. If \[x^n-y^n=x^{n+1}-y^{n+1},\] then show that \[1<x+y<\frac{2n}{n+1}.\]

It takes $3$ rabbits $5$ hours to dig $9$ holes. It takes $5$ beavers $36$ minutes to build $2$ dams. At this rate, how many more minutes does it take $1$ rabbit to dig $1$ hole than it takes $1$ beaver to build $1$ dam? [i]2016 CCA Math Bonanza Team #1[/i]

In the questions below: $G$ is a finite group; $H \leq G$ a subgroup of $G; |G : H |$ the index of $H$ in $G; |X |$ the number of elements of $X \subseteq G; Z (G)$ the center of $G; G'$ the commutator subgroup of $G; N_{G}(H )$ the normalizer of $H$ in $G; C_{G}(H )$ the centralizer of $H$ in $G$; and $S_{n}$ the $n$-th symmetric group. Show that every element of $S_{n}$ is a product of $2$-cycles.

On account of the annual fluctuation of temperature the ground at the town of Ν freezes to a depth of 2 metres. To what depth would it freeze on account of a daily fluctuation of the same amplitude?

Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. Prove that there exists a point $J$ such that for any point $X$ inside $ABC$ if $AX,BX,CX$ intersect $\omega$ in $A_1,B_1,C_1$ and $A_2,B_2,C_2$ be reflections of $A_1,B_1,C_1$ in midpoints of $BC,AC,AB$ respectively then $A_2,B_2,C_2,J$ lie on a circle.

A $4\times4$ grid has its 16 cells colored arbitrarily in three colors. A [i]swap[/i] is an exchange between the colors of two cells. Prove or disprove that it always takes at most three swaps to produce a line of symmetry, regardless of the grid's initial coloring. [i]Proposed by Matthew Babbitt[/i]

Alice and Bob are painting a house. Alice can paint a house in $20$ hours by herself. Bob can paint a house in $40$ hours by himself. Both people start at the same time, paint at their own constant rate, and work together to paint one house. When the house is fully painted, what fraction of the house was painted by Alice?

Let $ABCD$ be a square such that $A=(0,0)$ and $B=(1,1)$. $P(\frac{2}{7},\frac{1}{4})$ is a point inside the square. An ant starts walking from $P$, touches $3$ sides of the square and comes back to the point $P$. The least possible distance traveled by the ant can be expressed as $\frac{\sqrt{a}}{b}$, where $a$ and $b$ are integers and $a$ not divisible by any square number other than $1$. What is the value of $(a+b)$?

In right $ \triangle ABC$ with legs $ 5$ and $ 12$, arcs of circles are drawn, one with center $ A$ and radius $ 12$, the other with center $ B$ and radius $ 5$. They intersect the hypotenuse at $ M$ and $ N$. Then, $ MN$ has length: [asy]size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(12,7), C=(12,0), M=12*dir(A--B), N=B+B.y*dir(B--A); real r=degrees(B); draw(A--B--C--cycle^^Arc(A,12,0,r)^^Arc(B,B.y,180+r,270)); pair point=incenter(A,B,C); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$M$", M, dir(point--M)); label("$N$", N, dir(point--N)); label("$12$", (6,0), S); label("$5$", (12,3.5), E);[/asy] $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ \frac {13}{5} \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \frac {24}{5}$

Initially, a non-constant polynomial $S(x)$ with real coefficients is written down on a board. Whenever the board contains a polynomial $P(x)$, not necessarily alone, one can write down on the board any polynomial of the form $P(C + x)$ or $C + P(x)$ where $C$ is a real constant. Moreover, if the board contains two (not necessarily distinct) polynomials $P(x)$ and $Q(x)$, one can write $P(Q(x))$ and $P(x) + Q(x)$ down on the board. No polynomial is ever erased from the board. Given two sets of real numbers, $A = \{ a_1, a_2, \dots, a_n \}$ and $B = \{ b_1, \dots, b_n \}$, a polynomial $f(x)$ with real coefficients is $(A,B)$-[i]nice[/i] if $f(A) = B$, where $f(A) = \{ f(a_i) : i = 1, 2, \dots, n \}$. Determine all polynomials $S(x)$ that can initially be written down on the board such that, for any two finite sets $A$ and $B$ of real numbers, with $|A| = |B|$, one can produce an $(A,B)$-[i]nice[/i] polynomial in a finite number of steps. [i]Proposed by Navid Safaei, Iran[/i]