We're given the functions $f(x)=|x-1|-|x-2|$ and $g(x)=|x-3|$. a) Draw the graph of the function $f(x)$. b) Determine the area of the section enclosed by the functions $f(x)$ and $g(x)$.

Prove that there are infinitely many pairs $(a, b)$ of positive integers with the following properties: $\bullet$ $a+b$ divides $ab+1$, $\bullet$ $a-b$ divides $ab -1$, $\bullet$ $b > 2$ and $a > b\sqrt3 - 1$.

The sequence $L_1,\ L_2,\ L_3,\ \dots$ is defined by \[ L_1 = 1,\ \ L_2 = 3,\ \ L_n = L_{n - 1} + L_{n - 2}\textrm{ for }n > 2. \] Prove that $L_p - 1$ is divisible by $p$ if $p$ is prime.

Two positive integers $p,q \in \mathbf{Z}^{+}$ are given. There is a blackboard with $n$ positive integers written on it. A operation is to choose two same number $a,a$ written on the blackboard, and replace them with $a+p,a+q$. Determine the smallest $n$ so that such operation can go on infinitely.

A rook stands in a corner of an $n$ by $n$ chess board. For what $n$, moving alternately along horizontals and verticals, can the rook visit all the cells of the board and return to the initial corner after $n^2$ moves? (A cell is visited only if the rook stops on it, those that the rook “flew over” during the move are not counted as visited.) Proposed by A. Spivak

We call an even positive integer $n$ [i]nice[/i] if the set $\{1, 2, \dots, n\}$ can be partitioned into $\frac{n}{2}$ two-element subsets, such that the sum of the elements in each subset is a power of $3$. For example, $6$ is nice, because the set $\{1, 2, 3, 4, 5, 6\}$ can be partitioned into subsets $\{1, 2\}$, $\{3, 6\}$, $\{4, 5\}$. Find the number of nice positive integers which are smaller than $3^{2022}$.

[b]a)[/b] Determine all sequences of real numbers $ \left( x_n\right)_{n\in\mathbb{N}\cup\{ 0\}} $ that satisfy $ x_{n+2}+x_{n+1}=x_n, $ for any nonnegative integer $ n. $ [b]b)[/b] If $ y_k>0 $ and $ y_k^k=y_k+k, $ for all naturals $ k, $ calculate $ \lim_{n\to\infty }\frac{\ln n}{n\left( x_n-1\right)} . $

Two circles $O_1$ and $O_2$ intersect at points $A$ and $B$. Lines $\overline{AC}$ and $\overline{BD}$ are drawn such that $C$ is on $O_1$ and $D$ is on $O_2$ and $\overline{AC} \perp \overline{AB}$ and $\overline{BD} \perp \overline{AB}$. If minor arc $AB= 45$ degrees relative to $O_1$ and minor arc $AB= 60$ degrees relative to $O_2$ and the radius of $O_2 = 10$, the area of quadrilateral $CADB$ can be expressed in simplest form as $a + b\sqrt{k} + c\sqrt{\ell}$. Compute $a + b + c + k +\ell$.

Let $O, H$ be the circumcentor and the orthocenter of a scalene triangle $ABC$. Let $P$ be the reflection of $A$ w.r.t. $OH$, and $Q$ is a point on $\odot (ABC)$ such that $AQ, OH, BC$ are concurrent. Let $A'$ be a points such that $ABA'C$ is a parallelogram. Show that $A', H, P, Q$ are concylic. (ltf0501).

Prove that in every triangle the diameter of the incircle is not greater than the radius of the circumcircle.

Let $f:[0,1]\to\mathbb R$ be a continuously differentiable function such that $f(x_0)=0$ for some $x_0\in[0,1]$. Prove that $$\int^1_0f(x)^2dx\le4\int^1_0f’(x)^2dx.$$

A quadrilateral $ABCD$ without parallel sides is circumscribed around a circle with centre $O$. Prove that $O$ is a point of intersection of middle lines of quadrilateral $ABCD$ (i.e. barycentre of points $A,\,B,\,C,\,D$) iff $OA\cdot OC=OB\cdot OD$.

There is a standard deck of $52$ cards without jokers. The deck consists of four suits(diamond, club, heart, spade) which include thirteen cards in each. For each suit, all thirteen cards are ranked from “$2$” to “$A$” (i.e. $2, 3,\ldots , Q, K, A$). A pair of cards is called a “[i]straight flush[/i]” if these two cards belong to the same suit and their ranks are adjacent. Additionally, "$A$" and "$2$" are considered to be adjacent (i.e. "A" is also considered as "$1$"). For example, spade $A$ and spade $2$ form a “[i]straight flush[/i]”; diamond $10$ and diamond $Q$ are not a “[i]straight flush[/i]” pair. Determine how many ways of picking thirteen cards out of the deck such that all ranks are included but no “[i]straight flush[/i]” exists in them.

Let $ MN$ be a line parallel to the side $ BC$ of a triangle $ ABC$, with $ M$ on the side $ AB$ and $ N$ on the side $ AC$. The lines $ BN$ and $ CM$ meet at point $ P$. The circumcircles of triangles $ BMP$ and $ CNP$ meet at two distinct points $ P$ and $ Q$. Prove that $ \angle BAQ = \angle CAP$. [i]Liubomir Chiriac, Moldova[/i]

We have $ 2n\plus{}1$ elements in the commutative ring $ R$: \[ \alpha,\alpha_1,...,\alpha_n,\varrho_1,...,\varrho_n .\] Let us define the elements \[ \sigma_k\equal{}k\alpha \plus{} \sum_{i\equal{}1}^n \alpha_i\varrho_i^k .\] Prove that the ideal $ (\sigma_0,\sigma_1,...,\sigma_k,...)$ can be finitely generated. [i]L. Redei[/i]

Let $k$ be a circle with radius $r$ and $AB$ a chord of $k$ such that $AB > r$. Furthermore, let $S$ be the point on the chord $AB$ satisfying $AS = r$. The perpendicular bisector of $BS$ intersects $k$ in the points $C$ and $D$. The line through $D$ and $S$ intersects $k$ for a second time in point $E$. Show that the triangle $CSE$ is equilateral. [i]Proposed by Stefan Leopoldseder[/i]

p1. Given a set of $n$ the first natural number. If one of the numbers is removed, then the average number remaining is $21\frac14$ . Specify the number which is deleted. p2. Ipin and Upin play a game of Tic Tac Toe with a board measuring $3 \times 3$. Ipin gets first turn by playing $X$. Upin plays $O$. They must fill in the $X$ or $O$ mark on the board chess in turn. The winner of this game was the first person to successfully compose a sign horizontally, vertically, or diagonally. Determine as many final positions as possible, if Ipin wins in the $4$th step. For example, one of the positions the end is like the picture on the side. [img]https://cdn.artofproblemsolving.com/attachments/6/a/a8946f24f583ca5e7c3d4ce32c9aa347c7e083.png[/img] p3. Numbers $ 1$ to $10$ are arranged in pentagons so that the sum of three numbers on each side is the same. For example, in the picture next to the number the three numbers are $16$. For all possible arrangements, determine the largest and smallest values ​​of the sum of the three numbers. [img]https://cdn.artofproblemsolving.com/attachments/2/8/3dd629361715b4edebc7803e2734e4f91ca3dc.png[/img] p4. Define $$S(n)=\sum_{k=1}^{n}(-1)^{k+1}\,\, , \,\, k=(-1)^{1+1}1+(-1)^{2+1}2+...+(-1)^{n+1}n$$ Investigate whether there are positive integers $m$ and $n$ that satisfy $S(m) + S(n) + S(m + n) = 2011$ p5. Consider the cube $ABCD.EFGH$ with side length $2$ units. Point $A, B, C$, and $D$ lie in the lower side plane. Point $I$ is intersection point of the diagonal lines on the plane of the upper side. Next, make a pyramid $I.ABCD$. If the pyramid $I.ABCD$ is cut by a diagonal plane connecting the points $A, B, G$, and $H$, determine the volume of the truncated pyramid low part.

A positive integer is called a repunit, if it is written only by ones. The repunit with $n$ digits will be denoted as $\underbrace{{11\cdots1}}_{n}$ . Prove that: α) the repunit $\underbrace{{11\cdots1}}_{n}$is divisible by $37$ if and only if $n$ is divisible by $3$ b) there exists a positive integer $k$ such that the repunit $\underbrace{{11\cdots1}}_{n}$ is divisible by $41$ if $n$ is divisible by $k$

Let $C$ and $C'$ be two concentric circles of radii $r$ and $r'$ respectively. Determine how much the quotient $r'/r$ must be worth so that in the limited crown (annulus) through $C$ and $C'$ there are eight circles $C_i$ , $i = 1, . . . , 8$, which are tangent to $C$ and to $C'$ , and also that $C_i$ is tangent to $C_{i+1}$ for $i = 1, . . . ,7$ and $C_8$ tangent to $C_1$ .

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

If $a,b,c>0,a+b+c=1$,then: $\frac{1}{abc}+\frac{4}{a^{2}+b^{2}+c^{2}}\geq\frac{13}{ab+bc+ca}$

In an alphabet of $n$ letters, is $syllable$ is any ordered pair of two (not necessarily distinct) letters. Some syllables are considered $indecent$. A $word$ is any sequence, finite or infinite, of letters, that does not contain indecent syllables. Find the least possible number of indecent syllables for which infinite words do not exist.

Let $k,m,n$ be positive integers such that $n^m$ is divisible by $m^n$, and $m^k$ is divisible by $k^m$. [list=a] [*] Prove that $n^k$ is divisible by $k^n$. [*] Find an example of $k,m,n$ satisfying the above conditions, where all three numbers are distinct and bigger than 1. [/list]

A frog is jumping on $N$ stones which are numbered from $1$ to $N$ from left to right. The frog is jumping to the previous stone (to the left) with probability $p$ and is jumping to the next stone (to the right) with probability $1-p$. If the frog has jumped to the left from the leftmost stone or to the right from the rightmost stone, it will fall into the water. The frog is initially on the leftmost stone. If $p< \tfrac 13$, show that the frog will fall into the water from the rightmost stone with a probability higher than $\tfrac 12$.

Let $ a,\, b,\, c$ be side lengths of a triangle and $ a+b+c = 3$. Find the minimum of \[ a^{2}+b^{2}+c^{2}+\frac{4abc}{3}\]