Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

Let $p \geqslant 5$ be a prime and $S = \left\{ 1, 2, \ldots, p \right\}$. Define $r(x,y)$ as follows: \[ r(x,y) = \begin{cases} y - x & y \geqslant x \\ y - x + p & y < x \end{cases}.\] For a nonempty proper subset $A$ of $S$, let $$f(A) = \sum_{x \in A} \sum_{y \in A} \left( r(x,y) \right)^2.$$A [i]good[/i] subset of $S$ is a nonempty proper subset $A$ satisfying that for all subsets $B \subseteq S$ of the same size as $A$, $f(B) \geqslant f(A)$. Find the largest integer $L$ such that there exists distinct good subsets $A_1 \subseteq A_2 \subseteq \ldots \subseteq A_L$. [i]Proposed by Bin Wang[/i]

Let $\triangle ABC$ be a triangle. On side $AB$ take points $K$ and $L$ such that $AK \;=\; LB \;<\;\tfrac12\,AB,$ on side $BC$ take points $M$ and $N$ such that $BM \;=\; NC \;<\;\tfrac12\,BC,$ and on side $CA$ take points $P$ and $Q$ such that $CP \;=\; QA \;<\;\tfrac12\,CA.$ Let $R \;=\; KN\;\cap\;MQ, \quad T \;=\; KN \cap LP, $ and $ D \;=\; NP \cap LM, \quad E \;=\; NP \cap KQ.$ Prove that the lines $DR, BE, CT$ are concurrent.

Several points and planes are given in the space. It is known that for any two of given points there exactly two planes containing them, and each given plane contains at least four of given points. Is it true that all given points are collinear?

Let $n$ be a given positive integer. Prove that there is no positive divisor $d$ of $2n^2$ such that $d^2n^2+d^3$ is a square of an integer.

What is the measurement in degrees of the angle formed by the minute and hour hands when a clock reads $12:12$?

find all $k$ distinct integers $a_1,a_2,...,a_k$ such that there exists an injective function $f$ from reals to themselves such that for each positive integer $n$ we have $$\{f^n(x)-x| x \in \mathbb{R} \}=\{a_1+n,a_2+n,...,a_k+n\}$$.

Let $ABCD$ and $A'B'C'D'$ be two arbitrary squares in the plane that are oriented in the same direction. Prove that the quadrilateral formed by the midpoints of $AA',BB',CC',DD'$ is a square.

Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that \[ m^2 + f(n) \mid mf(m) +n \] for all positive integers $m$ and $n$.

Let $H$ be the orthocenter of triangle $ABC$. The tangents to the circumcircles of triangles $CHB$ and $AHB$ at point $H$ meet $AC$ at points $A_1$ and $C_1$ respectively. Prove that $A_1H = C_1H$.

[b]p1.[/b] Compute $45\times 45 - 6$. [b]p2.[/b] Consecutive integers have nice properties. For example, $3$, $4$, $5$ are three consecutive integers, and $8$, $9$, $10$ are three consecutive integers also. If the sum of three consecutive integers is $24$, what is the smallest of the three numbers? [b]p3.[/b] How many positive integers less than $25$ are either multiples of $2$ or multiples of $3$? [b]p4.[/b] Charlotte has $5$ positive integers. Charlotte tells you that the mean, median, and unique mode of his five numbers are all equal to $10$. What is the largest possible value of the one of Charlotte's numbers? [b]p5.[/b] Mr. Meeseeks starts with a single coin. Every day, Mr. Meeseeks goes to a magical coin converter where he can either exchange $1$ coin for $5$ coins or exchange $5$ coins for $3$ coins. What is the least number of days Mr. Meeseeks needs to end with $15$ coins? [b]p6.[/b] Twelve years ago, Violet's age was twice her sister Holo's age. In $7$ years, Holo's age will be $13$ more than a third of Violet's age. $3$ years ago, Violet and Holo's cousin Rindo's age was the sum of their ages. How old is Rindo? [b]p7.[/b] In a $2 \times 3$ rectangle composed of $6$ unit squares, let $S$ be the set of all points $P$ in the rectangle such that a unit circle centered at $P$ covers some point in exactly $3$ of the unit squares. Find the area of the region $S$. For example, the diagram below shows a valid unit circle in a $2 \times 3$ rectangle. [img]https://cdn.artofproblemsolving.com/attachments/d/9/b6e00306886249898c2bdb13f5206ced37d345.png[/img] [b]p8.[/b] What are the last four digits of $2^{1000}$? [b]p9.[/b] There is a point $X$ in the center of a $2 \times 2 \times 2$ box. Find the volume of the region of points that are closer to $X$ than to any of the vertices of the box. [b]p10.[/b] Evaluate $\sqrt{37 \cdot 41 \cdot 113 \cdot 290 - 4319^2}$ [b]p11.[/b] (Estimation) A number is abundant if the sum of all its divisors is greater than twice the number. One such number is $12$, because $1+2+3+4+6+12 = 28 > 24$: How many abundant positive integers less than $20190$ are there? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P$ be a polynomial. Suppose that there exists a rational $q$ such that $P(m)=q^n$ for infinitely many integers $(m,n)$. Prove that $P(x)=c\cdot Q(x)^k$ for some integer constants $c$ and $k$ and irreducible polynomial $Q$ with rational coefficients. (Here, a polynomial is $\textit{irreducible}$ if it can't be factored into the product of non-constant polynomials with rational coefficients.) [i]Jason Lee[/i]

Prove that the set $\{2,2^2,\ldots,2^n,\ldots\}$ satisfies the following properties: [b](1)[/b] For every $a\in A, b\in\mathbb{N}$, if $b<2a-1$, then $b(b+1)$ isn't a multiple of $2a$; [b](2)[/b] For every positive integer $a\notin A,a\ne 1$, there exists a positive integer $b$, such that $b<2a-1$ and $b(b+1)$ is a multiple of $2a$.

Given an integer $n\geq2$, let $x_1<x_2<\cdots<x_n$ and $y_1<y_2<\cdots<y_n$ be positive reals. Prove that for every value $C\in (-2,2)$ (by taking $y_{n+1}=y_1$) it holds that $\hspace{122px}\sum_{i=1}^{n}\sqrt{x_i^2+Cx_iy_i+y_i^2}<\sum_{i=1}^{n}\sqrt{x_i^2+Cx_iy_{i+1}+y_{i+1}^2}$. [i]Proposed by Mirko Petrusevski[/i]

Let $(a_n)_{n\ge0}$ be a sequence of positive numbers that satisfy the relations $a_{i-1}a_{i+1}\le a_i^2$ for all $i\in\mathbb N$. For any integer $n>1$, prove the inequality $$\frac{a_0+\ldots+a_n}{n+1}\cdot\frac{a_1+\ldots+a_{n-1}}{n-1}\ge\frac{a_0+\ldots+a_{n-1}}n\cdot\frac{a_1+\ldots+a_n}n.$$

For which subsets $A\subset \mathbb R$ is it true that whenever $0\leq x_0 < x_1 < \cdots < x_n\leq 1$, $n=1,2, \ldots$, then there exist $y_j\in A$ numbers, such that $y_{j+1}-y_j>x_{j+1}-x_j$ for all $0\leq j < n$. (translated by Miklós Maróti)

(A.Akopyan, V.Dolnikov) Given a set of points inn the plane. It is known that among any three of its points there are two such that the distance between them doesn't exceed 1. Prove that this set can be divided into three parts such that the diameter of each part does not exceed 1.

Find the largest prime $p$ such that there exist positive integers $a,b$ satisfying $$p=\frac{b}{2}\sqrt{\frac{a-b}{a+b}}.$$

Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that $$f(x + f(y)) = f(x) + f(y)$$ for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all real numbers $x$ and $y$ satisfies, $$2+f(x)f(y)\leq xy+2f(x+y+1).$$

Circle $C_1$ has its center $O$ lying on circle $C_2$. The two circles meet at $X$ and $Y$. Point $Z$ in the exterior of $C_1$ lies on circle $C_2$ and $XZ=13$, $OZ=11$, and $YZ=7$. What is the radius of circle $C_1$? $ \textbf{(A)}\ 5\qquad\textbf{(B)}\ \sqrt{26}\qquad\textbf{(C)}\ 3\sqrt{3}\qquad\textbf{(D)}\ 2\sqrt{7}\qquad\textbf{(E)}\ \sqrt{30} $

A few (at least $5$) integers are put on a circle, such that each of them is divisible by the sum of its neighbors. If the sum of all numbers is positive, what is its minimal value?

Prove that there exist infinitely many pairwisely disjoint sets $A(1), A(2),...,A(2014)$ which are not empty, whose union is the set of positive integers and which satisfy the following condition: For arbitrary positive integers $a$ and $b$, at least two of the numbers $a$, $b$ and $GCD(a,b)$ belong to one of the sets $A(1), A(2),...,A(2014)$.

There is a large pile of cards. On each card one of the numbers $1$, $2$, $\cdots$, $n$ is written. It is known that the sum of all numbers of all the cards is equal to $k \cdot n!$ for some integer $k$. Prove that it is possible to arrange cards into $k$ stacks so that the sum of numbers written on the cards in each stack is equal to $n!$.

Evaluate \[\int_0^{\frac{\pi}{2}} \cos ^ {2004}x\cos 2004x\ dx\]