Let $ f : \mathbb{N} \mapsto \mathbb{N}$ be such that [b](i)[/b] $ f$ is strictly increasing; [b](ii)[/b] $ f(mn) \equal{} f(m)f(n) \quad \forall m, n \in \mathbb{N};$ and [b](iii)[/b] if $ m \neq n$ and $ m^n \equal{} n^m,$ then $ f(m) \equal{} n$ or $ f(n) \equal{} m.$ Determine $ f(30).$

Let $ ABC$ be triangle, $ I$ its in-center; $ A_1,B_1,C_1$ be the reflections of $ I$ in $ BC, CA, AB$ respectively. Suppose the circum-circle of triangle $ A_1B_1C_1$ passes through $ A$. Prove that $ B_1,C_1,I,I_1$ are concylic, where $ I_1$ is the in-center of triangle $ A_1,B_1,C_1$.

Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$. [i]Proposed by Evan Chen[/i]

Inside the regular $n$ -gon $M$ with side $a$ there are $n$ equal circles so that each touches two adjacent sides of the polygon $M$ and two other circles. Inside the formed "star", which is bounded by arcs, these $n$ equal circles are reconstructed so that each touches the two adjacent circles built in the previous step, and two more newly built circles. This process will take $k$ steps. Find the area $S_n (k)$ of the "star", which is formed in the center of the polygon $M$. Consider the spatial analogue of this problem.

We have a board of $ 2011 \times 2011$, divided by lines parallel to the edges into $1 \times 1$ squares. Manuel, Reinaldo and Jorge (at that time order) play to form squares with vertices at the vertices of the grid. The one who forms the last possible square wins, so that its sides do not cut the sides of any unit square. Who can be sure that he will win?

A half-circle of diameter $EF$ is placed on the side $BC$ of a triangle $ABC$ and it is tangent to the sides $AB$ and $AC$ in the points $Q$ and $P$ respectively. Prove that the intersection point $K$ between the lines $EP$ and $FQ$ lies on the altitude from $A$ of the triangle $ABC$. [i]Albania[/i]

A bean packing plant has a machine that puts a certain amount of beans into bags and then puts a certain amount of bags into boxes, which are then shipped to customers. One day, the machine broke down and the first n bags came out empty, the next $n$ bags came out with $1$ bean, the next $n$ bags came out with $2$ beans,..., and the last $n$ bags came out with $2006$ beans. To provide each customer with the agreed quantity of bags of beans, the person responsible for the unit intends to distribute the bags among the $2007$ boxes that day so that all boxes contain the same number of bags and all boxes contain the same number. number of beans. For what values of $n$ is this possible?

Prove that the bisectors of the angles of a rectangle, extended to their mutual intersection, form a square.

A triangle has side lengths 10, 10, and 12. A rectangle has width 4 and area equal to the area of the triangle. What is the perimeter of this rectangle? $ \textbf{(A)}\ 16\qquad\textbf{(B)}\ 24\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 36$

Given that $x$ is a real number, find the minimum value of $f(x)=|x+1|+3|x+3|+6|x+6|+10|x+10|.$ [i]Proposed by Yannick Yao[/i]

Find all real numbers $x$ which satisfied $|2x+1|+|x-1|=2-x$ .

[b]p25.[/b] Compute: $$\frac{ \sum^{\infty}_{i=0}\frac{(2\pi)^{4i+1}}{(4i+1)!}}{\sum^{\infty}_{i=0}\frac{(2\pi)^{4i+1}}{(4i+3)!}}$$ [b]p26.[/b] Suppose points $A, B, C, D$ lie on a circle $\omega$ with radius $4$ such that $ABCD$ is a quadrilateral with $AB = 6$, $AC = 8$, $AD = 7$. Let $E$ and $F$ be points on $\omega$ such that $AE$ and $AF$ are respectively the angle bisectors of $\angle BAC$ and $\angle DAC$. Compute the area of quadrilateral $AECF$. [b]p27.[/b] Let $P(x) = x^2 - ax + 8$ with a a positive integer, and suppose that $P$ has two distinct real roots $r$ and $s$. Points $(r, 0)$, $(0, s)$, and $(t, t)$ for some positive integer t are selected on the coordinate plane to form a triangle with an area of $2021$. Determine the minimum possible value of $a + t$. [b]p28.[/b] A quartic $p(x)$ has a double root at $x = -\frac{21}{4}$ , and $p(x) - 1344x$ has two double roots each $\frac14$ less than an integer. What are these two double roots? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]5/1/32.[/b] Find all pairs of rational numbers $(a, b)$ such that $0 < a < b$ and $a^a = b^b$.

Prove that the function $ f:\mathbb{R}\longrightarrow\mathbb{R} , f(x)=\text{arcsin} \frac{2x}{1+x^2} $ admits primitives and describe a primitive of it.

Let $\mathbb{Z}_{\ge 0}$ be the set of all nonnegative integers. Find all the functions $f: \mathbb{Z}_{\ge 0} \rightarrow \mathbb{Z}_{\ge 0} $ satisfying the relation \[ f(f(f(n))) = f(n+1 ) +1 \] for all $ n\in \mathbb{Z}_{\ge 0}$.

For how many integer values of $m$, (i) $1\le m \le 5000$ (ii) $[\sqrt{m}] =[\sqrt{m+125}]$ Note: $[x]$ is the greatest integer function

A car has a 4-digit integer price, which is written digitally. (so in digital numbers, like on your watch probably) While the salesmen isn't watching, the buyer turns the price upside down and gets the car for 1626 less. How much did the car initially cost?

A $3\times 3\times 3$ cube is made of $1\times 1\times 1$ cubes glued together. What is the maximal number of small cubes one can remove so the remaining solid has the following features: 1) Projection of this solid on each face of the original cube is a $3\times 3$ square, 2) The resulting solid remains face-connected (from each small cube one can reach any other small cube along a chain of consecutive cubes with common faces).

All perfect squares, and all perfect squares multiplied by two, are written in a row in increasing order. let $f(n)$ be the $n$-th number in this sequence. (For instance, $f(1)=1,f(2)=2,f(3)=4,f(4)=8$.) Is there an integer $n$ such that all the numbers \[f(n),f(2n),f(3n),\dots,f(10n^2)\] are perfect squares?

Let $ABCD$ be a square. On the segments $AB$, $BC$, $CD$ and $DA$, choose points $E, F, G$ and $H$, respectively, such that $AE = BF = CG = DH$. Let $P$ be the intersection point of $AF$ and $DE$, $Q$ be the intersection point of $BG$ and $AF$, $R$ the intersection point of $CH$ and $BG$, and $S$ the point of intersection of $DE$ and $CH$. Prove that $PQRS$ is a square.

Construct a square on one side of an equilateral triangle. One on non-adjacent side of the square, construct a regular pentagon, as shown. One a non-adjacent side of the pentagon, construct a hexagon. Continue to construct regular polygons in the same way, until you construct an octagon. How many sides does the resulting polygon have? [asy] defaultpen(linewidth(0.6)); pair O=origin, A=(0,1), B=A+1*dir(60), C=(1,1), D=(1,0), E=D+1*dir(-72), F=E+1*dir(-144), G=O+1*dir(-108); draw(O--A--B--C--D--E--F--G--cycle); draw(O--D, dashed); draw(A--C, dashed);[/asy] $\textbf{(A)} 21 \qquad \textbf{(B)} 23 \qquad \textbf{(C)} 25 \qquad \textbf{(D)} 27 \qquad \textbf{(E)} 29 $

Given circle $\omega$ and point $D$ outside this circle. Find the following points $A, B$ and $C$ on the circle $\omega$ so that the $ABCD$ quadrilateral is convex and has the maximum possible area. Justify your answer.

Show that the length of a cycle that contains every edge of a connected graph is at most the sum between the vertices and nodes of the graph, minus $ 1. $

Let $a_n$ be the number of permutations $(x_1, x_2, \dots, x_n)$ of the numbers $(1,2,\dots, n)$ such that the $n$ ratios $\frac{x_k}{k}$ for $1\le k\le n$ are all distinct. Prove that $a_n$ is odd for all $n\ge 1$. [i]Proposed by Richard Stong[/i]

Let $a_1<a_2$ be two given integers. For any integer $n\ge 3$, let $a_n$ be the smallest integer which is larger than $a_{n-1}$ and can be uniquely represented as $a_i+a_j$, where $1\le i<j\le n-1$. Given that there are only a finite number of even numbers in $\{a_n\}$, prove that the sequence $\{a_{n+1}-a_{n}\}$ is eventually periodic, i.e. that there exist positive integers $T,N$ such that for all integers $n>N$, we have \[a_{T+n+1}-a_{T+n}=a_{n+1}-a_{n}.\]