We say three sets $A_1, A_2, A_3$ form a triangle if for each $1 \leq i,j \leq 3$ we have $A_i \cap A_j \neq \emptyset$, and $A_1 \cap A_2 \cap A_3 = \emptyset$. Let $f(n)$ be the smallest positive integer such that any subset of $\{1,2,3,\ldots, n\}$ of the size $f(n)$ has at least one triangle. Find a formula for $f(n)$.

Let $X$ be a set with $n\ge 2$ elements. Define $\mathcal{P}(X)$ to be the set of all subsets of $X$. Find the number of functions $f:\mathcal{P}(X)\mapsto \mathcal{P}(X)$ such that $$|f(A)\cap f(B)|=|A\cap B|$$ whenever $A$ and $B$ are two distinct subsets of $X$. [i] (Sergiu Novac)[/i]

Tao plays the following game:given a constant $v>1$;for any positive integer $m$,the time between the $m^{th}$ round and the $(m+1)^{th}$ round of the game is $2^{-m}$ seconds;Tao chooses a circular safe area whose radius is $2^{-m+1}$ (with the border,and the choosing time won't be calculated) on the plane in the $m^{th}$ round;the chosen circular safe area in each round will keep its center fixed,and its radius will decrease at the speed $v$ in the rest of the time(if the radius decreases to $0$,erase the circular safe area);if it's possible to choose a circular safe area inside the union of the rest safe areas sometime before the $100^{th}$ round(including the $100^{th}$ round),then Tao wins the game.If Tao has a winning strategy,find the minimum value of $\biggl\lfloor\frac{1}{v-1}\biggr\rfloor$.

Given positive real numbers $a_1, a_2, \dots, a_n$. Let \[ m = \min \left( a_1 + \frac{1}{a_2}, a_2 + \frac{1}{a_3}, \dots, a_{n - 1} + \frac{1}{a_n} , a_n + \frac{1}{a_1} \right). \] Prove the inequality \[ \sqrt[n]{a_1 a_2 \dots a_n} + \frac{1}{\sqrt[n]{a_1 a_2 \dots a_n}} \ge m. \]

Four points are given $A, B, C, D$. Points $A_1, B_1, C_1,D_1$ are orthocenters of the triangles $BCD, CDA, DAB, ABC$ and $A_2, B_2, C_2,D_2$ are orthocenters of the triangles $B_1C_1D_1, C_1D_1A_1, D_1A_1B_1,A_1B_1C_1$ etc. Prove that the circles passing through the midpoints of the sides of all the triangles intersect at one point.

Let $ABC$ be an acute triangle with circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to $BC$ and let $M$ be the midpoint of $OD$. The points $O_b$ and $O_c$ are the circumcenters of triangles $AOC$ and $AOB$, respectively. If $AO=AD$, prove that points $A$, $O_b$, $M$ and $O_c$ are concyclic. [i]Marin Hristov and Bozhidar Dimitrov, Bulgaria[/i]

Find all $ f:N\rightarrow N$, such that $\forall m,n\in N $ $ 2f(mn) \geq f(m^2+n^2)-f(m)^2-f(n)^2 \geq 2f(m)f(n) $

Find the number of distinguishable $2\times 2\times 2$ cubes that can be formed by gluing together two blue, two green, two red, and two yellow $1\times 1\times 1$ cubes. Two cubes are indistinguishable if one can be rotated so that the two cubes have identical coloring patterns.

Find all polynomials $p$ with real coefficients such that for all real $x$ , $xp(x)p(1-x)+x^3 +100 \ge 0$.

Find all the pairs of integers $(m,n)$ satisfying the equality $3(m^2+n^2)-7(m+n)=-4$

Let $a, b, c$ be positive real numbers. Prove that $$\sqrt{\frac{a^2+b^2}{a+b}}+\sqrt{\frac{b^2+c^2}{b+c}}+\sqrt{\frac{c^2+a^2}{c+a}}\geq\sqrt{\frac{2ab}{3a+b+2c}}+\sqrt{\frac{2bc}{3b+c+2a}}+\sqrt{\frac{2ca}{3c+a+2b}}.$$

A positive integer is called [i]good [/i] if it can be written as the sum of two distinct integer squares. A positive integer is called [i]better [/i]if it can be written in at least two was as the sum of two integer squares. A positive integer is called [i]best [/i] if it can be written in at least four ways as the sum of two distinct integer squares. a) Prove that the product of two good numbers is good. b) Prove that $ 5$ is good, $ 2005$ is better, and $ 2005^2$ is best.

Let $ABC$ be a triangle. The incircle of $ABC$ touches the sides $AB$ and $AC$ at the points $Z$ and $Y$, respectively. Let $G$ be the point where the lines $BY$ and $CZ$ meet, and let $R$ and $S$ be points such that the two quadrilaterals $BCYR$ and $BCSZ$ are parallelogram. Prove that $GR=GS$. [i]Proposed by Hossein Karke Abadi, Iran[/i]

Find positive integers $x, y, z$ such that $x > z > 1999 \cdot 2000 \cdot 2001 > y$ and $2000x^{2}+y^{2}= 2001z^{2}.$

For which pair $(A,B)$, \[ x^2+xy+y=A \\ \frac{y}{y-x}=B \] has no real roots? $ \textbf{(A)}\ (1/2,2) \qquad\textbf{(B)}\ (-1,1) \qquad\textbf{(C)}\ (\sqrt 2, \sqrt 2) \qquad\textbf{(D)}\ (1,1/2) \qquad\textbf{(E)}\ (2,2/3) $

Let $a_0=1$ and for all $n\ge 1$ let $a_n$ be the smaller root of the equation $$4^{-n}x^2-x+a_{n-1} = 0.$$ Given that $a_n$ approaches a value $L$ as $n$ goes to infinity, what is the value of $L$?

Show that for every convex polygon whose area is less than or equal to $1$, there exists a parallelogram with area $2$ containing the polygon.

Let $ABCD$ be a trapezoid such that $|AB|=9$, $|CD|=5$ and $BC\parallel AD$. Let the internal angle bisector of angle $D$ meet the internal angle bisectors of angles $A$ and $C$ at $M$ and $N$, respectively. Let the internal angle bisector of angle $B$ meet the internal angle bisectors of angles $A$ and $C$ at $L$ and $K$, respectively. If $K$ is on $[AD]$ and $\dfrac{|LM|}{|KN|} = \dfrac 37$, what is $\dfrac{|MN|}{|KL|}$? $ \textbf{(A)}\ \dfrac{62}{63} \qquad\textbf{(B)}\ \dfrac{27}{35} \qquad\textbf{(C)}\ \dfrac{2}{3} \qquad\textbf{(D)}\ \dfrac{5}{21} \qquad\textbf{(E)}\ \dfrac{24}{63} $

Higher Secondary P7 If there exists a prime number $p$ such that $p+2q$ is prime for all positive integer $q$ smaller than $p$, then $p$ is called an "awesome prime". Find the largest "awesome prime" and prove that it is indeed the largest such prime.

Let $ABCD$ be a circumscribed quadrilateral. Its incircle $\omega$ touches the sides $BC$ and $DA$ at points $E$ and $F$ respectively. It is known that lines $AB,FE$ and $CD$ concur. The circumcircles of triangles $AED$ and $BFC$ meet $\omega$ for the second time at points $E_1$ and $F_1$. Prove that $EF$ is parallel to $E_1 F_1$.

The pentagon $ABCDE$ is inscribed in the circle. Line segments $AC$ and $BD$ intersect at point $K$. Line segment $CE$ touches the circumcircle of triangle $ABK$ at point $N$. Find the angle $CNK$ if $\angle ECD = 40^o.$

Let $A,B,C$ be points on $[OX$ and $D,E,F$ be points on $[OY$ such that $|OA|=|AB|=|BC|$ and $|OD|=|DE|=|EF|$. If $|OA|>|OD|$, which one below is true? $\textbf{(A)}$ For every $\widehat{XOY}$, $\text{ Area}(AEC)>\text{Area}(DBF)$ $\textbf{(B)}$ For every $\widehat{XOY}$, $\text{ Area}(AEC)=\text{Area}(DBF)$ $\textbf{(C)}$ For every $\widehat{XOY}$, $\text{ Area}(AEC)<\text{Area}(DBF)$ $\textbf{(D)}$ If $m(\widehat{XOY})<45^\circ$ then $\text{Area}(AEC)<\text{Area}(DBF)$, and if $45^\circ < m(\widehat{XOY})<90^\circ$ then $\text{Area}(AEC)>\text{Area}(DBF)$ $\textbf{(E)}$ None of above

Let $\mathcal{C}$ be a family of subsets of $A=\{1,2,\dots,100\}$ satisfying the following two conditions: 1) Every $99$ element subset of $A$ is in $\mathcal{C}.$ 2) For any non empty subset $C\in\mathcal{C}$ there is $c\in C$ such that $C\setminus\{c\}\in \mathcal{C}.$ What is the least possible value of $|\mathcal{C}|$?

Let $x_1<x_2< \ldots <x_{2024}$ be positive integers and let $p_i=\prod_{k=1}^{i}(x_k-\frac{1}{x_k})$ for $i=1,2, \ldots, 2024$. What is the maximal number of positive integers among the $p_i$?

Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?