Let $I$ be the incenter of triangle $ABC$ and let $D$ be the midpoint of side $AB$. Prove that if the angle $\angle AOD$ is right, then $AB+BC=3AC$. [I]Proposed by S. Ivanov[/i]

Between any two cities of a country there is only one one-way road. Show that there is a city from that every other city can be reached directly or by going over only one intermediate city. [hide] I'm sure it was posted before but couldn't find it. [/hide]

For non negative reals $a,b$ we know that $a^2+a+b^2\ge a^4+a^3+b^4$. Prove that $$\frac{1-a^4}{a^2}\ge \frac{b^2-1}{b}$$

The circumradius of acute triangle $ABC$ is twice of the distance of its circumcenter to $AB$. If $|AC|=2$ and $|BC|=3$, what is the altitude passing through $C$? $ \textbf{(A)}\ \sqrt {14} \qquad\textbf{(B)}\ \dfrac{3}{7}\sqrt{21} \qquad\textbf{(C)}\ \dfrac{4}{7}\sqrt{21} \qquad\textbf{(D)}\ \dfrac{1}{2}\sqrt{21} \qquad\textbf{(E)}\ \dfrac{2}{3}\sqrt{14} $

Each of the $29$ people attending a party wears one of three different types of hats. Call a person [i]lucky[/i] if at least two of his friends wear different types of hats. Show that it is always possible to replace the hat of a person at this party with a hat of one of the other two types, in a way that the total number of lucky people is not reduced.

Consider all trapezoids in a coordinate plane with interior angles of $90^o, 90^o, 45^o$ and $135^o$ whose bases are parallel to a coordinate axis and whose vertices have integer coordinates. Define the [i]size [/i] of such a trapezoid as the total number of points with integer coordinates inside and on the boundary of the trapezoid. (a) How many pairwise non-congruent such trapezoids of size $2001$ are there? (b) Find all positive integers not greater than $50$ that do not appear as sizes of any such trapezoid.

Find all triples of reals $(x,y,z)$ satisfying: $$\begin{cases} \frac{1}{3} \min \{x,y\} + \frac{2}{3} \max \{x,y\} = 2017 \\ \frac{1}{3} \min \{y,z\} + \frac{2}{3} \max \{y,z\} = 2018 \\ \frac{1}{3} \min \{z,x\} + \frac{2}{3} \max \{z,x\} = 2019 \\ \end{cases}$$

For a non-empty finite set $A$ of positive integers, let $\text{lcm}(A)$ denote the least common multiple of elements in $A$, and let $d(A)$ denote the number of prime factors of $\text{lcm}(A)$ (counting multiplicity). Given a finite set $S$ of positive integers, and $$f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}.$$ Prove that, if $0 \le x \le 2$, then $-1 \le f_S(x) \le 0$.

A cubic function $f(x)$ satisfies the equation $\sin 3t=f(\sin t)$ for all real numbers $t$. Evaluate $\int_0^1 f(x)^2\sqrt{1-x^2}\ dx$.

Let $a_1,a_2,\dots,a_{2023}$ be positive integers such that [list=disc] [*] $a_1,a_2,\dots,a_{2023}$ is a permutation of $1,2,\dots,2023$, and [*] $|a_1-a_2|,|a_2-a_3|,\dots,|a_{2022}-a_{2023}|$ is a permutation of $1,2,\dots,2022$. [/list] Prove that $\max(a_1,a_{2023})\ge 507$.

Let $m,n$ be distinct positive integers. Prove that $$gcd(m,n) + gcd(m+1,n+1) + gcd(m+2,n+2) \le 2|m-n| + 1. $$ Further, determine when equality holds.

Let $p(1), p(2), \ldots, p(k)$ be all primes smaller than $m$, prove that \[\sum^{k}_{i=1} \frac{1}{p(i)} + \frac{1}{p(i)^2} > ln(ln(m)).\]

You can determine all 4-ples $(a,b, c,d)$ of real numbers, which solve the following equation system $\begin{cases} ab + ac = 3b + 3c \\ bc + bd = 5c + 5d \\ ac + cd = 7a + 7d \\ ad + bd = 9a + 9b \end{cases} $

Georg plays the following game. He chooses two positive integers $n$ and $k$. On an $n \times n$ - board where all the tiles are white, Georg paints k of the tiles black. Then he counts the number of black tiles in each row, forms the square of each of these n numbers and adds up the squares. He calls the result $S$. In the same way he counts the number of white tiles in each row, forms the square of each of these n numbers and adds up those squares. He calls the result $H$. Georg would like to achieve $S - H = 49$. Determine all possible values of n and k for which this is possible. Example: If Georg chooses $n = 5$ and$ k = 14$, he could for example paint the board as shown. [img]https://cdn.artofproblemsolving.com/attachments/f/2/d3c778f603f0a43c9aa877a4564734eab50058.png[/img] Then $S = 1^2 + 2^2 + 3^2 + 3^2 + 5^2 = 1 + 4 + 9 + 9 + 25 = 48$, $H = 4^2 + 3^2 + 2^2 + 2^2 + 0^2 = 16 + 9 + 4 + 4 + 0 = 33$, so in this case $S - H = 48 - 33 = 15$.

Solve the system of equations $$\begin{cases} (x+y)(x^2-y^2)=32 \\ (x-y)(x^2+y^2)=20 \end{cases}$$

At a strange party, each person knew exactly $22$ others. For any pair of people $X$ and $Y$ who knew each other, there was no other person at the party that they both knew. For any pair of people $X$ and $Y$ who did not know one another, there were exactly $6$ other people that they both knew. How many people were at the party?

Over each side of a cyclic quadrilateral erect a rectangle whose height is equal to the length of the opposite side. Prove that the centers of these rectangles form another rectangle.

For a positive integer, we define it's [i]set of exponents[/i] the unordered list of all the exponents of the primes, in it`s decomposition. For example, $18=2\cdot 3^{2}$ has it`s set of exponents $1,2$ and $300=2^{2}\cdot 3\cdot 5^{2}$ has it`s set of exponents $1,2,2$. There are given two arithmetical progressions $\big(a_{n}\big)_{n}$ and $\big(b_{n}\big)_{n}$, such that for any positive integer $n$, $a_{n}$ and $b_{n}$ have the same set of exponents. Prove that the progressions are proportional (that is, there is $k$ such that $a_{n}=kb_{n}$ for any $n$). [i]Proposed by A. Golovanov[/i]

Consider, on a plane, the triangle $ ABC, $ vectors $ \vec x,\vec y,\vec z, $ real variable $ \lambda >0 $ and $ M,N,P $ such that $$ \left\{\begin{matrix} \overrightarrow{AM}=\lambda\cdot\vec x\\\overrightarrow{AN}=\lambda\cdot\vec y \\\overrightarrow{AP}=\lambda\cdot\vec z \end{matrix}\right. . $$ Find the locus of the center of mass of $ MNP. $ [i]Dan Brânzei and Gheorghe Iurea[/i]

Find all functions ${ f : N \rightarrow N}$ (where ${N}$ is the set of the natural numbers and is assumed to contain ${0}$), such that ${f(x^2) - f(y^2) = f(x + y)f(x - y)}$ for all ${x, y \in N}$ with ${x \ge y}$.

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ that are relatively prime to $n$, and let $d(n)$ denote the number of positive integer divisors of $n$. For example, $\phi(6) = 2$ and $d(6) = 4$. Find the sum of all odd integers $n \le 5000$ such that $n \mid \phi(n) d(n)$. [i]Alex Zhu[/i]

Evaluate the integrals as follows. (1) $\int \frac{x^2}{2-x}\ dx$ (2) $\int \sqrt[3]{x^5+x^3}\ dx$ (3) $\int_0^1 (1-x)\cos \pi x\ dx$

Let $N$ be a positive integer. Let $R$ denote the smallest positive number that is the sum of $m$ terms $\sum^m_{i=1}{\pm \sqrt{a_i}}$, where each $a_i, i=1,\cdots, m$ is an integer not larger than $N$. Prove that \[R\le C\cdot N^{-m+\frac{3}{2}}\] for some positive real number $C$. [i]Proposed by Navid[/i] [i](Clarification: note that the constant is allowed to depend on $m$ but should be independent of $N$, i.e. the equation $R(m,N)\le C(m)\cdot N^{-m+\frac{3}{2}}$ should hold for all positive integers $N$)[/i]

Suppose $n$ and $r$ are nonnegative integers such that no number of the form $n^2+r-k(k+1) \text{ }(k\in\mathbb{N})$ equals to $-1$ or a positive composite number. Show that $4n^2+4r+1$ is $1$, $9$, or prime.

Find all triplets $ (x,y,z) $ of positive integers such that \[ x^y + y^x = z^y \]\[ x^y + 2012 = y^{z+1} \]