Consider any rectangular table having finitely many rows and columns, with a real number $a(r, c)$ in the cell in row $r$ and column $c$. A pair $(R, C)$, where $R$ is a set of rows and $C$ a set of columns, is called a [i]saddle pair[/i] if the following two conditions are satisfied: [list] [*] $(i)$ For each row $r^{\prime}$, there is $r \in R$ such that $a(r, c) \geqslant a\left(r^{\prime}, c\right)$ for all $c \in C$; [*] $(ii)$ For each column $c^{\prime}$, there is $c \in C$ such that $a(r, c) \leqslant a\left(r, c^{\prime}\right)$ for all $r \in R$. [/list] A saddle pair $(R, C)$ is called a [i]minimal pair[/i] if for each saddle pair $\left(R^{\prime}, C^{\prime}\right)$ with $R^{\prime} \subseteq R$ and $C^{\prime} \subseteq C$, we have $R^{\prime}=R$ and $C^{\prime}=C$. Prove that any two minimal pairs contain the same number of rows.

A chord divides the interior of a circle $k$ into two parts. Variable circles $k_1$ and $k_2$ are inscribed in these two parts, touching the chord at the same point. Show that the ratio of the radii of circles $k_1$ and $k_2$ is constant, i.e. independent of the tangency point with the chord.

A cyclic $n$-gon is given. The midpoints of all its sides are concyclic. The sides of the $n$-gon cut $n$ arcs of this circle lying outside the $n$-gon. Prove that these arcs can be coloured red and blue in such a way that the sum of the lengths of the red arcs is equal to the sum of the lengths of the blue arcs.

For how many positive integers $ n$ is $ n^2\minus{}3n\plus{}2$ a prime number? $ \textbf{(A)}\ \text{none} \qquad \textbf{(B)}\ \text{one} \qquad \textbf{(C)}\ \text{two} \qquad \textbf{(D)}\ \text{more than two, but finitely many}\\ \textbf{(E)}\ \text{infinitely many}$

Let $k,l$ be two given integers. Prove that there exist infinite many integers $m\ge k$ such that $\gcd\left(\binom{m}{k},l\right)=1$.

Let $ {\mathbb Q}^ \plus{}$ be the set of positive rational numbers. Construct a function $ f : {\mathbb Q}^ \plus{} \rightarrow {\mathbb Q}^ \plus{}$ such that \[ f(xf(y)) \equal{} \frac {f(x)}{y} \] for all $ x$, $ y$ in $ {\mathbb Q}^ \plus{}$.

In the following diagram, points $E, F, G, H, I$, and $J$ lie on a circle. The triangle $ABC$ has side lengths $AB = 6$, $BC = 7$, and $CA = 9$. The three chords have lengths $EF = 12$, $GH = 15$, and $IJ = 16$. Compute $6 \cdot AE + 7 \cdot BG + 9 \cdot CI$. [img]https://cdn.artofproblemsolving.com/attachments/2/7/661b3d6a0f0baac0cd3b8d57c4cd4c62eeab46.png[/img]

Let $ABCD$ be a convex quadrilateral, and let $P$, $Q$, $R$, and $S$ be points on the sides $AB$, $BC$, $CD$, and $DA$, respectively. Let the line segment $PR$ and $QS$ meet at $O$. Suppose that each of the quadrilaterals $APOS$, $BQOP$, $CROQ$, and $DSOR$ has an incircle. Prove that the lines $AC$, $PQ$, and $RS$ are either concurrent or parallel to each other.

For a rational number $r$, its *period* is the length of the smallest repeating block in its decimal expansion. for example, the number $r=0.123123123...$ has period $3$. If $S$ denotes the set of all rational numbers of the form $r=\overline{abcdefgh}$ having period $8$, find the sum of all elements in $S$.

The incircle of the triangle $ABC$ touches the sides $BC, CA$ and $AB$ in points $A_1, B_1$ and $C_1$ respectively. $C_1D$ is a diameter of the incircle. Finally, let $E$ be the intersection of the lines $B_1C_1$ and $A_1D$. Prove that the segments $CE$ and $CB_1$ have equal length.

Evaluate $ \int_0^1 \frac{(1\minus{}2x)e^{x}\plus{}(1\plus{}2x)e^{\minus{}x}}{(e^x\plus{}e^{\minus{}x})^3}\ dx.$

Baron Minchausen talked to a mathematician. Baron said that in his country from any town one can reach any other town by a road. Also, if one makes a circular trip from any town, one passes through an odd number of other towns. By this, as an answer to the mathematician’s question, Baron said that each town is counted as many times as it is passed through. Baron also added that the same number of roads start at each town in his country, except for the town where he was born, at which a smaller number of roads start. Then the mathematician said that baron lied. How did he conclude that?

Find all triples $(x, y, z)$ of nonnegative integers such that $$ x^5+x^4+1=3^y7^z $$

Given a triangle $ABC$ ($AC < BC$) with circumcircle $k$ and orthocenter $H$, let $W$ be any point on segment $CH$. The circle with diameter $CW$ intersects $k$ a second time at point $K$ and intersects sides $BC$ and $AC$ at points $M$ and $N$, respectively. The line $KW$ intersects segment $AB$ at point $L$. Prove that the circumcircle of triangle $MNL$ passes through a fixed point, independent of the choice of $W$.

For which positive integers $n$ is there an $n\times n$ matrix with integer entries such that every dot product of a row with itself is even, while every dot product of two different rows is odd?

Find the minimal value of the function \[\begin{array}{c}\ f(x) =\sqrt{15 - 12 \cos x} + \sqrt{4 -2 \sqrt 3 \sin x}+\sqrt{7-4\sqrt 3 \sin x} +\sqrt{10-4 \sqrt 3 \sin x - 6 \cos x}\end{array}\]

Find the sum of all positive integers $n$ for which $n^2-19n+99$ is a perfect square.

Let $f:(0,\infty)\to\mathbb R$ be a differentiable function. Assume that $$\lim_{x\to\infty}\left(f(x)+\frac{f'(x)}x\right)=0.$$Prove that $$\lim_{x\to\infty}f(x)=0.$$

Do there exist positive integers $m$ and $n$ such that: \[ 3n^2+3n+7=m^3 \]

In a right triangle, the length of one side is a prime and the lengths of the other side and the hypotenuse are integral. The ratio of the triangle perimeter and the incircle diameter is also an integer. Find all possible side lengths of the triangle.

Suppose that $$\frac{(\sqrt2)^5 + 1}{\sqrt2 + 1} \times \frac{2^5 + 1}{2 + 1} \times \frac{4^5 + 1}{4 + 1} \times \frac{16^5 + 1}{16 + 1} =\frac{m}{7 + 3\sqrt2}$$ for some integer $m$. How many $0$’s are in the binary representation of $m$? (For example, the number $20 = 10100_2$ has three $0$’s in its binary representation.)

Let $a_1, a_2, \ldots, a_n$ be positive numbers, $m_g = \sqrt[n]{(a_1a_2 \cdots a_n)}$ their geometric mean, and $m_a = \frac{(a_1 + a_2 + \cdots + a_n)}{n}$ their arithmetic mean. Prove that \[(1 + m_g)^n \leq (1 + a_1) \cdots(1 + a_n) \leq (1 + m_a)^n.\]

We glue together $990$ one inch cubes into a $9$ by $10$ by $11$ inch rectangular solid. Then we paint the outside of the solid. How many of the original $990$ cubes have just one of their sides painted?

Given $n$ points in the plane, show that the largest distance determined by these points cannot occur more than $n$ times.

What is the value of $a$ for which $\frac1{\log_2a}+\frac1{\log_3a}+\frac1{\log_4a}=1$? $\textbf{(A) }9\qquad\textbf{(B) }12\qquad\textbf{(C) }18\qquad\textbf{(D) }24\qquad\textbf{(E) }36$