[b]p1.[/b] If $P$ is a (convex) polygon, a triangulation of $P$ is a set of line segments joining pairs of corners of $P$ in such a way that $P$ is divided into non-overlapping triangles, each of which has its corners at corners of $P$. For example, the following are different triangulations of a square. (a) Prove that if $P$ is an $n$-gon with $n > 3$, then every triangulation of $P$ produces at least two triangles $T_1$, $T_2$ such that two of the sides of $T_i$, $i = 1$ or $2$ are also sides of $P$. (b) Find the number of different possible triangulations of a regular hexagon. [img]https://cdn.artofproblemsolving.com/attachments/9/d/0f760b0869fafc882f293846c05d182109fb78.png[/img] [b]p2.[/b] There are $n$ students, $n \ge 2$, and $n + 1$ cubical cakes of volume $1$. They have the use of a knife. In order to divide the cakes equitably they make cuts with the knife. Each cut divides a cake (or a piece of a cake) into two pieces. (a) Show that it is possible to provide each student with a volume $(n + 1)/n$ of a cake while making no more than $n - 1$ cuts. (b) Show that for each integer $k$ with $2 \le k \le n$ it is possible to make $n - 1$ cuts in such a way that exactly $k$ of the $n$ students receive an entire (uncut) cake in their portion. [b]p3. [/b]The vertical lines at $x = 0$, $x = \frac12$ , $x = 1$, $x = \frac32$ ,$...$ and the horizontal lines at $y = 0$, $y = \frac12$ , $y = 1$, $y = \frac32$ ,$ ...$ subdivide the first quadrant of the plane into $\frac12 \times \frac12$ square regions. Color these regions in a checkerboard fashion starting with a black region near the origin and alternating black and white both horizontally and vertically. (a) Let $T$ be a rectangle in the first quadrant with sides parallel to the axes. If the width of $T$ is an integer, prove that $T$ has equal areas of black and white. Note that a similar argument works to show that if the height of $T$ is an integer, then $T$ has equal areas of black and white. (b) Let $R$ be a rectangle with vertices at $(0, 0)$, $(a, 0)$, $(a, b)$, and $(0, b)$ with $a$ and $b$ positive. If $R$ has equal areas of black and white, prove that either $a$ is an integer or that $b$ is an integer. (c) Suppose a rectangle $R$ is tiled by a finite number of rectangular tiles. That is, the rectangular tiles completely cover $R$ but intersect only along their edges. If each of the tiles has at least one integer side, prove that $R$ has at least one integer side. [b]p4.[/b] Call a number [i]simple [/i] if it can be expressed as a product of single-digit numbers (in base ten). (a) Find two simple numbers whose sum is $2014$ or prove that no such numbers exist. (b) Find a simple number whose last two digits are $37$ or prove that no such number exists. [b]p5.[/b] Consider triangles for which the angles $\alpha$, $\beta$, and $\gamma$ form an arithmetic progression. Let $a, b, c$ denote the lengths of the sides opposite $\alpha$, $\beta$, $\gamma$ , respectively. Show that for all such triangles, $$\frac{a}{c}\sin 2\gamma +\frac{c}{a} \sin 2\alpha$$ has the same value, and determine an algebraic expression for this value. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We have two piles with $2000$ and $2017$ coins respectively. Ann and Bob take alternate turns making the following moves: The player whose turn is to move picks a pile with at least two coins, removes from that pile $t$ coins for some $2\le t \le 4$, and adds to the other pile $1$ coin. The players can choose a different $t$ at each turn, and the player who cannot make a move loses. If Ann plays first determine which player has a winning strategy.

Let $p_1, p_2, . . . , p_{30}$ be a permutation of the numbers $1, 2, . . . , 30.$ For how many permutations does the equality $\sum^{30}_{k=1}|p_k - k| = 450 $ hold?

Suppose there are $n\geq{5}$ different points arbitrarily arranged on a circle, the labels are $1, 2,\dots $, and $n$, and the permutation is $S$. For a permutation , a “descending chain” refers to several consecutive points on the circle , and its labels is a clockwise descending sequence (the length of sequence is at least $2$), and the descending chain cannot be extended to longer .The point with the largest label in the chain is called the "starting point of descent", and the other points in the chain are called the “non-starting point of descent” . For example: there are two descending chains $5, 2$and $4, 1$ in $5, 2, 4, 1, 3$ arranged in a clockwise direction, and $5$ and $4$ are their starting points of descent respectively, and $2, 1$ is the non-starting point of descent . Consider the following operations: in the first round, find all descending chains in the permutation $S$, delete all non-starting points of descent , and then repeat the first round of operations for the arrangement of the remaining points, until no more descending chains can be found. Let $G(S)$ be the number of all descending chains that permutation $S$ has appeared in the operations, $A(S)$ be the average value of $G(S)$of all possible n-point permutations $S$. (1) Find $A(5)$. (2)For $n\ge{6}$ , prove that $\frac{83}{120}n-\frac{1}{2} \le A(S) \le \frac{101}{120}n-\frac{1}{2}.$

The six offices of the city of Salavaara are to be connected to each other by a communication network which utilizes modern picotechnology. Each of the offices is to be connected to all the other ones by direct cable connections. Three operators compete to build the connections, and there is a separate competition for every connection. When the network is finished one notices that the worst has happened: the systems of the three operators are incompatible. So the city must reject connections built by two of the operators, and these are to be chosen so that the damage is minimized. What is the minimal number of offices which still can be connected to each other, possibly through intermediate offices, in the worst possible case.

$200n$ diagonals are drawn in a convex $n$-gon. Prove that one of them intersects at least 10000 others. [b]proposed by D. Karpov, S. Berlov[/b]

Let $n$ blue points $A_i$ and $n$ red points $B_i \ (i = 1, 2, \ldots , n)$ be situated on a line. Prove that \[\sum_{i,j} A_i B_j \geq \sum_{i<j} A_iA_j + \sum_{i<j} B_iB_j.\]

Using each of the eight digits $1,3,4,5,6,7,8$ and $9$ exactly once, a three-digit number $A$, two two-digit numbers $B$ and $C$, $B<C$, and a one digit number $D$ are formed. The numbers are such that $A+D=B+C=143$. In how many ways can this be done?

An infinite (in both directions) sequence of rooms is situated on one side of an infinite hallway. The rooms are numbered by consecutive integers and each contains a grand piano. A finite number of pianists live in these rooms. (There may be more than one of them in some of the rooms.) Every day some two pianists living in adjacent rooms (the Arth and ($k +1$)st) decide that they interfere with each other’s practice, and they move to the ($k - 1$)st and ($k + 2$)nd rooms, respectively. Prove that these moves will cease after a finite number of days. (VG Ilichev)

Every brick has $5$ holes in a line. The holes can be filled with bolts (fitting in one hole) and braces (fitting into two neighboring holes). No hole may remain free. One puts $n$ of these bricks in a line to form a pattern from left to right. In this line no two braces and no three bolts may be adjacent. How many different such patterns can be produced with $n$ bricks?

There are two distinct Points $A$ and $B$ on a line. We color a point $P$ on segment $AB$, distinct from $A,B$ and midpoint of segment $AB$ to red. In each move , we can reflect one of the red point wrt $A$ or $B$ and color the midpoint of the resulting point and the point we reflected from ( which is one of $A$ or $B$ ) to red. For example , if we choose $P$ and the reflection of $P$ wrt to $A$ is $P'$ , then midpoint of $AP'$ would be red. Is it possible to make the midpoint of $AB$ red after a finite number of moves?

The sides of an equilateral triangle $ABC$ are divided into $n$ equal parts $(n \geq 2) .$ For each point on a side, we draw the lines parallel to other sides of the triangle $ABC,$ e.g. for $n=3$ we have the following diagram: [asy] unitsize(150); defaultpen(linewidth(0.7)); int n = 3; /* # of vertical lines, including AB */ pair A = (0,0), B = dir(-30), C = dir(30); draw(A--B--C--cycle,linewidth(2)); dot(A,UnFill(0)); dot(B,UnFill(0)); dot(C,UnFill(0)); label("$A$",A,W); label("$C$",C,NE); label("$B$",B,SE); for(int i = 1; i < n; ++i) { draw((i*A+(n-i)*B)/n--(i*A+(n-i)*C)/n); draw((i*B+(n-i)*A)/n--(i*B+(n-i)*C)/n); draw((i*C+(n-i)*A)/n--(i*C+(n-i)*B)/n); } [/asy] For each $n \geq 2,$ find the number of existing parallelograms.

[b]p1.[/b] Martin’s car insurance costed $\$6000$ before he switched to Geico, when he saved $15\%$ on car insurance. When Mayhem switched to Allstate, he, a safe driver, saved $40\%$ on car insurance. If Mayhem and Martin are now paying the same amount for car insurance, how much was Mayhem paying before he switched to Allstate? [b]p2.[/b] The $7$-digit number $N$ can be written as $\underline{A} \,\, \underline{2} \,\,\underline{0} \,\,\underline{B} \,\,\underline{2} \,\, \underline{1} \,\,\underline{5}$. How many values of $N$ are divisible by $9$? [b]p3.[/b] The solutions to the equation $x^2-18x-115 = 0$ can be represented as $a$ and $b$. What is $a^2+2ab+b^2$? [b]p4.[/b] The exterior angles of a regular polygon measure to $4$ degrees. What is a third of the number of sides of this polygon? [b]p5.[/b] Charlie Brown is having a thanksgiving party. $\bullet$ He wants one turkey, with three different sizes to choose from. $\bullet$ He wants to have two or three vegetable dishes, when he can pick from Mashed Potatoes, Saut´eed Brussels Sprouts, Roasted Butternut Squash, Buttery Green Beans, and Sweet Yams; $\bullet$ He wants two desserts out of Pumpkin Pie, Apple Pie, Carrot Cake, and Cheesecake. How many different combinations of menus are there? [b]p6.[/b] In the diagram below, $\overline{AD} \cong \overline{CD}$ and $\vartriangle DAB$ is a right triangle with $\angle DAB = 90^o$. Given that the radius of the circle is $6$ and $m \angle ADC = 30^o$, if the length of minor arc $AB$ is written as $a\pi$, what is $a$? [img]https://cdn.artofproblemsolving.com/attachments/d/9/ea57032a30c16f4402886af086064261d6828b.png[/img] [b]p7.[/b] This Halloween, Owen and his two friends dressed up as guards from Squid Game. They needed to make three masks, which were black circles with a white equilateral triangle, circle, or square inscribed in their upper halves. Resourcefully, they used black paper circles with a radius of $5$ inches and white tape to create these masks. Ignoring the width of the tape, how much tape did they use? If the length can be expressed $a\sqrt{b}+c\sqrt{d}+ \frac{e}{f} \pi$ such that $b$ and $d$ are not divisible by the square of any prime, and $e$ and $f$ are relatively prime, find $a + b + c + d + e + f$. [img]https://cdn.artofproblemsolving.com/attachments/0/c/bafe3f9939bd5767ba5cf77a51031dd32bbbec.png[/img] [b]p8.[/b] Given $LCM (10^8, 8^{10}, n) = 20^{15}$, where $n$ is a positive integer, find the total number of possible values of $n$. [b]p9.[/b] If one can represent the infinite progression $\frac{1}{11} + \frac{2}{13} + \frac{3}{121} + \frac{4}{169} + \frac{5}{1331} + \frac{6}{2197}+ ...$ as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers, what is $a$? [b]p10.[/b] Consider a tiled $3\times 3$ square without a center tile. How many ways are there to color the squares such that no two colored squares are adjacent (vertically or horizontally)? Consider rotations of an configuration to be the same, and consider the no-color configuration to be a coloring. [b]p11.[/b] Let $ABC$ be a triangle with $AB = 4$ and $AC = 7$. Let $AD$ be an angle bisector of triangle $ABC$. Point $M$ is on $AC$ such that $AD$ intersects $BM$ at point $P$, and $AP : PD = 3 : 1$. If the ratio $AM : MC$ can be expressed as $\frac{a}{b}$ such that $a$, $b$ are relatively prime positive integers, find $a + b$. [b]p12.[/b] For a positive integer $n$, define $f(n)$ as the number of positive integers less than or equal to $n$ that are coprime with $n$. For example, $f(9) = 6$ because $9$ does not have any common divisors with $1$, $2$, $4$, $5$, $7$, or $8$. Calculate: $$\sum^{100}_{i=2} \left( 29^{f(i)}\,\,\, mod \,\,i \right).$$ [b]p13.[/b] Let $ABC$ be an equilateral triangle. Let $P$ be a randomly selected point in the incircle of $ABC$. Find $a+b+c+d$ if the probability that $\angle BPC$ is acute can be expressed as $\frac{a\sqrt{b} -c\pi}{d\pi }$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c, d) = 1$ and $b$ is not divisible by the square of any prime. [b]p14.[/b] When the following expression is simplified by expanding then combining like terms, how many terms are in the resulting expression? $$(a + b + c + d)^{100} + (a + b - c - d)^{100}$$ [b]p15.[/b] Jerry has a rectangular box with integral side lengths. If $3$ units are added to each side of the box, the volume of the box is tripled. What is the largest possible volume of this box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For what values of $n$ is it possible to mark $n$ points on the plane so that each point has at least three other points at distance $1$?

Consider an increasing sequence of real numbers $a_1<a_2<\ldots<a_{2023}$ such that all pairwise sums of the elements in the sequence are different. For such a sequence, denote by $M$ the number of pairs $(a_i,a_j)$ such that $a_i<a_j$ and $a_i+a_j<a_2+a_{2022}$. Find the minimal and the maximal possible value of $M$.

[b]p22.[/b] Consider the series $\{A_n\}^{\infty}_{n=0}$, where $A_0 = 1$ and for every $n > 0$, $$A_n = A_{\left[ \frac{n}{2023}\right]} + A_{\left[ \frac{n}{2023^2}\right]}+A_{\left[ \frac{n}{2023^3}\right]},$$ where $[x]$ denotes the largest integer value smaller than or equal to $x$. Find the $(2023^{3^2}+20)$-th element of the series. [b]p23.[/b] The side lengths of triangle $\vartriangle ABC$ are $5$, $7$ and $8$. Construct equilateral triangles $\vartriangle A_1BC$, $\vartriangle B_1CA$, and $\vartriangle C_1AB$ such that $A_1$,$B_1$,$C_1$ lie outside of $\vartriangle ABC$. Let $A_2$,$B_2$, and $C_2$ be the centers of $\vartriangle A_1BC$, $\vartriangle B_1CA$, and $\vartriangle C_1AB$, respectively. What is the area of $\vartriangle A_2B_2C_2$? [b]p24. [/b]There are $20$ people participating in a random tag game around an $20$-gon. Whenever two people end up at the same vertex, if one of them is a tagger then the other also becomes a tagger. A round consists of everyone moving to a random vertex on the $20$-gon (no matter where they were at the beginning). If there are currently $10$ taggers, let $E$ be the expected number of untagged people at the end of the next round. If $E$ can be written as $\frac{a}{b}$ for $a, b$ relatively prime positive integers, compute $a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The bottom line of a $2\times 13$ rectangle is filled with $13$ tokens marked with the numbers $1, 2, ..., 13$ and located in that order. An operation is a move of a token from its cell into a free adjacent cell (two cells are called adjacent if they have a common side). What is the minimum number of operations needed to rearrange the chips in reverse order in the bottom line of the rectangle?

A cube is assembled with $27$ white cubes. The larger cube is then painted black on the outside and disassembled. A blind man reassembles it. What is the probability that the cube is now completely black on the outside? Give an approximation of the size of your answer.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds: (i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$ (ii) some plane contains exactly three points from $E.$

For $n\geq3$ define $S_n=\{1, 2, ..., n\}$. $A_1, A_{2}, ..., A_{n}$ are given subsets of $S_n$, each having an even number of elements. Prove that there exists a set $\{i_1, i_2, ..., i_t\}$, a nonempty subset of $S_n$ such that $$A_{i_1} \Delta A_{i_2} \Delta \ldots \Delta A_{i_t}=\emptyset$$ (For two sets $A, B$, we define $\Delta$ as $A \Delta B=(A\cup B)-(A\cap B)$)

In each square of an $n \times n$ board with $n\ge 2$, an integer is written not null. Said board is called [i]Inca [/i] if for each square, the number written on it is equal to the difference of the numbers written on two of its neighboring squares (with a common side). For what values of $n$, can you get [i]Inca[/i] boards ?

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

There are eight congruent $1\times 2$ tiles formed of one blue square and one red square. In how many ways can we cover a $4\times 4$ area with these tiles so that each row and each column has two blue squares and two red squares?

To each vertex of a regular pentagon an integer is assigned, so that the sum of all five numbers is positive. If three consecutive vertices are assigned the numbers $x,y,z$ respectively, and $y<0$, then the following operation is allowed: $x,y,z$ are replaced by $x+y,-y,z+y$ respectively. Such an operation is performed repeatedly as long as at least one of the five numbers is negative. Determine whether this procedure necessarily comes to an end after a finite number of steps.