What is the smallest number $n$ such that you can choose $n$ distinct odd integers $a_1, a_2,..., a_n$, none of them $1$, with $\frac{1}{a_1}+ \frac{1}{a_2}+ ...+ \frac{1}{a_n}= 1$?

Solve system of equations $$\begin{cases} x+\dfrac{x+y}{x^2+y^2}=1 \\ x+\dfrac{x-y}{x^2+y^2}=2 \end{cases}$$

Square $AXYZ$ is inscribed in equiangular hexagon $ABCDEF$ with $X$ on $\overline{BC}$, $Y$ on $\overline{DE}$, and $Z$ on $\overline{EF}$. Suppose that $AB=40$, and $EF=41(\sqrt{3}-1)$. What is the side-length of the square? [asy] size(200); defaultpen(linewidth(1)); pair A=origin,B=(2.5,0),C=B+2.5*dir(60), D=C+1.75*dir(120),E=D-(3.19,0),F=E-1.8*dir(60); pair X=waypoint(B--C,0.345),Z=rotate(90,A)*X,Y=rotate(90,Z)*A; draw(A--B--C--D--E--F--cycle); draw(A--X--Y--Z--cycle,linewidth(0.9)+linetype("2 2")); dot("$A$",A,W,linewidth(4)); dot("$B$",B,dir(0),linewidth(4)); dot("$C$",C,dir(0),linewidth(4)); dot("$D$",D,dir(20),linewidth(4)); dot("$E$",E,dir(100),linewidth(4)); dot("$F$",F,W,linewidth(4)); dot("$X$",X,dir(0),linewidth(4)); dot("$Y$",Y,N,linewidth(4)); dot("$Z$",Z,W,linewidth(4)); [/asy] $ \textbf{(A)}\ 29\sqrt{3} \qquad\textbf{(B)}\ \frac{21}{2}\sqrt{2}+\frac{41}{2}\sqrt{3}\qquad\textbf{(C)}\ 20\sqrt{3}+16$ $\textbf{(D)}\ 20\sqrt{2}+13\sqrt{3} \qquad\textbf{(E)}\ 21\sqrt{6}$

Determine all positive real numbers $ a$ such that there exists a positive integer $ n$ and sets $ A_1, A_2, \ldots, A_n$ satisfying the following conditions: (1) every set $ A_i$ has infinitely many elements; (2) every pair of distinct sets $ A_i$ and $ A_j$ do not share any common element (3) the union of sets $ A_1, A_2, \ldots, A_n$ is the set of all integers; (4) for every set $ A_i,$ the positive difference of any pair of elements in $ A_i$ is at least $ a^i.$

The base of the quadrangular pyramid $SABCD$ is a quadrilateral $ABCD$, the diagonals of which are perpendicular. The apex of the pyramid is projected at intersection point $O$ of the diagonals of the base. Prove that the feet of the perpendiculars drawn from point $O$ to the side faces of the pyramid lie on one circle.

Consider a sequence of positive integers $a_1, a_2, a_3, . . .$ such that for $k \geq 2$ we have $a_{k+1} =\frac{a_k + a_{k-1}}{2015^i},$ where $2015^i$ is the maximal power of $2015$ that divides $a_k + a_{k-1}.$ Prove that if this sequence is periodic then its period is divisible by $3.$

(a) Prove that a square with sides $1000$ divided into $31$ squares tiles, at least one of which has a side length less than $1$. (b) Show that a corresponding decomposition into $30$ squares is also possible. [i](Walther Janous)[/i]

There are $11$ empty boxes. In one move, a player can put one coin in each of some $10$ boxes. Two people play, taking turns. The winner is the player after whose move in one of the boxes there will be $21$ coins. Who has a winning strategy?

$2017$ engineers attend a conference. Any two engineers if they converse, converse with each other in either Chinese or English. No two engineers converse with each other more than once. It is known that within any four engineers, there was an even number of conversations and furthermore within this even number of conversations: i) At least one conversation is in Chinese. ii) Either no conversations are in English or the number of English conversations is at least that of Chinese conversations. Show that there exists $673$ engineers such that any two of them conversed with each other in Chinese.

For a point $O$ inside a triangle $ABC$, denote by $A_1,B_1, C_1,$ the respective intersection points of $AO, BO, CO$ with the corresponding sides. Let \[n_1 =\frac{AO}{A_1O}, n_2 = \frac{BO}{B_1O}, n_3 = \frac{CO}{C_1O}.\] What possible values of $n_1, n_2, n_3$ can all be positive integers?

[color=darkred]Determine all functions $ f : [0; \plus{} \infty) \rightarrow [0; \plus{} \infty)$, such that \[ f(x \plus{} y \minus{} z) \plus{} f(2\sqrt {xz}) \plus{} f(2\sqrt {yz}) \equal{} f(x \plus{} y \plus{} z)\] for all $ x,y,z \in [0; \plus{} \infty)$, for which $ x \plus{} y\ge z$.[/color]

Let $ABC$ be an acute triangle with $AB < AC$, and let $BE$ and $CF$ be the altitudes. Let the median $AM$ intersect $BE$ at point $P$, and let line $CP$ intersect $AB$ at point $D$ (see Figure 2). Prove that $DE \parallel BC$, and $AC$ is tangent to the circumcircle of $\vartriangle DEF$. [img]https://cdn.artofproblemsolving.com/attachments/f/7/bbad9f6019a77c6aa46c3a821857f06233cb93.png[/img]

Let $a$,$b$,$c$ be positive real numbers and $a+b+c+2=abc$. Prove that \[\frac{a}{b+1}+\frac{b}{c+1}+\frac{c}{a+1}\geq{2}. \]

Let $ABC$ be a triangle with $AB=3$ and $AC=4$. It is given that there does not exist a point $D$, different from $A$ and not lying on line $BC$, such that the Euler line of $ABC$ coincides with the Euler line of $DBC$. The square of the product of all possible lengths of $BC$ can be expressed in the form $m+n\sqrt p$, where $m$, $n$, and $p$ are positive integers and $p$ is not divisible by the square of any prime. Find $100m+10n+p$. Note: For this problem, consider every line passing through the center of an equilateral triangle to be an Euler line of the equilateral triangle. Hence, if $D$ is chosen such that $DBC$ is an equilateral triangle and the Euler line of $ABC$ passes through the center of $DBC$, then consider the Euler line of $ABC$ to coincide with "the" Euler line of $DBC$. [i]Proposed by Michael Ren[/i]

Given a positive integer number $k$, define the function $f$ on the set of all positive integer numbers to itself by \[f(n)=\begin{cases}1, &\text{if }n\le k+1\\ f(f(n-1))+f(n-f(n-1)), &\text{if }n>k+1\end{cases}\] Show that the preimage of every positive integer number under $f$ is a finite non-empty set of consecutive positive integers.

Let $ABC$ be a scalene triangle and let $P$ and $Q$ be two distinct points in its interior. Suppose that the angle bisectors of $\angle PAQ,\,\angle PBQ,$ and $\angle PCQ$ are the altitudes of triangle $ABC$. Prove that the midpoint of $\overline{PQ}$ lies on the Euler line of $ABC$. (The Euler line is the line through the circumcenter and orthocenter of a triangle.) [i]Proposed by Holden Mui[/i]

Each lattice point of the plane is labeled by a positive integer. Each of these numbers is the arithmetic mean of its four neighbors (above, below, left, right). Show that all the numbers are equal.

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Show that $L_{2n+1}+(-1)^{n+1}(n \geq 1)$ can be written as a product of three (not necessarily distinct) Fibonacci numbers.

Show that if $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{1}{a + b + c},$ then also \[\frac{1}{a^n} +\frac{1}{b^n} +\frac{1}{c^n} =\frac{1}{a^n + b^n + c^n},\] provided $n$ is an odd positive integer.

The trapezoid is composed of three conguent right isosceles triangles as shown in the figure. It is necessary to cut it into $4$ equal parts. How to do it? [img]https://cdn.artofproblemsolving.com/attachments/f/e/87b07ae823190f26b70bfa22824679a829e649.png[/img]

Let $ABC$ be an isosceles triangle with $AB = AC$. Let P be a point in the interior of $ABC$ such that $PB > PC$ and $\angle PBA = \angle PCB$. Let $M$ be the midpoint of the side $BC$. Let $O$ be the circumcenter of the triangle $APM$. Prove that $\angle OAC=2 \angle BPM$ .

Let $\sigma_k(n)$ be the sum of the $k^{th}$ powers of the divisors of $n$. For all $k \ge 2$ and all $n \ge 3$, we have that $$\frac{\sigma_k(n)}{n^{k+2}} (2020n + 2019)^2 > m.$$ Find the largest possible value of $m$.

Find all functions $f$ defined on all real numbers and taking real values such that \[f(f(y)) + f(x - y) = f(xf(y) - x),\] for all real numbers $x, y.$

Establish necessary and sufficient conditions on the constant $k$ for the existence of a continuous real valued function $f(x)$ satisfying $$f(f(x))=kx^9$$ for all real $x$.

The vertices of a given square are clockwise lettered $A,B,C,D$. On the side $AB$ is situated a point $E$ such that $AE = AB/3$. Starting from an arbitrarily chosen point $P_0$ on segment $AE$ and going clockwise around the perimeter of the square, a series of points $P_0, P_1, P_2, \ldots$ is marked on the perimeter such that $P_iP_{i+1} = AB/3$ for each $i$. It will be clear that when $P_0$ is chosen in $A$ or in $E$, then some $P_i$ will coincide with $P_0$. Does this possibly also happen if $P_0$ is chosen otherwise?