Statement 1: Line $a\in\alpha$, line $b\in\beta$, and $a,b$ are skew lines. If $c=\alpha\cap\beta$, then $c$ intersects at most one of $a,b$. Statement 2: It's impossible to find infintely many lines, any two of them are skew lines. $\text{(A)}$ Statement 1 is true, Statement 2 is false. $\text{(B)}$ Statement 2 is true, Statement 1 is false. $\text{(C)}$ Both are true. $\text{(D)}$ Neither is true.

Let $O$ and $H$ be the circumcenter and the orthocenter of an acute triangle $ABC$. Points $M$ and $D$ lie on side $BC$ such that $BM=CM$ and $\angle BAD = \angle CAD$. Ray $MO$ intersects the circumcircle of triangle $BHC$ in point $N$. Prove that $\angle ADO = \angle HAN$.

Determine the natural numbers $n\ge 2$ for which exist $x_1,x_2,...,x_n \in R^*$, such that $$x_1+x_2+...+x_n=\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}=0$$

Solve in the set of real numbers the fractional part inequality $ \{ x \}\le\{ nx \} , $ where $ n $ is a fixed natural number.

A function $f:\mathbb{R} \to \mathbb{R}$ has the following property: $$\text{For every } x,y \in \mathbb{R} \text{ such that }(f(x)+y)(f(y)+x) > 0, \text{ we have } f(x)+y = f(y)+x.$$ Prove that $f(x)+y \leq f(y)+x$ whenever $x>y$.

In a group of mathematicians, every mathematician has some friends (the relation of friend is reciprocal). Prove that there exists a mathematician, such that the average of the number of friends of all his friends is no less than the average of the number of friends of all these mathematicians.

(a) Suppose that each square of a 4 x 7 chessboard is colored either black or white. Prove that with [i]any[/i] such coloring, the board must contain a rectangle (formed by the horizontal and vertical lines of the board) whose four distinct unit corner squares are all of the same color. (b) Exhibit a black-white coloring of a 4 x6 board in which the four corner squares of every rectangle, as described above, are not all of the same color.

Let $ S$ be the sum of the inversible elements of a finite ring. Prove that $ S^2\equal{}S$ or $ S^2\equal{}0$.

There is a lighthouse on a small island. Its lamp enlights a segment of a sea to the distance $a$. The light is turning uniformly, and the end of the segment moves with the speed $v$. Prove that a ship, whose speed doesn't exceed $v/8$ cannot arrive to the island without being enlightened.

Let $P_1, ... , P_{2556}$ be distinct points in a regular hexagon $ABCDEF$ with unit side length. Suppose that no three points in the set $S = \{A, B, C, D, E, F, P_1, ... , P_{2556}\}$ are collinear. Show that there is a triangle whose vertices are in $S$ and whose area is less than $\frac{1}{1700}$ .

Given triangle $ABC$ and $P,Q$ are two isogonal conjugate points in $\triangle ABC$. $AP,AQ$ intersects $(QBC)$ and $(PBC)$ at $M,N$, respectively ( $M,N$ be inside triangle $ABC$) 1. Prove that $M,N,P,Q$ locate on a circle - named $(I)$ 2. $MN\cap PQ$ at $J$. Prove that $IJ$ passed through a fixed line when $P,Q$ changed

In a $3n \times 3n$ grid, each square is either black or red. Each red square not on the edge of the grid has exactly five black squares among its eight neighbor squares.. On every black square that not at the edge of the grid, there are exactly four reds in the adjacent squares box. How many black and how many red squares are in the grid?

Each deputy of the Academic Duma quarreled with exactly three other deputies. The President ordered the Speaker to divide the deputies into n factions so that agreement reigned within one faction. For what smallest $n$ is this always possible? (This means that there is such $n$ that deputies could always be divided into $n$ factions, but not always into $(n- 1)$ factions.)

Find all functions $f:R\rightarrow R$ such that \[ f(x^3)+f(y^3)=(x+y)(f(x^2)+f(y^2)-f(xy)) \] for all $x,y\in R$.

A car has a 4-digit integer price, which is written digitally. (so in digital numbers, like on your watch probably) While the salesmen isn't watching, the buyer turns the price upside down and gets the car for 1626 less. How much did the car initially cost?

In a square $ABCD$, $E$ is the midpoint of side $BC$. Line $AE$ intersects line $DC$ at $F$ and diagonal $BD$ at $G$. If the area $(EFC) = 8$, determine the area $(GBE)$.

Let $a, b, c$ be positive integers whose greatest common divisor is $1$. Determine whether there always exists a positive integer $n$ such that, for every positive integer $k$, the number $2^n$ is not a divisor of $a^k+b^k+c^k$.

Inside triangle \( ABC \), a point \( D \) is chosen such that \( \angle ADB = \angle ADC \). The rays \( BD \) and \( CD \) intersect the circumcircle of triangle \( ABC \) at points \( E \) and \( F \), respectively. On segment \( EF \), points \( K \) and \( L \) are chosen such that \linebreak \( \angle AKD = 180^\circ - \angle ACB \) and \( \angle ALD = 180^\circ - \angle ABC \), with segments \( EL \) and \( FK \) \linebreak not intersecting line \( AD \). Prove that \( AK = AL \). [i]Proposed by Matthew Kurskyi[/i]

The set of all real numbers $ x$ for which \[ \log_{2004}(\log_{2003}(\log_{2002}(\log_{2001}{x}))) \]is defined is $ \{x|x > c\}$. What is the value of $ c$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2001^{2002} \qquad \textbf{(C)}\ 2002^{2003} \qquad \textbf{(D)}\ 2003^{2004} \qquad \textbf{(E)}\ 2001^{2002^{2003}}$

In triangle $ABC$, $R$ is the midpoint of $BC$ and $CS = 3SA$. If $x$ is the area of $CRS$, $y$ is the area of $RBT$, $z$ is the area of $ATS$, and $y^2 = xz$, then what is the value of $\frac{AT}{TB}$? Express your answer in the form $\frac{a+b\sqrt{c}}{d}$ , where $a,b,c,d$ are integers, $d$ is positive and as small as possible, and $c$ is squarefree. [img]https://cdn.artofproblemsolving.com/attachments/f/d/65b443628329610ff41d30b95e5ebd0c914f20.jpg[/img]

You have two blackboards $A$ and $B$. You have to write on them some of the integers greater than or equal to $2$ and less than or equal to $20$ in such a way that each number on blackboard $A$ is co-prime with each number on blackboard $B.$ Determine the maximum possible value of multiplying the number of numbers written in $A$ by the number of numbers written in $B$.

We mean a traingle in $\mathbb Q^{n}$, 3 points that are not collinear in $\mathbb Q^{n}$ a) Suppose that $ABC$ is triangle in $\mathbb Q^{n}$. Prove that there is a triangle $A'B'C'$ in $\mathbb Q^{5}$ that $\angle B'A'C'=\angle BAC$. b) Find a natural $m$ that for each traingle that can be embedded in $\mathbb Q^{n}$ it can be embedded in $\mathbb Q^{m}$. c) Find a triangle that can be embedded in $\mathbb Q^{n}$ and no triangle similar to it can be embedded in $\mathbb Q^{3}$. d) Find a natural $m'$ that for each traingle that can be embedded in $\mathbb Q^{n}$ then there is a triangle similar to it, that can be embedded in $\mathbb Q^{m}$. You must prove the problem for $m=9$ and $m'=6$ to get complete mark. (Better results leads to additional mark.)

Show that for any real numbers $ a,b, $ there exists $ c\in [-2,1] $ such that $ \big| c^3+ac+b\big| \ge 1. $

Three circles $O_1, \ O_2, \ O_3$ with radiii $r_1, \ r_2, \ r_3$ respectively are tangent extarnally in pairs. Let r be the radius of the inscrined circle of triangle $O_1O_2O_3$. Prove that $$ r=\sqrt{\dfrac{r_1r_2r_3}{r_1+r_2+r_3}}.$$

Define the sequences $(a_n),(b_n)$ by \begin{align*} & a_n, b_n > 0, \forall n\in\mathbb{N_+} \\ & a_{n+1} = a_n - \frac{1}{1+\sum_{i=1}^n\frac{1}{a_i}} \\ & b_{n+1} = b_n + \frac{1}{1+\sum_{i=1}^n\frac{1}{b_i}} \end{align*} 1) If $a_{100}b_{100} = a_{101}b_{101}$, find the value of $a_1-b_1$; 2) If $a_{100} = b_{99}$, determine which is larger between $a_{100}+b_{100}$ and $a_{101}+b_{101}$.