Given is an acute triangle $ABC$. $M$ is an arbitrary point at the side $AB$ and $N$ is midpoint of $AC$. The foots of the perpendiculars from $A$ to $MC$ and $MN$ are points $P$ and $Q$. Prove that center of the circumcircle of triangle $PQN$ lies on the fixed line for all points $M$ from the side $AB$.

Let $ABCD$ be a quadrilateral inscribed in the circle $O$. For a point $E\in O$, its projections $K,L,M,N$ on the lines $DA,AB,BC,CD$, respectively, are considered. Prove that if $N$ is the orthocentre of the triangle $KLM$ for some point $E$, different from $A,B,C,D$, then this holds for every point $E$ of the circle.

For any positive integer $n$, let $f(n)$ be the number of possible choices of signs $+\ \text{or}\ - $ in the algebraic expression $\pm 1\pm 2\ldots \pm n$, such that the obtained sum is zero. Show that $f(n)$ satisfies the following conditions: a) $f(n)=0$ for $n=1\pmod{4}$ or $n=2\pmod{4}$. b) $2^{\frac{n}{2}-1}\le f(n)\le 2^n-2^{\lfloor\frac{n}{2}\rfloor+1}$, for $n=0\pmod{4}$ or $n=3\pmod{4}$. [i]Ioan Tomsecu[/i]

Prove that any positive real numbers a,b,c satisfy the inequlaity $$\frac{1}{(a+b)b}+\frac{1}{(b+c)c}+\frac{1}{(c+a)a}\ge \frac{9}{2(ab+bc+ca)}$$ I.Voronovich

The complete graph with 6 points and 15 edges has each edge colored red or blue. Show that we can find 3 points such that the 3 edges joining them are the same color.

Arithmetic progression $a_1, a_2, . . . , $ consisting of natural numbers is such that for any $n$ the product $a_n \cdot a_{n+31}$ is divisible by $2005$. Is it possible to say that all terms of the progression are divisible by $2005$?

Given the sequence $ 10^{\frac {1}{11}},10^{\frac {2}{11}},10^{\frac {3}{11}},\ldots,10^{\frac {n}{11}}$, the smallest value of $ n$ such that the product of the first $ n$ members of this sequence exceeds $ 100000$ is: $ \textbf{(A)}\ 7 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 11$

The function $f$ satisfies the functional equation \[f(x) +f(y) = f(x + y ) - xy - 1\] for every pair $x,~ y$ of real numbers. If $f( 1) = 1$, then the number of integers $n \neq 1$ for which $f ( n ) = n$ is $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }\text{infinite}$

[b]p1.[/b] A man is walking due east at $2$ m.p.h. and to him the wind appears to be blowing from the north. On doubling his speed to $4$ m.p.h. and still walking due east, the wind appears to be blowing from the nortl^eas^. What is the speed of the wind (assumed to have a constant velocity)? [b]p2.[/b] Prove that any triangle can be cut into three pieces which can be rearranged to form a rectangle of the same area. [b]p3.[/b] An increasing sequence of integers starting with $1$ has the property that if $n$ is any member of the sequence, then so also are $3n$ and $n + 7$. Also, all the members of the sequence are solely generated from the first nummber $1$; thus the sequence starts with $1,3,8,9,10, ...$ and $2,4,5,6,7...$ are not members of this sequence. Determine all the other positive integers which are not members of the sequence. [b]p4.[/b] Three prime numbers, each greater than $3$, are in arithmetic progression. Show that their common difference is a multiple of $6$. [b]p5.[/b] Prove that if $S$ is a set of at least $7$ distinct points, no four in a plane, the volumes of all the tetrahedra with vertices in $S$ are not all equal. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two circles intersect at points $P$ and $Q$. Point $A$ lies on the first circle, but outside the second. Lines $AP$ and $AQ$ intersect the second circle at points $B$ and $C$, respectively. Indicate the position of point $A$ at which triangle $ABC$ has the largest area. (D. Prokopenko)

Three line segments divide a triangle into five triangles. The area of these triangles is called $u, v, x,$ yand $z$, as in the figure. (a) Prove that $uv = yz$. (b) Prove that the area of the great triangle is at most $ \frac{xz}{y}$ [img]https://cdn.artofproblemsolving.com/attachments/9/4/2041d62d014cf742876e01dd8c604c4d38a167.png[/img]

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Find the product of the minimum and maximum values of $\frac{3x+1}{9x^2+6x+2}$.

Find all primes that can be written both as a sum and as a difference of two primes (note that $ 1$ is not a prime).

Pawns are arranged on an $8 \times 8$ chessboard such that: Each $2 \times 1$ or $1 \times 2$ rectangle has at least $1$ pawn; Each $7 \times 1$ or $1 \times 7$ rectangle has at least $1$ pair of adjacent pawns. What is the minimum number of pawns in such an arrangement?

The graphs of the equations \[ y=k, \qquad y=\sqrt{3}x+2k, \qquad y=-\sqrt{3}x+2k, \] are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.$ These 63 lines cut part of the plane into equilateral triangles of side $2/\sqrt{3}.$ How many such triangles are formed?

Consider the following two person game. A number of pebbles are situated on the table. Two players make their moves alternately. A move consists of taking off the table $x$ pebbles where $x$ is the square of any positive integer. The player who is unable to make a move loses. Prove that there are infinitely many initial situations in which the second player can win no matter how his opponent plays.

Find all complex numbers $a,b,c\in\mathbb{C}^*$ such that $$|a\overline{b}+b\overline{c}+c\overline{a}|=|a|^2+|b|^2+|c|^2.$$ [i]Mihai Opincariu[/i]

Given an integer $n \ge 2$, solve in real numbers the system of equations \begin{align*} \max\{1, x_1\} &= x_2 \\ \max\{2, x_2\} &= 2x_3 \\ &\cdots \\ \max\{n, x_n\} &= nx_1. \\ \end{align*}

Compute $$\left(20+\frac{1}{23}\right)\cdot\left(23+\frac{1}{20}\right)-\left(20-\frac{1}{23}\right)\cdot\left(23-\frac{1}{20}\right)$$ [i]Proposed by Andy Xu[/i]

The integers from $1$ to $9$ are arranged in a $3\times3$ grid. The rows and columns of the grid correspond to $6$ three-digit numbers, reading rows from left to right, and columns from top to bottom. Compute the least possible value of the largest of the $6$ numbers.

Determine all real numbers $a$ such that the equation: $$x^8+ax^4+1=0$$ have four real roots that form an arithmetic progression.

If $\frac{4^x}{2^{x+y}}=8$ and $\frac{9^{x+y}}{3^{5y}}=243$, $x$ and $y$ are real numbers, then $xy$ equals: $\text{(A)} \ \frac{12}{5} \qquad \text{(B)} \ 4 \qquad \text{(C)} \ 6 \qquad \text{(D)} \ 12 \qquad \text{(E)} \ -4$

For each integer $n \geq 2$, let $F(n)$ denote the greatest prime factor of $n$. A [i]strange pair[/i] is a pair of distinct primes $p$ and $q$ such that there is no integer $n \geq 2$ for which $F(n)F(n+1)=pq$. Prove that there exist infinitely many strange pairs.

For which values of n does there exist a polyhedron having $n$ edges?