Let $O$ be the centre of a circle and $A$ a fixed interior point of the circle different from $O$. Determine all points $P$ on the circumference of the circle such that the angle $OPA$ is a maximum. [asy] import graph; unitsize(2 cm); pair A, O, P; A = (0.5,0.2); O = (0,0); P = dir(80); draw(Circle(O,1)); draw(O--A--P--cycle); label("$A$", A, E); label("$O$", O, S); label("$P$", P, N); [/asy]

Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.

For each positive integer $n\leq 49$ we define the numbers $a_n = 3n+\sqrt{n^2-1}$ and $b_n=2(\sqrt{n^2+n}+\sqrt{n^2-n})$. Prove that there exist two integers $A,B$ such that \[ \sqrt{a_1-b_1}+\sqrt{a_2-b_2} + \cdots + \sqrt{a_{49}-b_{49}} = A+B\sqrt2. \]

Fill in numbers in the boxes below so that the sum of the entries in each three consecutive boxes is $2005$. What is the number that goes into the leftmost box? [asy] size(300); label("999",(2.5,.5)); label("888",(7.5,.5)); draw((0,0)--(9,0)); draw((0,1)--(9,1)); for (int i=0; i<=9; ++i) { draw((i,0)--(i,1)); } [/asy]

The intelligence quotient (IQ) of a country is defined as the average IQ of its entire population. It is assumed that the total population and individual IQs remain constant throughout. (a) (i) A group of people from country $A$ has emigrated to country $B$ . Show that it can happen that as a result , the IQs of both countries have increased. (ii) After this, a group of people from $B$, which may include immigrants from $A$, emigrates to $A$. Can it happen that the IQs of both countries will increase again? (b) A group of people from country $A$ has emigrated to country $B$, and a group of people from $B$ has emigrated to country $C$ . It is known that a s a result , the IQs o f all three countries have increased. After this, a group of people from $C$ emigrates to $B$ and a group of people from $B$ emigrates to $A$. Can it happen that the IQs of all three countries will increase again? (A Kanel, B Begun)

In the coordinate plane,the graps of functions $y=sin x$ and $y=tan x$ are drawn, along with the coordinate axes. Using compass and ruler, construct a line tangent to the graph of sine at a point above the axis, $Ox$, as well at a point below that axis (the line can also meet the graph at several other points)

Prove that there does not exist a natural number which, upon transfer of its initial digit to the end, is increased five, six or eight times.

Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.

A dart, thrown at random, hits a square target. Assuming that any two parts of the target of equal area are equall likely to be hit, find the probability that hte point hit is nearer to the center than any edge.

Determine the maximal value of $ k $, such that for positive reals $ a,b $ and $ c $ from inequality $ kabc >a^3+b^3+c^3 $ it follows that $ a,b $ and $ c $ are sides of a triangle.

A $3\times 3\times 3$ cube is made of 27 unit cube pieces. Each piece contains a lamp, which can be on or off. Every time a piece is pressed (the center piece cannot be pressed), the state of that piece and the pieces that share a face with it changes. Initially all lamps are off. Determine which of the following states are achievable: (1) All lamps are on. (2) All lamps are on except the central one. (3) Only the central lamp is on.

$$\int_0^1 x\ln(x^2)\ln(1+x)\,dx$$ [i]Proposed by Connor Gordon[/i]

$N\geq9$ distinct real numbers are written on a blackboard. All these numbers are nonnegative, and all are less than $1$. It happens that for very $8$ distinct numbers on the board, the board contains the ninth number distinct from eight such that the sum of all these nine numbers is integer. Find all values $N$ for which this is possible. [i](F. Nilov)[/i]

Find all integer solutions to the equation $x^2=y^2(x+y^4+2y^2)$ .

Jack plays a game in which he first rolls a fair six-sided die and gets some number $n$, then, he flips a coin until he flips $n$ heads in a row and wins, or he flips $n$ tails in a row in which case he rerolls the die and tries again. What is the expected number of times Jack must flip the coin before he wins the game.

Let $A$ and $B$ be given real numbers. Let the sum of real numbers $0\le x_1\le x_2\le\ldots \le x_n$ be $A$, and let the sum of real numbers $0\le y_1\le y_2\le \ldots\le y_n$ be $B$. Find the largest possible value of \[\sum_{i=1}^n (x_i-y_i)^2.\] [i]Proposed by Péter Csikvári, Budapest[/i]

Find all real number $x$ which could be represented as $x = \frac{a_0}{a_1a_2 . . . a_n} + \frac{a_1}{a_2a_3 . . . a_n} + \frac{a_2}{a_3a_4 . . . a_n} + . . . + \frac{a_{n-2}}{a_{n-1}a_n} + \frac{a_{n-1}}{a_n}$ , with $n, a_1, a_2, . . . . , a_n$ are positive integers and $1 = a_0 \leq a_1 < a_2 < . . . < a_n$

Is it possible to mark a diagonal on each little square on the surface of a Rubik 's cube so that one obtains a non-intersecting path? (S . Fomin, Leningrad)

$f$ is a continuous real-valued function such that $f(x+y)=f(x)f(y)$ for all real $x$, $y$. If $f(2)=5$, find $f(5)$.

Determine, with proof, all triples of real numbers $(x,y,z)$ satisfying the equations $$x^3+y+z=x+y^3+z=x+y+z^3=-xyz.$$

A semicircle has diameter $\overline{AD}$ with $AD = 30$. Points $B$ and $C$ lie on $\overline{AD}$, and points $E$ and $F$ lie on the arc of the semicircle. The two right triangles $\vartriangle BCF$ and $\vartriangle CDE$ are congruent. The area of $\vartriangle BCF$ is $m\sqrt{n}$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/b/c/c10258e2e15cab74abafbac5ff50b1d0fd42e6.png[/img]

Acute triangle $\triangle ABC$ has area $S$ and perimeter $L$. A point $P$ inside $\triangle ABC$ has $dist(P,BC)=1, dist(P,CA)=1.5, dist(P,AB)=2$. Let $BC \cap AP = D$, $CA \cap BP = E$, $AB \cap CP= F$. Let $T$ be the area of $\triangle DEF$. Prove the following inequality. $$ \left( \frac{AD \cdot BE \cdot CF}{T} \right)^2 > 4L^2 + \left( \frac{AB \cdot BC \cdot CA}{24S} \right)^2 $$

Let $ABC$ be an acute angles triangle with $O$ the center of the circumscribed circle. Point $Q$ lies on the circumscribed circle of $\vartriangle BOC$ so that $OQ$ is a diameter. Point $M$ lies on $CQ$ and point $N$ lies internally on line segment $BC$ so that $ANCM$ is a parallelogram. Prove that the circumscribed circle of $\vartriangle BOC$ and the lines $AQ$ and $NM$ pass through the same point.

Compute the sum $$\frac{\varphi(50!)}{\varphi(49!)}+ \frac{\varphi(51!)}{\varphi(50!)} + \dots + \frac{\varphi(100!)}{\varphi(99!)}$$ where $\varphi(n)$ returns the number of positive integers less than $n$ that are relatively prime to $n$. [i]Proposed by Andy Xu[/i]

$S$ be the set of all $2017^2$ lattice points $(x,y)$ with $x,y\in \{0\}\cup\{2^{0},2^{1},\cdots,2^{2015}\}$. A subset $X\subseteq S$ is called BQ if it has the following properties: (a) $X$ contains at least three points, no three of which are collinear. (b) One of the points in $X$ is $(0,0)$. (c) For any three distinct points $A,B,C \in X$, the orthocenter of $\triangle ABC$ is in $X$. (d) The convex hull of $X$ contains at least one horizontal line segment. Determine the number of BQ subsets of $S$. [i] Proposed by Vincent Huang [/i]