Alice is stacking balls on the ground in three layers using two sizes of balls: small and large. All small balls are the same size, as are all large balls. For the first layer, she uses $6$ identical large balls $A, B, C, D, E$, and $F$ all touching the ground and so that $D, E, F$ touch each other, A touches $E$ and $F$, $B$ touches $D$ and $F$, and $C$ touches $D$ and $E$. For the second layer, she uses $3$ identical small balls, $G, H$, and $I$; $G$ touches $A, E$, and $F, H$ touches $B, D$, and $F$, and $I$ touches $C, D$, and $E$. Obviously, the small balls do not intersect the ground. Finally, for the top layer, she uses one large ball that touches $D, E, F, G, H$, and $I$. If the large balls have volume $2015$, the sum of the volumes of all the balls in the pyramid can be written in the form $a\sqrt{b}+c$ for integers $a, b, c$ where no integer square larger than $1$ divides $b$. What is $a + b + c$? (This diagram may not have the correct scaling, but just serves to clarify the layout of the problem.) [asy] size(6cm); pair A, B, C, D, E, F; A = (0,0); F = (1,0); B = (2,0); E = rotate(60, A)*F; D = F + E; C = rotate(60, A)*B; draw(Circle(A, 0.5), mediumblue); draw(Circle(B, 0.5), mediumblue); draw(Circle(C, 0.5), mediumblue); draw(Circle(D, 0.5), mediumblue); draw(Circle(E, 0.5), mediumblue); draw(Circle(F, 0.5), mediumblue); pair G = (E+A+F)/3; pair I = (C+E+D)/3; pair H = (D+B+F)/3; draw(Circle(G, 0.25), mediumblue); draw(Circle(I, 0.25), mediumblue); draw(Circle(H, 0.25), mediumblue); label("A", A, fontsize(10pt)); label("B", B, fontsize(10pt)); label("C", C, fontsize(10pt)); label("D", D, fontsize(10pt)); label("E", E, fontsize(10pt)); label("F", F, fontsize(10pt)); label("G", G, fontsize(5pt)); label("I", I, fontsize(5pt)); label("H", H, fontsize(5pt)); label("Figure 1: The projection of the balls onto the ground", (1,-1), fontsize(10pt)); [/asy]

The cost of $1000$ grams of chocolate is $x$ dollars and the cost of $1000$ grams of potatoes is $y$ dollars, the numbers $x$ and $y$ are positive integers and have not more than $2$ digits. Mother said to Maria to buy $200$ grams of chocolate and $1000$ grams of potatoes that cost exactly $N$ dollars. Maria got confused and bought $1000$ grams of chocolate and $200$ grams of potatoes that cost exactly $M$ dollars ($M >N$). It turned out that the numbers $M$ and $N$ have no more than two digits and are formed of the same digits but in a different order. Find $x$ and $y$.

There is a set of $2n$ chips of $n$ different colors, two chips of each color. The chips are randomly placed in a row. Prove that the probability that there are two adjacent chips of the same color in a row is greater than $1/2$. [i]From the folklore[/i]

Find all pairs $(n, p)$ that satisfy the following condition, where $n$ is a positive integer and $p$ is a prime number. [b]Condition)[/b] $2n-1$ is a divisor of $p-1$ and $p$ is a divisor of $4n^2+7$.

[b]9.[/b] Let $A_1, \dots , A_n$ and $B$ be ideals of an assoticative ring $R$ such that $B$ is contained in the set-union of the ideals $A_i$($i=1, \dots , n$) but not contained in the union of any $n-1$ of the ideals $A_i$. Show that, for some positive integer $k$, $B_k$ is contained in the intersection of the ideals $A_i$. [b](A. 19)[/b]

$n\geq 2$ is a given integer. For two permuations $(\alpha_1,\cdots,\alpha_n)$ and $(\beta_1,\cdots,\beta_n)$ of $1,\cdots,n$, consider $n\times n$ matrix $A= \left(a_{ij} \right)_{1\leq i,j\leq n}$ defined by $a_{ij} = (1+\alpha_i \beta_j )^{n-1}$. Find every possible value of $\det(A)$.

[asy] size(2.5inch); pair A, B, C, E, F, G; A = (0,3); B = (-1,0); C = (3,0); E = (0,0); F = (1,2); G = intersectionpoint(B--F,A--E); draw(A--B--C--cycle); draw(A--E); draw(B--F); label("$A$",A,N); label("$B$",B,W); label("$C$",C,dir(0)); label("$E$",E,S); label("$F$",F,NE); label("$G$",G,SE); //Credit to chezbgone2 for the diagram[/asy] In triangle $ABC$, point $F$ divides side $AC$ in the ratio $1:2$. Let $E$ be the point of intersection of side $BC$ and $AG$ where $G$ is the midpoints of $BF$. The point $E$ divides side $BC$ in the ratio $\textbf{(A) }1:4\qquad\textbf{(B) }1:3\qquad\textbf{(C) }2:5\qquad\textbf{(D) }4:11\qquad \textbf{(E) }3:8$

Let $P(x)$ and $Q(x)$ be polynomials of degree $p$ and $q$ respectively such that every coefficient is $1$ or $2023$. If $P(x)$ divides $Q(x)$, prove that $p+1$ divides $q+1$.

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.