Nico wants to write the $100$ integers from $1$ to $100$ around a circle in some order and without repetition, such that they have the following property: when moving around the circle clockwise, the sum of the $100$ distances between each number and its next number is equal to $198$. Determine in how many ways the $100$ numbers can be ordered so that Nico achieves his goal. [b]Note:[/b] The distance between two numbers $a$ and $b$ is equal to the absolute value of their difference: $|a - b|$.

Let $n > 1$ be a positive integer and $S$ be a collection of $\frac{1}{2}\binom{2n}{n}$ distinct $n$-element subsets of $\{1, 2, \dotsc, 2n\}$. Show that there exists $A, B\in S$ such that $|A\cap B|\leq 1$. [i]Proposed by Michael Ren.[/i]

On the base $BC$ of the isosceles triangle $ABC$ chose a point $D$ and in each of the triangles $ABD$ and $ACD$ inscribe a circle. Then everything was wiped, leaving only two circles. It is known from which side of their line of centers the apex $A$ is located . Use a compass and ruler to restore the triangle $ABC$ , if we know that : a) $AD$ is angle bisector, b) $AD$ is median.

For what values of $ n$ does there exist an $ n \times n$ array of entries -1, 0 or 1 such that the $ 2 \cdot n$ sums obtained by summing the elements of the rows and the columns are all different?

Given three numbers $x, y, z$, and set $x_1 = |x - y|, y_1 = | y -z|, z_1 = |z- x|$. From $x_1, y_1, z_1$, form in the same fashion the numbers $x_2, y_2, z_2$, and so on. It is known that $x_n = x, y_n = y, z_n = z$ for some $n$. Find all possible values of $(x, y, z)$.

In a school there are 1200 students. Each student must join exactly $k$ clubs. Given that there is a common club joined by every 23 students, but there is no common club joined by all 1200 students, find the smallest possible value of $k$.

The circle $C_{1}$ with radius $6$ and the circle $C_{2}$ with radius $8$ are externally tangent to each other at $A$. The circle $C_3$ which is externally tangent to $C_{1}$ and $C_{2}$ has a radius with length $21$. The common tangent of $C_{1}$ and $C_{2}$ which passes through $A$ meets $C_{3}$ at $B$ and $C$. What is $|BC|$? $ \textbf{(A)}\ 24 \qquad\textbf{(B)}\ 25 \qquad\textbf{(C)}\ 14\sqrt{3} \qquad\textbf{(D)}\ 24\sqrt{3} \qquad\textbf{(E)}\ 25\sqrt{3} $

We have a closed path on a vertices of a $ n$×$ n$ square which pass from each vertice exactly once . prove that we have two adjacent vertices such that if we cut the path from these points then length of each pieces is not less than quarter of total path .

Let $n$ be an integer greater than $6$.Show that if $n+1$ is a prime number,than $\left\lceil \frac{(n-1)!}{n(n+1)}\right \rceil$ is $ODD.$

In a convex hexagon $AC'BA'CB'$, every two opposite sides are equal. Let $A_1$ denote the point of intersection of $BC$ with the perpendicular bisector of $AA'$. Define $B_1$ and $C_1$ similarly. Prove that $A_1$, $B_1$, and $C_1$ are collinear.

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Let $n \geq 2, n \in \mathbb{N}$ and $A_0 = (a_{01},a_{02}, \ldots, a_{0n})$ be any $n-$tuple of natural numbers, such that $0 \leq a_{0i} \leq i-1,$ for $i = 1, \ldots, n.$ $n-$tuples $A_1= (a_{11},a_{12}, \ldots, a_{1n}), A_2 = (a_{21},a_{22}, \ldots, a_{2n}), \ldots$ are defined by: $a_{i+1,j} = Card \{a_{i,l}| 1 \leq l \leq j-1, a_{i,l} \geq a_{i,j}\},$ for $i \in \mathbb{N}$ and $j = 1, \ldots, n.$ Prove that there exists $k \in \mathbb{N},$ such that $A_{k+2} = A_{k}.$

[i]The Game.[/i] Eric and Greg are watching their new favorite TV show, [i]The Price is Right[/i]. Bob Barker recently raised the intellectual level of his program, and he begins the latest installment with bidding on following question: How many Carmichael numbers are there less than $100,000$? Each team is to list one nonnegative integer not greater than $100,000$. Let $X$ denote the answer to Bob’s question. The teams listing $N$, a maximal bid (of those submitted) not greater than $X$, will receive $N$ points, and all other teams will neither receive nor lose points. (A Carmichael number is an odd composite integer $n$ such that $n$ divides $a^{n-1}-1$ for all integers $a$ relatively prime to $n$ with $1<a<n$.)

Find all prime numbers $p$ such that $16p + 1$ is a perfect cube.

Consider a fixed circle $\Gamma$ with three fixed points $A, B,$ and $C$ on it. Also, let us fix a real number $\lambda \in(0,1)$. For a variable point $P \not\in\{A, B, C\}$ on $\Gamma$, let $M$ be the point on the segment $CP$ such that $CM =\lambda\cdot CP$ . Let $Q$ be the second point of intersection of the circumcircles of the triangles $AMP$ and $BMC$. Prove that as $P$ varies, the point $Q$ lies on a fixed circle. [i]Proposed by Jack Edward Smith, UK[/i]

The incircle of triangle $\triangle ABC$ touches $AC$ and $BC$ at $E$ and $D$ respectively. The excircle corresponding to $A$ touches the extensions of $BC$ at $A_1$, $CA$ at $B_1$, and $AB$ at $C_1$. Let $DE \cap A_1B_1 = L$. Prove that $L$ belongs to the circumcircle of triangle $\triangle A_1B_1C_1$.

Suppose that $c_n=(-1)^n(n+1)$. While the sum $\sum_{n=0}^\infty c_n$ is divergent, we can still attempt to assign a value to the sum using other methods. The Abel Summation of a sequence, $a_n$, is $\operatorname{Abel}(a_n)=\lim_{x\to1^-}\sum_{n=0}^\infty a_nx^n$. Find $\operatorname{Abel}(c_n)$.

Let $p$ be a prime number. Prove that the determinant of the matrix \[ \begin{bmatrix}x & y & z\\ x^p & y^p & z^p \\ x^{p^2} & y^{p^2} & z^{p^2} \end{bmatrix} \] is congruent modulo $p$ to a product of polynomials of the form $ax+by+cz$, where $a$, $b$, and $c$ are integers. (We say two integer polynomials are congruent modulo $p$ if corresponding coefficients are congruent modulo $p$.)

Denote by $B(c,r)$ the open disk of center $c$ and radius $r$ in the plane. Decide whether there exists a sequence $\{z_n\}^\infty_{n=1}$ of points in $\mathbb R^2$ such that the open disks $B(z_n,1/n)$ are pairwise disjoint and the sequence $\{z_n\}^\infty_{n=1}$ is convergent.

Let $ p$ be a prime number and $ k,n$ positive integers so that $ \gcd(p,n)\equal{}1$. Prove that $ \binom{n\cdot p^k}{p^k}$ and $ p$ are coprime.

Consider a natural number, $ n\ge 2, $ and three $ n\times n $ complex matrices $ A,B,C $ such that $ A $ is invertible, $ B $ is formed by replacing the first line of $ A $ with zeroes, and $ C $ is formed by putting the last $ n-1 $ lines of $ A $ above a line of zeroes. Prove that: [b]a)[/b] $ \text{rank} \left( A^{-1} B \right) = \text{rank} \left( \left( A^{-1} B\right)^2 \right) =\cdots =\text{rank} \left( \left( A^{-1} B\right)^n \right) $ [b]b)[/b] $ \text{rank} \left( A^{-1} C \right) > \text{rank} \left( \left( A^{-1} C\right)^2 \right) >\cdots >\text{rank} \left( \left( A^{-1} C\right)^n \right) $

Given two circles $\omega_1$ and $\omega_2$ where $\omega_2$ is inside $\omega_1$. Show that there exists a point $P$ such that for any line $\ell$ not passing through $P$, if $\ell$ intersects circle $\omega_1$ at $A,B$ and $\ell$ intersects circle $\omega_2$ at $C,D$, where $A,C,D,B$ lie on $\ell$ in this order, then $\angle APC=\angle BPD$.

Determine the biggest possible value of $ m$ for which the equation $ 2005x \plus{} 2007y \equal{} m$ has unique solution in natural numbers.

In a tournament with $55$ participants, one match is played at a time, with the loser dropping out. In each match, the numbers of wins so far of the two participants differ by not more than $1$. What is the maximal number of matches for the winner of the tournament?

Evaluate $\sin(1998^\circ+237^\circ)\sin(1998^\circ-1653^\circ)$.