Let each of $m$ distinct points on the positive part of the $x$-axis be joined to $n$ distinct points on the positive part of the $y$-axis. Obtain a formula for the number of intersection points of these segments, assuming that no three of the segments are concurrent.

Does there exist functions $ f,g: \mathbb{R}\to\mathbb{R}$ such that $ f(g(x)) \equal{} x^2$ and $ g(f(x)) \equal{} x^k$ for all real numbers $ x$ a) if $ k \equal{} 3$? b) if $ k \equal{} 4$?

Find $x$ so that $2^{2^{3^{2^{2}}}} = 4^{4^{x}}$.

In triangle $ABC$, $AB > BC > CA$, $AB=6$, $\angle{B}-\angle{C}=90^o$. The incircle touches $BC$ at $E$ and $EF$ is a diameter of the incircle. Radical $AF$ intersect $BC$ at $D$. $DE$ equals to the circumradius of $\triangle{ABC}$. Find $BC$ and $AC$.

Given a positive integer $n$ and $I = \{1, 2,..., k\}$ with $k$ is a positive integer. Given positive integers $a_1, a_2, ..., a_k$ such that for all $i \in I$: $1 \le a_i \le n$ and $$\sum_{i=1}^k a_i \ge 2(n!).$$ Show that there exists $J \subseteq I$ such that $$n! + 1 \ge \sum_{j \in J}a_j >\sqrt {n! + (n - 1)n}$$

Let be $ a,b,c $ positive integers.Prove that $ |a-b\sqrt{c}|<\frac{1}{2b} $ is true if and only if $ |a^{2}-b^{2}c|<\sqrt{c} $.

$ABCD$ is a convex quadrilateral, and the point $K$ is a point on side $AB$, where $\angle KDA=\angle BCD$, let $L$ be a point on the diagonal $AC$, where $KL$ is parallel to $BC$. Prove that $$\angle KDB=\angle LDC.$$ [i](tatari/nightmare)[/i]

In a convex quadrilateral $ABCD$, $\angle DAB=\angle BCD$ and the angle bisector of $\angle ABC$ passes through the middle point of $CD$. If $CD=3AD$, determine the ratio $\frac{AB}{BC}$.

$ABC$-triangle with circumcenter $O$ and $\angle B=30$. $BO$ intersect $AC$ at $K$. $L$ - midpoint of arc $OC$ of circumcircle $KOC$, that does not contains $K$. Prove, that $A,B,L,K$ are concyclic.

Find the sum of the squares of all values of $x$ that satisfy $\log_2 (x + 3) + \log_2 (2 - x) = 2$.

Given a prime $p$ and a real number $\lambda \in (0,1)$. Let $s$ and $t$ be positive integers such that $s \leqslant t < \frac{\lambda p}{12}$. $S$ and $T$ are sets of $s$ and $t$ consecutive positive integers respectively, which satisfy $$\left| \left\{ (x,y) \in S \times T : kx \equiv y \pmod p \right\}\right| \geqslant 1 + \lambda s.$$Prove that there exists integers $a$ and $b$ that $1 \leqslant a \leqslant \frac{1}{ \lambda}$, $\left| b \right| \leqslant \frac{t}{\lambda s}$ and $ka \equiv b \pmod p$.

Let $n\geq 3$ be integer. Given two pairs of $n$ cards numbered from 1 to $n$. Mix the $2n$ cards up and take the card 3 times every one card. Denote $X_1,\ X_2,\ X_3$ the numbers of the cards taken out in this order taken the cards. Find the probabilty such that $X_1<X_2<X_3$. Note that once a card taken out, it is not taken a back.

Given a 4×4 grid of points, the points at two opposite corners are denoted $A$ and $D$. We need to choose two other points $ B$ and $C$ such that the six pairwise distances of these four points are all distinct. (a) How many such quadruples of points are there? (b) How many such quadruples of points are non-congruent? (c) If each point is assigned a pair of coordinates $(x_i,y_i)$, prove that the sum of the expressions $|x_i-x_j |+|y_i-y_j|$ over all six pairs of points in a quadruple is constant.

Can it happen that the sum of digits of some positive integer $n$ equals $100$ while the sum of digits of number $n^3$ equals $100^3$?

(Game) In an Indian reservatory there are $15$ totem poles arranged according to the left figure. Silent Stream and Red Fire used to play the following game: In turns they stretch ropes between two-two poles in such a way that every stretched rope is parallel to a side of the big triangle and no rope can go along a pole that is already touched by another rope. Furthermore, if instead of a rope one can stretch out a straight line extension of the rope, then one should stretch out this extension. The one who cannot stretch out more rope according to the rules loses. [i]Win two games in a row against the organizers! You can decide that you want to start or to be the second player. The figure on the right depicts the first three steps of a game. First Silent Stream stretches the blue rope, then Red Fire stretches the red one, finally Silent Stream stretches the blue one.[/i] [img]https://cdn.artofproblemsolving.com/attachments/f/8/3b8b9e38a8a477da288566ecb26036bfc7e615.png[/img]

Let $n \ge 2$ be an integer and $f_1(x), f_2(x), \ldots, f_{n}(x)$ a sequence of polynomials with integer coefficients. One is allowed to make moves $M_1, M_2, \ldots $ as follows: in the $k$-th move $M_k$ one chooses an element $f(x)$ of the sequence with degree of $f$ at least $2$ and replaces it with $(f(x) - f(k))/(x-k)$. The process stops when all the elements of the sequence are of degree $1$. If $f_1(x) = f_2(x) = \cdots = f_n(x) = x^n + 1$, determine whether or not it is possible to make appropriate moves such that the process stops with a sequence of $n$ identical polynomials of degree 1.

Three different collinear points are given. What is the number of isosceles triangles such that these points are their circumcenter, incenter and excenter (in some order)?

If reals $a,b,c$ satisfy $a^2+b^2+c^2=3$ then prove that $|a|+|b|+|c|-abc\leq4$.

In a cube-shaped box with an edge equal to $5$, there are two balls. The radius of one of the balls is $2$. Find the radius of the other ball if one of the balls touches the base and two side faces of the cube, and the other ball touches the first ball, base and two other side faces of the cube.

Two boys start moving from the same point A on a circular track but in opposite directions. Their speeds are 5 ft. per second and 9 ft. per second. If they start at the same time and finish when they first me at the point A again, then the number of times they meet, excluding the start and finish, is $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 44 \qquad \textbf{(D)}\ \text{infinity} \qquad \textbf{(E)}\ \text{none of these}$

The arithmetic mean of the nine numbers in the set $ \{9,99,999,9999,...,999999999\}$ is a $ 9$-digit number $ M$, all of whose digits are distinct. The number $ M$ does not contain the digit $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

Which of the following numbers is a perfect square? $\textbf{(A) }4^45^56^6\qquad\textbf{(B) }4^45^66^5\qquad\textbf{(C) }4^55^46^6\qquad\textbf{(D) }4^65^46^5\qquad\textbf{(E) }4^65^56^4$

Let $ABC$ be an acute scalene triangle. The bisector of the angle $\angle ABC$ intersects the altitude $AD$ at $K$. Let $M$ be the projection of $B$ onto $CK$ and let $N$ be the intersection between $BM$ and $AK$. Let $T$ be a point on $AC$ such that $NT$ is parallel to $DM$. Prove that $BM$ is the bisector of the angle $\angle TBC$. [i]Melih Üçer, Turkey[/i]

An infinite sequence $x_1,x_2,\ldots$ of positive integers satisfies \[ x_{n+2}=\gcd(x_{n+1},x_n)+2006 \] for each positive integer $n$. Does there exist such a sequence which contains exactly $10^{2006}$ distinct numbers?

How many sequences of $0$s and $1$s of length $19$ are there that begin with a $0$, end with a $0$, contain no two consecutive $0$s, and contain no three consecutive $1$s? $\textbf{(A) }55\qquad\textbf{(B) }60\qquad\textbf{(C) }65\qquad\textbf{(D) }70\qquad\textbf{(E) }75$