Let $x_1,x_2,...,x_n$ ($n \ge 2$) be positive numbers with the sum $1$. Prove that $$\sum_{i=1}^{n} \frac{1}{\sqrt{1-x_i}} \ge n\sqrt{\frac{n}{n-1}} $$

A triangle $ ABC$ is inscribed in a circle $ C(O,R)$ and has incenter $ I$. Lines $ AI,BI,CI$ meet the circumcircle $ (O)$ of triangle $ ABC$ at points $ D,E,F$ respectively. The circles with diameter $ ID,IE,IF$ meet the sides $ BC,CA, AB$ at pairs of points $ (A_1,A_2), (B_1, B_2), (C_1, C_2)$ respectively. Prove that the six points $ A_1,A_2, B_1, B_2, C_1, C_2$ are concyclic. Babis

A function $ f$ defined on the positive integers (and taking positive integers values) is given by: $ \begin{matrix} f(1) \equal{} 1, f(3) \equal{} 3 \\ f(2 \cdot n) \equal{} f(n) \\ f(4 \cdot n \plus{} 1) \equal{} 2 \cdot f(2 \cdot n \plus{} 1) \minus{} f(n) \\ f(4 \cdot n \plus{} 3) \equal{} 3 \cdot f(2 \cdot n \plus{} 1) \minus{} 2 \cdot f(n), \end{matrix}$ for all positive integers $ n.$ Determine with proof the number of positive integers $ \leq 1988$ for which $ f(n) \equal{} n.$

Find all differentiable functions $f:\mathbb{R}\to\mathbb{R}$ such that \[f'(x)=\frac{f(x+n)-f(x)}n\] for all real numbers $x$ and all positive integers $n.$

The altitude from a vertex of a given tetrahedron intersects the opposite face in its orthocenter. Prove that all four altitudes of the tetrahedron are concurrent.

A rectangle-shaped puzzle is assembled with $2000$ pieces that are all equal rectangles, and similar to the large rectangle, so that the sides of the small rectangles are parallel to those of the large one. The shortest side of each piece measures $1$. Determine what is the minimum possible value of the area of the large rectangle.

Squares $ABCD$ and $BEFG$ are located as shown in the figure. It turned out that points $A, G$ and $E$ lie on the same straight line. Prove that then the points $D, F$ and $E$ also lie on the same line. [img]https://cdn.artofproblemsolving.com/attachments/4/2/9faf29a399d3a622c84f5d4a3cfcf5e99539c0.png[/img]

Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

Peter and Basil together thought of ten quadratic trinomials. Then, Basil began calling consecutive natural numbers starting with some natural number. After each called number, Peter chose one of the ten polynomials at random and plugged in the called number. The results were recorded on the board. They eventually form a sequence. After they finished, their sequence was arithmetic. What is the greatest number of numbers that Basil could have called out?

Assume every side length of a triangle $ABC$ is more than $2$ and two of its angles are given by $\angle ABC = 57^\circ$ and $ACB = 63^\circ$. Point $P$ is chosen on side $BC$ with $BP:PC = 2:1$. Points $M,N$ are chosen on sides $AB$ and $AC$, respectively so that $BM = 2$ and $CN = 1$. Let $Q$ be the point on segment $MN$ for which $MQ:QN = 2:1$. Find the value of $PQ$. Your answer must be in simplest form.

The vertices of a triangle $DEF$ lie on different sides of a triangle $ABC$. The lengths of the tangents from the incenter of $DEF$ to the excircles of $ABC$ are equal. Prove that $4S_{DEF} \ge S_{ABC}$. [i]Note: By $S_{XYZ}$ we denote the area of triangle $XYZ$.[/i]

Given an integer $ m\geq$ 2, m positive integers $ a_1,a_2,...a_m$. Prove that there exist infinitely many positive integers n, such that $ a_{1}1^{n} \plus{} a_{2}2^{n} \plus{} ... \plus{} a_{m}m^{n}$ is composite.

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Haydn picks two different integers between $1$ and $100$, inclusive, uniformly at random. The probability that their product is divisible by $4$ can be expressed in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

Suppose that $ABCD$ is a rectangle with sides of length $12$ and $18$. Let $S$ be the region of points contained in $ABCD$ which are closer to the center of the rectangle than to any of its vertices. Find the area of $S$.

Of six cities $S_1,S_2,...,S_6$ and two airlines $A$ and $B$ it is given that for every pair $(S_i,S_j)$ (where $i \ne j$) exactly one of the airlines has a connection from $S_i$ to $S_j$ and maintains back. (a) Prove that the air net of one of the companies contains a triangle. (b) Prove that in the two air nets there are even two triangles. [hide=]original wording]Van zes steden $S_1,S_2,...,S_6$ en twee luchtvaartmaatschappijen $A$ en $B$ is gegeven, dat voor ieder paar $(S_i,S_j)$ (waar $i \ne j$) precies één van de maatschappijen een verbinding van $S_i$ naar $S_j$ en terug onderhoudt, (a) Bewijs, dat het luchtnet van één van de maaschappijen een driehoek bevat; (b) Bewijs, dat er in de twee luchtnetten zelfs twee driehoeken zijn.[/hide]

Consider all points with integer coordinates in the carthesian plane. If one draws a circle with M(0,0) and a well-chose radius r, the circles goes through some of those points. (like circle with $r=2\sqrt2$ goes through 4 points) Prove that $\forall n\in \mathbb{N}, \exists r$ so that the circle with midpoint 0,0 and radius $r$ goes through at least $n$ points.

For $H\subset \mathbb Z$ and $n\in\mathbb Z$ let $h_n$ denote the number of finite subsets of $H$ in which the sum of the elements is $n$. Determine whether there exists $H\subset \mathbb Z$ for which $0\notin H$ and $h_n$ is a finite even number for every $n\in\mathbb{Z}$. (The sum of the elements of the empty set is $0$.) [i]Proposed by Csongor Beke, Cambridge[/i]

Find all functions $f: \mathbb{N} \rightarrow [0, +\infty)$ such that $f(1000)=10$ and $f(n+1)= \sum_{k=1}^n \frac{1}{f^2(k) + f(k)f(k+1) + f^2(k+1)}$ for all $n \in \mathbb{N}$. (Here, $f^2(i)$ means $(f(i))^2$.)

In a 2025 by 2025 grid, every cell initially contains a `1'. Every minute, we simultaneously replace the number in each cell with the sum of numbers in the cells that share an edge with it. (For example, after the first minute, the number 2 is written in each of the four corner cells.) After 2025 minutes, we colour the board in checkerboard fashion, such that the top left corner is black. Find the difference between the sum of numbers in black cells and the sum of numbers in white cells. [i]Proposed by chorn[/i]

Let $I$, $O$, $H$, and $\Omega$ be the incenter, circumcenter, orthocenter, and the circumcircle of the triangle $ABC$, respectively. Assume that line $AI$ intersects with $\Omega$ again at point $M\neq A$, line $IH$ and $BC$ meets at point $D$, and line $MD$ intersects with $\Omega$ again at point $E\neq M$. Prove that line $OI$ is tangent to the circumcircle of triangle $IHE$. [i]Proposed by Li4 and Leo Chang.[/i]

Let $A,B\in \mathcal{M}_n(\mathbb{R})$ such that $B^2=I_n$ and $A^2=AB+I_n$. Prove that: \[\det A\le \left(\frac{1+\sqrt{5}}{2}\right)^n\]

Let $K$ be the point of intersection of $AB$ and the line touching the circumcircle of $\triangle ABC$ at $C$ where $m(\widehat {A}) > m(\widehat {B})$. Let $L$ be a point on $[BC]$ such that $m(\widehat{ALB})=m(\widehat{CAK})$, $5|LC|=4|BL|$, and $|KC|=12$. What is $|AK|$? $ \textbf{(A)}\ 4\sqrt 2 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ \text{None of the above} $

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

Let $ABC$ be a triangle such that $AB <AC$, $\omega$ its inscribed circle and $\Gamma$ its circumscribed circle. Let also $\omega_b$ be the excircle relative to vertex $B$, then $B'$ is the point of tangency between $\omega_b$ and $(AC)$. Similarly, let the circle $\omega_c$ be the excircle exinscribed relative to vertex $C$, then $C'$ is the point of tangency between $\omega_c$ and $(AB)$. Finally, let $I$ be the center of $\omega$ and $X$ the point of $\Gamma$ such that $\angle XAI$ is a right angle. Prove that the triangles $XBC'$ and $XCB'$ are congruent.