In a tennis club, each member has exactly $k > 0$ friends, and a tournament is organized in rounds such that each pair of friends faces each other in matches exactly once. Rounds are played in simultaneous matches, choosing pairs until they cannot choose any more (that is, among the unchosen people, there is not a pair of friends which has its match pending). Determine the maximum number of rounds the tournament can have, depending on $k$.

A point $O$ inside a convex $n$-gon $A_1A_2 . . .A_n$ is connected with segments to its vertices. The sides of this $n$-gon are numbered $1$ to $n$ (distinct sides have distinct numbers). The segments $OA_1,OA_2, . . . ,OA_n$ are similarly numbered. a) For $n = 9$ find a numeration such that the sum of the sides’ numbers is the same for all triangles $A_1OA_2, A_2OA_3, . . . , A_nOA_1$. b) Prove that for $n = 10$ there is no such numeration.

Consider a triangle $ABC$ with $|AB|\neq |AC|$. The angle bisector of the angle $CAB$ intersects the circumcircle of $\triangle ABC$ at two points $A$ and $D$. The circle of center $D$ and radius $|DC|$ intersects the line $AC$ at two points $C$ and $B’$. The line $BB’$ intersects the circumcircle of $\triangle ABC$ at $B$ and $E$. Prove that $B’$ is the orthocenter of $\triangle AED$.

$A$ is the point $(1,0)$, $L$ is the line $y = kx$ (where $k > 0$). For which points $P(t,0)$ can we find a point $Q$ on $L$ such that $AQ$ and $QP$ are perpendicular?

Prove that there exist infinitely many positive integers $n$ such that $p=nr$, where $p$ and $r$ are respectively the semi-perimeter and the inradius of a triangle with integer side lengths.

For positive integers $ n,$ the numbers $ f(n)$ are defined inductively as follows: $ f(1) \equal{} 1,$ and for every positive integer $ n,$ $ f(n\plus{}1)$ is the greatest integer $ m$ such that there is an arithmetic progression of positive integers $ a_1 < a_2 < \ldots < a_m \equal{} n$ for which \[ f(a_1) \equal{} f(a_2) \equal{} \ldots \equal{} f(a_m).\] Prove that there are positive integers $ a$ and $ b$ such that $ f(an\plus{}b) \equal{} n\plus{}2$ for every positive integer $ n.$

A segment of length $\sqrt2 + \sqrt3 + \sqrt5$ is drawn. Is it possible to draw a segment of unit length using a compass and a straightedge? [i](3 points)[/i]

Let $XYZ$ be a triangle with $ \angle X = 60^\circ $ and $ \angle Y = 45^\circ $. A circle with center $P$ passes through points $A$ and $B$ on side $XY$, $C$ and $D$ on side $YZ$, and $E$ and $F$ on side $ZX$. Suppose $AB=CD=EF$. Find $ \angle XPY $ in degrees.

Let $ABCD$ be a convex quadrilateral, such that $ A$, $ B$, $C$, and $D$ lie on a circle, with $\angle DAB < \angle ABC$. Let $I$ be the intersection of the bisector of $\angle ABC$ with the bisector of $\angle BAD$. Let $\ell$ be the parallel line to $CD$ passing through point $I$. Suppose $\ell$ cuts segments $DA$ and $BC$ at $ L$ and $J$, respectively. Prove that $AL + JB = LJ$.

Let $ n$ be a positive integer. Determine the number of triangles (non congruent) with integral side lengths and the longest side length is $ n$.

$ABC$ is an acute triangle with $AB> AC$. $\Gamma_B$ is a circle that passes through $A,B$ and is tangent to $AC$ on $A$. Define similar for $ \Gamma_C$. Let $D$ be the intersection $\Gamma_B$ and $\Gamma_C$ and $M$ be the midpoint of $BC$. $AM$ cuts $\Gamma_C$ at $E$. Let $O$ be the center of the circumscibed circle of the triangle $ABC$. Prove that the circumscibed circle of the triangle $ODE$ is tangent to $\Gamma_B$.

In convex quadrilateral $ABCD$ with $AB = 11$ and $CD = 13,$ there is a point $P$ for which $\triangle{ADP}$ and $\triangle{BCP}$ are congruent equilateral triangles. Compute the side length of these triangles.

Let $f(z) = az^4+ bz^3+ cz^2+ dz + e = a(z -r_1)(z -r_2)(z -r_3)(z -r_4)$ where $a, b, c, d, e$ are integers, $a \not= 0$. Show that if $r_1 + r_2$ is a rational number, and if $r_1 + r_2 \neq r_3 + r_4$, then $r_1r_2$ is a rational number.

A subset $S \in \{0, 1, 2, \cdots , 2000\}$ satisfies $|S|=401$. Prove that there exists a positive integer $n$ such that there are at least $70$ positive integers $x$ such that $x, x+n \in S$

Let $P$ be the quadratic function such that $P(0) = 7$, $P(1) = 10$, and $P(2) = 25$. If $a$, $b$, and $c$ are integers such that every positive number $x$ less than 1 satisfies \[ \sum_{n = 0}^\infty P(n) x^n = \frac{ax^2 + bx + c}{{(1 - x)}^3}, \] compute the ordered triple $(a, b, c)$.

Inside a circle with radius $6$ lie four smaller circles with centres $A,B,C$ and $D$. The circles touch each other as shown. The point where the circles with centres $A$ and $C$ touch each other is the centre of the big circle. Calculate the area of quadrilateral $ABCD$. [img]https://1.bp.blogspot.com/-FFsiOOdcjao/XzT_oJYuQAI/AAAAAAAAMVk/PpyUNpDBeEIESMsiElbexKOFMoCXRVaZwCLcBGAsYHQ/s0/2012%2BMohr%2Bp1.png[/img]

Let $ABCA'B'C'$ be a centrosymmetric octahedron (vertices $A$ and $A'$, $B$ and $B'$, $C$ and $C'$ are opposite) such that the sums of four planar angles equal $240^o$ for each vertex. The Torricelli points $T_1$ and $T_2$ of triangles $ABC$ and $A'BC$ are marked. Prove that the distances from $T_1$ and $T_2$ to $BC$ are equal.

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

Triangles $ABC$ and $DEF$ are such that $\angle A = \angle D, AB = DE = 17, BC = EF = 10$ and $AC - DF = 12$. What is $AC + DF$?

Prove that the number $99999+111111\sqrt{3}$ cannot be written in the form $(A+B\sqrt{3})^2$, where $A$ and $B$ are integers.

Let $ABC$ be a triangle. Let $D, E, F$ be points respectively on the segments $BC, CA, AB$ such that $AD, BE, CF$ concur at the point $K$. Suppose $\frac{BD}{DC} = \frac {BF}{FA}$ and $\angle ADB = \angle AFC$. Prove that $\angle ABE = \angle CAD$.

Find all triples $(x,y,z)$ of positive integers such that $3^x + 4^y = 5^z$.

Let $A_1A_2\cdots A_n$ be a regular polygon with $n$ sides, $n \geqslant 3$. Initially, there are three ants standing at vertex $A_1$. Every minute, two ants simultaneously move to an adjacent vertex, but in different directions (one clockwise and the other counterclockwise), and the third stays at its current vertex. Determine all the values of $n$ for which, after some time, the three ants can meet at the same vertex of the polygon, different from $A_1$.

Let $n{}$ be a natural number. The playing field for a "Master Sudoku" is composed of the $n(n+1)/2$ cells located on or below the main diagonal of an $n\times n$ square. A teacher secretly selects $n{}$ cells of the playing field and tells his student [list] [*]the number of selected cells on each row, and [*]that there is one selected cell on each column. [/list]The teacher's selected cells form a Master Sudoku if his student can determine them with the given information. How many Master Sudokus are there? [i]Proposed by T. Amdeberkhan, M. Ruby and F. Petrov[/i]

Neel and Roshan are going to the Newark Liberty International Airport to catch separate flights. Neel plans to arrive at some random time between 5:30 am and 6:30 am, while Roshan plans to arrive at some random time between 5:40 am and 6:40 am. The two want to meet, however briefly, before going through airport security. As such, they agree that each will wait for $n$ minutes once he arrives at the airport before going through security. What is the smallest $n$ they can select such that they meet with at least 50% probability? The answer will be of the form $a + b\sqrt{c}$ for integers $a$, $b$, and $c$, where $c$ has no perfect square factor other than $1$. Report $a + b + c.$