Around a round table sit $2n$ Peruvians, $2n$ Bolivians and $2n$ Ecuadorians. If it is requested that all those who have as neighbors, to their right and to their left, people of the same nationality. Find as many people as can stand up. Clarification: For example, for a Peruvian to get up, his neighbors must be of equal nationality, but not necessarily Peruvians.

In the dog dictionary the words are any sequence of letters $A$ and $U$ for example $AA$, $UAU$ and $AUAU$. For each word, your "profundity" will be the quantity of subwords we can obtain by the removal of some letters. For each positive integer $n$, determine the largest "profundity" of word, in dog dictionary, can have with $n$ letters. Note: The word $AAUUA$ has "profundity" $14$ because your subwords are $A, U, AU, AA, UU, UA, AUU, UUA, AAU, AUA, AAA, AAUU, AAUA, AUUA$.

An equilateral triangle of side $n$ has been divided into little equilateral triangles of side $1$ in the usual way. We draw a path over the segments of this triangulation, in such a way that it visits exactly once each one of the $\frac{(n+1)(n+2)}{2}$ vertices. What is the minimum number of times the path can change its direction? The figure below shows a valid path on a triangular board of side $4$, with exactly $9$ changes of direction. [asy] unitsize(30); pair h = (1, 0); pair v = dir(60); pair d = dir(120); for(int i = 0; i < 4; ++i) { draw(i*v -- i*v + (4 - i)*h); draw(i*h -- i*h + (4 - i)*v); draw((i + 1)*h -- (i + 1)*h + (i + 1)*d); } draw(h + v -- v -- (0, 0) -- 2*h -- 2*h + v -- h + 2*v -- 2*v -- 4*v -- 3*h + v -- 3*h -- 4*h, linewidth(2)); draw(3*h -- 4*h, EndArrow); fill(circle(h + v, 0.1)); [/asy] [i]Proposed by Oriol Solé[/i]

Consider a right-angled triangle whose legs are $1$ cm long. Suppose that each point of the triangle was assigned a color from the set of Brown, Blue, Green and Orange colors. It proves that, whatever way this was done, there is at least one pair of points of the same color at a distance equal to or greater than $2-\sqrt 2$ cm from each other.

In connection with the formation of a stable government, the President invited all $240$ Members of Parliament to three separate consultations, where each member participated in exactly one consultation, and at each consultation there has been at least one member present. Discussions between pairs of members are to take place to discuss the consultations. Is it possible for these discussions to occur in such a way that there exists a non-negative integer $k$, such that for every two members who participated in different consultations, there are exactly $k$ members who participated in the remaining consultation, with whom each of the two members has a conversation, and exactly $k$ members who participated in the remaining consultation, with whom neither of the two has a conversation? If yes, then find all possible values of $k$.

The set $M = \{1, 2, . . . , 2n\}$ is partitioned into $k$ nonintersecting subsets $M_1,M_2, \dots, M_k,$ where $n \ge k^3 + k.$ Prove that there exist even numbers $2j_1, 2j_2, \dots, 2j_{k+1}$ in $M$ that are in one and the same subset $M_i$ $(1 \le i \le k)$ such that the numbers $2j_1 - 1, 2j_2 - 1, \dots, 2j_{k+1} - 1$ are also in one and the same subset $M_j (1 \le j \le k).$

Felix chooses a positive integer as the starting number and writes it on the board. He then repeats the next step: he replaces the number $n$ on the board by $\frac12n$ if $n$ is even and by $n^2 + 3$ if $n$ is odd. For how many choices of starting numbers below $2023$ will Felix never write a number of more than four digits on the board?

In space are given $24$ points, no three of which are collinear. Suppose that there are exactly $2002$ planes determined by three of these points. Prove that there is a plane containing at least six points.

In a group of nine persons it is not possible to choose four persons such that every one knows the three others. Prove that this group of nine persons can be partitioned into four groups such that nobody knows anyone from his or her group.

Let be given $n$ positive integer. Lets write with $a_n$ the number of positive integer pairs $(x,y)$ such that $x+y$ is even and $1\leq x\leq y\leq n$. Lets write with $b_n$ the number of positive integer pairs $(x,y)$ such that $x+y\leq n+1$ and $1\leq x\leq y\leq n$.

In a country, towns are connected by roads. Each town is directly connected to exactly three other towns. Show that there exists a town from which you can make a round-trip, without using the same road more than once, and for which the number of roads used is not divisible by $3$. (Not all towns need to be visited.)

$A_0B, A_0C$ rays that satisfy $\angle BA_0C=14^{\circ}$. You are to place points $A_1, A_2, ...$ by the following rules. [b]Rules[/b] (1) On the first move, place $A_1$ on any point on $A_0B$(except $A_0$). (2) On the $n>1$th move, place $A_n$ on $A_0B$ iff $A_{n-1}$ is on $A_0C$, and place $A_n$ on $A_0C$ iff $A_{n-1}$ is one $A_0B$. $A_n$ must be place on the point that satisfies $A_{n-2}A_n{n-1}=A_{n-1}A_n$. All the points must be placed in different locations. What is the maximum number of points that can be placed?

Find the number of ways there are to permute the elements of the set $\{1,2,3,4,5,6,7,8,9\}$ such that no two adjacent numbers are both even or both odd. [i]Proposed by Ephram Chun[/i]

A rectangle with sides $ n$ and $p$ is divided into $np$ unit squares. Initially there are m unitary squares painted black and the remaining painted white. The following processoccurs repeatedly: if a unit square painted white has at minus two sides in common with squares painted black then Its color also turns black. Find the smallest integer $m$ that satisfies the property: there exists an initial position of $m$ black unit squares such that the entire $ n \times p$ rectangle is painted black when repeat the process a finite number of times.

In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn: [list] [*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller. [*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter. [/list] We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.

There are $2002$ employees in a bank. All the employees came to celebrate the bank's jubilee and were seated around one round table. It is known that the difference in salaries of any two adjacent employees is $2$ or $3$ dollars. Find the maximal difference in salaries of two employees, if it is known all salaries are different.

Let $k$ be a positive integer. Find all positive integers $n$, such that it is possible to mark $n$ points on the sides of a triangle (different from its vertices) and connect some of them with a line in such a way that the following conditions are satisfied: 1) there is at least $1$ marked point on each side, 2) for each pair of points $X$ and $Y$ marked on different sides, on the third side there exist exactly $k$ marked points which are connected to both $X$ and $Y$ and exactly k points which are connected to neither $X$ nor $Y$

Consider a set of \( n \geq 3 \) points in the plane where no three are collinear. Prove that the points can be labeled as \( P_1, P_2, \dots, P_n \) so that the angles \( \angle P_i P_{i+1} P_{i+2} \) are less than \( 90^\circ \) for all \( i \).

[b]p1.[/b] An ant starts at the top vertex of a triangular pyramid (tetrahedron). Each day, the ant randomly chooses an adjacent vertex to move to. What is the probability that it is back at the top vertex after three days? [b]p2.[/b] A square “rolls” inside a circle of area $\pi$ in the obvious way. That is, when the square has one corner on the circumference of the circle, it is rotated clockwise around that corner until a new corner touches the circumference, then it is rotated around that corner, and so on. The square goes all the way around the circle and returns to its starting position after rotating exactly $720^o$. What is the area of the square? [b]p3.[/b] How many ways are there to fill a $3\times 3$ grid with the integers $1$ through $9$ such that every row is increasing left-to-right and every column is increasing top-to-bottom? [b]p4.[/b] Noah has an old-style M&M machine. Each time he puts a coin into the machine, he is equally likely to get $1$ M&M or $2$ M&M’s. He continues putting coins into the machine and collecting M&M’s until he has at least $6$ M&M’s. What is the probability that he actually ends up with $7$ M&M’s? [b]p5.[/b] Erik wants to divide the integers $1$ through $6$ into nonempty sets $A$ and $B$ such that no (nonempty) sum of elements in $A$ is a multiple of $7$ and no (nonempty) sum of elements in $B$ is a multiple of $7$. How many ways can he do this? (Interchanging $A$ and $B$ counts as a different solution.) [b]p6.[/b] A subset of $\{1, 2, 3, 4, 5, 6, 7, 8\}$ of size $3$ is called special if whenever $a$ and $b$ are in the set, the remainder when $a + b$ is divided by $8$ is not in the set. ($a$ and $b$ can be the same.) How many special subsets exist? [b]p7.[/b] Let $F_1 = F_2 = 1$, and let $F_n = F_{n-1} + F_{n-2}$ for all $n \ge 3$. For each positive integer $n$, let $g(n)$ be the minimum possible value of $$|a_1F_1 + a_2F_2 + ...+ a_nF_n|,$$ where each $a_i$ is either $1$ or $-1$. Find $g(1) + g(2) +...+ g(100)$. [b]p8.[/b] Find the smallest positive integer $n$ with base-$10$ representation $\overline{1a_1a_2... a_k}$ such that $3n = \overline{a_1a_2


a_k1}$. [b]p9.[/b] How many ways are there to tile a $4 \times 6$ grid with $L$-shaped triominoes? (A triomino consists of three connected $1\times 1$ squares not all in a line.) [b]p10.[/b] Three friends want to share five (identical) muffins so that each friend ends up with the same total amount of muffin. Nobody likes small pieces of muffin, so the friends cut up and distribute the muffins in such a way that they maximize the size of the smallest muffin piece. What is the size of this smallest piece? [u]Numerical tiebreaker problems:[/u] [b]p11.[/b] $S$ is a set of positive integers with the following properties: (a) There are exactly 3 positive integers missing from $S$. (b) If $a$ and $b$ are elements of $S$, then $a + b$ is an element of $S$. (We allow $a$ and $b$ to be the same.) How many possibilities are there for the set $S$? [b]p12.[/b] In the trapezoid $ABCD$, both $\angle B$ and $\angle C$ are right angles, and all four sides of the trapezoid are tangent to the same circle. If $\overline{AB} = 13$ and $\overline{CD} = 33$, find the area of $ABCD$. [b]p13.[/b] Alice wishes to walk from the point $(0, 0)$ to the point $(6, 4)$ in increments of $(1, 0)$ and $(0, 1)$, and Bob wishes to walk from the point $(0, 1)$ to the point $(6, 5)$ in increments of $(1, 0)$ and $(0,1)$. How many ways are there for Alice and Bob to get to their destinations if their paths never pass through the same point (even at different times)? [b]p14.[/b] The continuous function $f(x)$ satisfies $9f(x + y) = f(x)f(y)$ for all real numbers $x$ and $y$. If $f(1) = 3$, what is $f(-3)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f_1,f_2,\ldots $ be a sequence of non-increasing functions from the naturals to the naturals. Show there exists $i < j$ such that $$f_i(n) \leq f_j(n) \text{ for all } n \in \mathbb{N}.$$

We have a $100\times100$ garden and we’ve plant $10000$ trees in the $1\times1$ squares (exactly one in each.). Find the maximum number of trees that we can cut such that on the segment between each two cut trees, there exists at least one uncut tree.

$k$ is a positive integer. $A$ company has a special method to sell clocks. Every customer can reason with two customers after he has bought a clock himself $;$ it's not allowed to reason with an agreed person. These new customers can reason with other two persons and it goes like this.. If both of the customers agreed by a person could play a role (it can be directly or not) in buying clocks by at least $k$ customers, this person gets a present. Prove that, if $n$ persons have bought clocks, then at most $\frac{n}{k+2}$ presents have been accepted.

All positive integers are coloured either red or green, such that the following conditions are satisfied: - There are equally many red as green integers. - The sum of three (not necessarily distinct) red integers is red. - The sum of three (not necessarily distinct) green integers is green. Find all colourings that satisfy these conditions.

It is known that there are $3$ buildings in the same shape which are located in an equilateral triangle. Each building has a $2015$ floor with each floor having one window. In all three buildings, every $1$st floor is uninhabited, while each floor of others have exactly one occupant. All windows will be colored with one of red, green or blue. The residents of each floor of a building can see the color of the window in the other buildings of the the same floor and one floor just below it, but they cannot see the colors of the other windows of the two buildings. Besides that, sresidents cannot see the color of the window from any floor in the building itself. For example, resident of the $10$th floor can see the colors of the $9$th and $10$th floor windows for the other buildings (a total of $4$ windows) and he can't see the color of the other window. We want to color the windows so that each resident can see at lest $1$ window of each color. How many ways are there to color those windows?

A tennis competition takes place over four days, the number of participants is $2n$ with $n \ge 5$. Each participant plays exactly once a day (a couple of participants may be more times). Prove that such competition can end with exactly one winner and exactly three players in second place and such that there are no players with four lost games,