Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

Let \(D\) be a point on segment \(PQ\). Let \(\omega\) be a fixed circle passing through \(D\), and let \(A\) be a variable point on \(\omega\). Let \(X\) be the intersection of the tangent to the circumcircle of \(\triangle ADP\) at \(P\) and the tangent to the circumcircle of \(\triangle ADQ\) at \(Q\). Show that as \(A\) varies, \(X\) lies on a fixed line. [i]Proposed by Elliott Liu and Anthony Wang[/i]

Consider a circle with center $O$ and radius $R,$ and let $A$ and $B$ be two points in the plane of this circle. [b]a.)[/b] Draw a chord $CD$ of the circle such that $CD$ is parallel to $AB,$ and the point of the intersection $P$ of the lines $AC$ and $BD$ lies on the circle. [b]b.)[/b] Show that generally, one gets two possible points $P$ ($P_{1}$ and $P_{2}$) satisfying the condition of the above problem, and compute the distance between these two points, if the lengths $OA=a,$ $OB=b$ and $AB=d$ are given.

Find the Betti numbers of the surface $x^2+y^2 = 1 + z^2$ in three-dimensional projective space. The same for the surfaces $z = xy$, $z=x^2$, $z^2 = x^2 + y^2$.

Show that ten equal-sized squares cannot be placed on a plane in such a way that no two have an interior point in common and the first touches each of the others.

A lattice point $(x, y, z) \in Z^3$ can be seen from the origin if the line from the origin does not contain any other lattice point $(x', y', z')$ with $$(x')^2 + (y')^2 + (z')^2 < x^2 + y^2 + z^2.$$ Let $p$ be the probability that a randomly selected point on the cubic lattice $Z^3$ can be seen from the origin. Given that $$\frac{1}{p}= \sum^{\infty}_{n=i} \frac{k}{n^s}$$ for some integers $ i, k$, and $s$, find $i, k$ and $s$.

Find all integers $n$ such that $\frac{4n}{n^2 +3 }$is an integer.

We call the three variable polynomial $P$ cyclic if $P(x,y,z)=P(y,z,x)$. Prove that cyclic three variable polynomials $P_1,P_2,P_3$ and $P_4$ exist such that for each cyclic three variable polynomial $P$, there exists a four variable polynomial $Q$ such that $P(x,y,z)=Q(P_1(x,y,z),P_2(x,y,z),P_3(x,y,z),P_4(x,y,z))$. [i]Solution by Mostafa Eynollahzade and Erfan Salavati[/i]

Real numbers$ x$ and $y$ it is know that $\frac{x+y}{x-y}+\frac{x-y}{x+y}= 1999$. Find the value of the expression $$\frac{x^4+y^4}{x^4-y^4}+\frac{x^4-y^4}{x^4+y^4}.$$

Does there exist a sequence of positive integers \( a_1, a_2, \ldots, a_{100} \) such that every number from \( 1 \) to \( 100 \) appears exactly once, and for each \( 1 \leq i \leq 100 \), the condition \[ a_{a_i + i} = i \] holds? Here it is assumed that \( a_{k+100} = a_k \) for each \( 1 \leq k \leq 100 \). [i]Proposed by Mykhailo Shtandenko[/i]

Let $N$ be a positive integer whose decimal representation contains $11235$ as a contiguous substring, and let $k$ be a positive integer such that $10^k>N$. Find the minimum possible value of \[\dfrac{10^k-1}{\gcd(N,10^k-1)}.\]

In one night the air temperature remained constant, several degrees below zero, and that of the water of a very extensive cylindrical pond, which formed a layer $10$ cm deep, it reached zero degrees, beginning then to form a layer of ice on the surface. Under these conditions it can be assumed that the thickness of the ice sheet formed is directly proportional to the square root of the time elapsed. At $0$ h, the thickness of the ice was $3$ cm and at $4$ h it was just over to freeze the water in the pond. Calculate at what time the ice sheet began to form, knowing that the density of the ice formed was $0.9$.

In $\mathbb{R}^3$ some $n$ points are coloured. In every step, if four coloured points lie on the same line, Vojtěch can colour any other point on this line. He observes that he can colour any point $P \in \mathbb{R}^3$ in a finite number of steps (possibly depending on $P$). Find the minimal value of $n$ for which this could happen.

You are given a number, and round it to the nearest thousandth, round this result to nearest hundredth, and round this result to the nearest tenth. If the final result is $.7$, what is the smallest number you could have been given? As is customary, $5$’s are always rounded up. Give the answer as a decimal.

Suppose $a_1, a_2, ... , a_{100}$ are positive real numbers such that $$a_k =\frac{ka_{k-1}}{a_{k-1} - (k - 1)}$$ for $k = 2, 3, ... , 100$. Given that $a_{20} = a_{23}$, compute $a_{100}$.

If $AB$ and $CD$ are perpendicular diameters of circle $Q$, $P$ in $\overline{AQ}$, and $\measuredangle QPC = 60^\circ$, then the length of $PQ$ divided by the length of $AQ$ is [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=(-1,0), B=(1,0), C=(0,1), D=(0,-1), Q=origin, P=(-0.5,0); draw(P--C--D^^A--B^^Circle(Q,1)); label("$A$", A, W); label("$B$", B, E); label("$C$", C, N); label("$D$", D, S); label("$P$", P, S); label("$Q$", Q, SE); label("$60^\circ$", P+0.0.5*dir(30), dir(30));[/asy] $ \textbf{(A)} \ \frac{\sqrt{3}}{2} \qquad \textbf{(B)} \ \frac{\sqrt{3}}{3} \qquad \textbf{(C)} \ \frac{\sqrt{2}}{2} \qquad \textbf{(D)} \ \frac12 \qquad \textbf{(E)} \ \frac23 $

For $a_1,..., a_5 \in R$, $$\frac{a_1}{k^2 + 1}+ ... +\frac{a_5}{k^2 + 5}=\frac{1}{k^2}$$ for all $k \in \{2, 3, 4, 5, 6\}$. Calculate $$\frac{a_1}{2}+... +\frac{a_5}{6}.$$

Find the locus of points on the surface of a cube that serve as the vertex of the smallest angle that subtends the diagonal.

Several policemen try to catch a thief who has $2m$ accomplices. To that end they place the accomplices under surveillance. In the beginning, the policemen shadow nobody. Every morning each policeman places under his surveillance one of the accomplices. Every evening the thief stops trusting one of his accomplices The thief is caught if by the $m$-th evening some policeman shadows exactly those $m$ accomplices who are still trusted by the thief. Prove that to guarantee the capture of the thief at least $2^m$ policemen are needed.

Each third-grade classroom at Pearl Creek Elementary has $18$ students and $2$ pet rabbits. How many more students than rabbits are there in all $4$ of the third-grade classrooms? ${{ \textbf{(A)}\ 48\qquad\textbf{(B)}\ 56\qquad\textbf{(C)}\ 64\qquad\textbf{(D)}\ 72}\qquad\textbf{(E)}\ 80} $

Let us call a continuous function $ f : [a,b] \rightarrow \mathbb{R}^2 \;\textit{reducible}$ if it has a double arc (that is, if there are $ a \leq \alpha < \beta \leq \gamma < \delta \leq b$ such that there exists a strictly monotone and continuous $ h : [\alpha,\beta] \rightarrow [\gamma,\delta]$ for which $ f(t)\equal{}f(h(t))$ is satisfied for every $ \alpha \leq t \leq \beta$); otherwise $ f$ is irreducible. Construct irreducible $ f : [a,b] \rightarrow \mathbb{R}^2$ and $ g : [c,d] \rightarrow \mathbb{R}^2$ such that $ f([a,b])\equal{}g([c,d])$ and (a) both $ f$ and $ g$ are rectifiable but their lengths are different; (b) $ f$ is rectifiable but $ g$ is not. [i]A. Csaszar[/i]

given $p_1,p_2,...$ be a sequence of integer and $p_1=2$, for positive integer $n$, $p_{n+1}$ is the least prime factor of $np_1^{1!}p_2^{2!}...p_n^{n!}+1 $ prove that all primes appear in the sequence (Proposed by Beatmania)

Quadrilateral $ABCD$ is inscribed in a circle of radius $R$, and also circumscribed around a circle of radius $r$. It is known that $\angle ADB = 45^o$. Find the area of triangle $AIB$, where point $I$ is the center of the circle inscribed in $ABCD$. (Hryhoriy Filippovskyi)

Let $f (x)$ be a function mapping real numbers to real numbers. Given that $f (f (x)) =\frac{1}{3x}$, and $f (2) =\frac19$, find $ f\left(\frac{1}{6}\right)$. [i]Proposed by Zachary Perry[/i]

Is there a positive integer $ k$ such that none of the digits $ 3,4,5,6$ appear in the decimal representation of the number $ 2002!\cdot k$?