Let $ABC$ be an acute-angled triangle inscribed in a circle $k$. It is given that the tangent from $A$ to the circle meets the line $BC$ at point $P$. Let $M$ be the midpoint of the line segment $AP$ and $R$ be the second intersection point of the circle $k$ with the line $BM$. The line $PR$ meets again the circle $k$ at point $S$ different from $R$. Prove that the lines $AP$ and $CS$ are parallel.

Determine the number of positive integers $N = \overline{abcd}$, with $a, b, c, d$ nonzero digits, which satisfy $(2a -1) (2b -1) (2c- 1) (2d - 1) = 2abcd -1$.

Let $[ABCD]$ be a parallelogram and $P$ a point between $C$ and $D$. The line parallel to $AD$ that passes through $P$ intersects the diagonal $AC$ in $Q$. Knowing that the area of $[PBQ]$ is $2$ and the area of $[ABP]$ is $6$, determine the area of $[PBC]$. [img]https://cdn.artofproblemsolving.com/attachments/0/8/664a00020065b7ad6300a062613fca4650b8d0.png[/img]

Find all functions $f : R \to R$ satisfying the conditions: 1. $f (x + 1) \ge f (x) + 1$ for all $x \in R$ 2. $f (x y) \ge f (x)f (y)$ for all $x, y \in R$

To satisfy the equation $\frac{a+b}{a}=\frac{b}{a+b}$, $a$ and $b$ must be: $ \textbf{(A)}\ \text{both rational} \qquad\textbf{(B)}\ \text{both real but not rational} \qquad\textbf{(C)}\ \text{both not real}\qquad$ $\textbf{(D)}\ \text{one real, one not real}\qquad\textbf{(E)}\ \text{one real, one not real or both not real} $

Prove that there exists a number $\alpha$ such that for any triangle $ABC$ the inequality \[ \max(h_A,h_B,h_C)\le \alpha\cdot\min(m_A,m_B,m_C)\] where $h_A,h_B,h_C$ denote the lengths of the altitudes and $m_A,m_B,m_C$ denote the lengths of the medians. Find the smallest possible value of $\alpha$.

In rectangular coordinate system, define two sequences of points: $(A_n)$ on the positive half of the $y$-axis and $(B_n)$ on the curve $y=\sqrt{2x}(x\geq0)$ satisfy that $|OA_n|=|OB_n|=\frac{1}{n}$. $a_n$ is the $x$-intercept of line $A_nB_n$, and the $x$-axis of $B_n$ is $b_n$, $n\in\mathbb{Z}_+$. Prove: [b](a)[/b] $a_n>a_{n+1}>4,n\in\mathbb{Z}_+$; [b](b)[/b] There exists $n_0\in\mathbb{Z}_+$, such that $\forall n>n_0$, $\frac{b_2}{b_1}+\frac{b_3}{b_2}+\cdots +\frac{b_n}{b_{n-1}}+\frac{b_{n+1}}{b_n}<n-2004$.

Let convex quadrilateral $ ABCD$ be inscribed in a circle centers at $ O.$ The opposite sides $ BA,CD$ meet at $ H$, the diagonals $ AC,BD$ meet at $ G.$ Let $ O_{1},O_{2}$ be the circumcenters of triangles $ AGD,BGC.$ $ O_{1}O_{2}$ intersects $ OG$ at $ N.$ The line $ HG$ cuts the circumcircles of triangles $ AGD,BGC$ at $ P,Q$, respectively. Denote by $ M$ the midpoint of $ PQ.$ Prove that $ NO \equal{} NM.$

Find all integers $x$ and prime numbers $p$ satisfying $x^8 + 2^{2^x+2} = p$.

For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Prove that if the four faces of a tetrahedron are of the same area they are equal.

Ten points are marked in the plane so that no three of them lie on the same straight line. All points are connected with segments.Each of these segments is painted one of the $k$ colors. For what positive integer $k$ ($1 \le k \le 5$) is it possible to paint the segments so that for any $k$ of the given $10$ points there are $k$ segments with the ends at these $k$ points, all of these segments being painted $k$ different colors ? (E. Barabanov)

Let $ABC$ be an equilateral triangle and $D$, $E$ points on the sides $[AB]$ and $[AC]$ respectively. If $DF$, $EF$ (with $F\in AE$, $G\in AD$) are the interior angle bisectors of the angles of the triangle $ADE$, prove that the sum of the areas of the triangles $DEF$ and $DEG$ is at most equal with the area of the triangle $ABC$. When does the equality hold? [i]Greece[/i]

Given $n(\geq 3)$ distinct points in the plane, no three of which are on the same straight line, prove that there exists a simple closed polygon with these points as vertices.

The kingdom of Pinguinia has various cities and streets, the latter being all one-way streets always run between exactly two cities, so there are no intermediate stops. Every city has exactly two streets that lead out of it and exactly two that lead into it. Prove that the streets can be divided into black and white streets so that exactly one exit of each city is black and one is white and exactly one white and one black entrance in each city.

[b]p1.[/b] Find the largest possible number of consecutive $9$’s in which an integer between $10,000,000$ and $13,371,337$ can end. For example, $199$ ends in two $9$’s, while $92,999$ ends in three $9$’s. [b]p2.[/b] Let $ABCD$ be a square of side length $2$. Equilateral triangles $ABP$, $BCQ$, $CDR$, and $DAS$ are constructed inside the square. Compute the area of quadrilateral $PQRS$. [b]p3.[/b] Evaluate the expression $7 \cdot 11 \cdot 13 \cdot 1003 - 3 \cdot 17 \cdot 59 \cdot 331$. [b]p4.[/b] Compute the number of positive integers $c$ such that there is a non-degenerate obtuse triangle with side lengths $21$, $29$, and $c$. [b]p5.[/b] Consider a $5\times 5$ board, colored like a chessboard, such that the four corners are black. Determine the number of ways to place $5$ rooks on black squares such that no two of the rooks attack one another, given that the rooks are indistinguishable and the board cannot be rotated. (Two rooks attack each other if they are in the same row or column.) [b]p6.[/b] Let $ABCD$ be a trapezoid of height $6$ with bases $AB$ and $CD$. Suppose that $AB = 2$ and $CD = 3$, and let $F$ and $G$ be the midpoints of segments $AD$ and $BC$, respectively. If diagonals $AC$ and $BD$ intersect at point $E$, compute the area of triangle $FGE$. [b]p7.[/b] A regular octahedron is a solid with eight faces that are congruent equilateral triangles. Suppose that an ant is at the center of one face of a regular octahedron of edge length $10$. The ant wants to walk along the surface of the octahedron to reach the center of the opposite face. (Two faces of an octahedron are said to be opposite if they do not share a vertex.) Determine the minimum possible distance that the ant must walk. [b]p8.[/b] Let $A_1A_2A_3$, $B_1B_2B_3$, $C_1C_2C_3$, and $D_1D_2D_3$ be triangles in the plane. All the sides of the four triangles are extended into lines. Determine the maximum number of pairs of these lines that can meet at $60^o$ angles. [b]p9.[/b] For an integer $n$, let $f_n(x)$ denote the function $f_n(x) =\sqrt{x^2 - 2012x + n}+1006$. Determine all positive integers $a$ such that $f_a(f_{2012}(x)) = x$ for all $x \ge 2012$. [b]p10.[/b] Determine the number of ordered triples of integers $(a, b, c)$ such that $(a + b)(b + c)(c + a) = 1800$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].