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}$.

Let $X$ be a set of $n$ elements. Prove that the sum of the numbers of elements of sets $A\cap B$, where $A$ and $B$ run over all subsets of $X$, is equal to $n4^{n-1}$.

Some frogs, some red and some others green, are going to move in an $11 \times 11$ grid, according to the following rules. If a frog is located, say, on the square marked with # in the following diagram, then [list] [*]If it is red, it can jump to any square marked with an x. [*]if it is green, it can jump to any square marked with an o.[/list] \[\begin{tabular}{| p{0.08cm} | p{0.08cm} | p{0.08cm} | p{0.08cm} | p{0.08cm} | p{0.08cm} | p{0.08cm} | p{0.08cm} | p{0.08cm} | l} \hline &&&&&&\\ \hline &&x&&o&&\\ \hline &o&&&&x&\\ \hline &&&\small{\#}&&&\\ \hline &x&&&&o&\\ \hline &&o&&x&&\\ \hline &&&&&&\\ \hline \end{tabular} \] We say 2 frogs (of any color) can meet at a square if both can get to the same square in one or more jumps, not neccesarily with the same amount of jumps. [list=a] [*]Prove if 6 frogs are placed, then there exist at least 2 that can meet at a square. [*]For which values of $k$ is it possible to place one green and one red frog such that they can meet at exactly $k$ squares?[/list]

What is the greatest number of balls of radius $1/2$ that can be placed within a rectangular box of size $10 \times 10 \times 1 \ ?$

Nelson challenges Telma for the following game: First Telma takes $2^9$ numbers from the set $\left\{0,1,2,3,\cdots,1024\right\}$, then Nelson takes $2^8$ of the remaining numbers. Then Telma takes $2^7$ numbers and successively, until only two numbers remain. Nelson will have to give Telma the difference between these two numbers in euros. What is the largest amount Telma can win, whatever Nelson's strategy is?

To every vertex of a regular pentagon a real number is assigned. We may perform the following operation repeatedly: we choose two adjacent vertices of the pentagon and replace each of the two numbers assigned to these vertices by their arithmetic mean. Is it always possible to obtain the position in which all five numbers are zeroes, given that in the initial position the sum of all five numbers is equal to zero?

Several line segments parallel to the sides of a rectangular sheet of paper were drawn on it. These segments divided the sheet into several rectangles, inside of which there are no drawn lines. Petya wants to draw one diagonal in each of the rectangles, dividing it into two triangles, and color each triangle either black or white. Is it always possible to do this in such a way that no two triangles of the same color share a segment of their boundary?

Let $M$ be a set of $2017$ positive integers. For any subset $A$ of $M$ we define $f(A) := \{x\in M\mid \text{ the number of the members of }A\,,\, x \text{ is multiple of, is odd }\}$. Find the minimal natural number $k$, satisfying the condition: for any $M$, we can color all the subsets of $M$ with $k$ colors, such that whenever $A\neq f(A)$, $A$ and $f(A)$ are colored with different colors.

Let $S$ be the set $\{-1, 1\}^n$, that is, $n$-tuples such that each coordinate is either $-1$ or $1$. For \[s = (s_1, s_2, \ldots, s_n), t = (t_1, t_2, \ldots, t_n) \in \{-1, 1\}^n,\] define $s \odot t = (s_1t_1, s_2t_2, \ldots, s_nt_n)$. Let $c$ be a positive constant, let $f : S \to \{-1, 1\}$ be a function such that there are at least $(1-c) \cdot 2^{2n}$ pairs $(s, t)$ with $s, t \in S$ such that $f(s \odot t) = f(s)f(t)$. Show that there exists a function $f'$ such that $f'(s \odot t) = f'(s)f'(t)$ for all $s, t \in S$ and $f(s) = f'(s)$ for at least $(1-10c) \cdot 2^n$ values of $s \in S$.

Kirill has $n{}$ identical footballs and two infinite rows of baskets, each numbered with consecutive natural numbers. In one row the baskets are red, in the other they are blue. Kirill puts all the balls into baskets so that the number of balls in the either row of baskets does not increase. Denote by $A{}$ the number of ways to arrange the balls so that the first blue basket contains more balls than any red one, and by $B{}$ the number of arrangements so that the number of some blue basket corresponds with the number of balls in it. Prove that $A = B$.

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

Let $n$ be a positive integer. There exist $n$ ordered triples$$(x_1, y_1, z_1), (x_2, y_2, z_2), \dots, (x_n, y_n, z_n)$$where each coordinate is an integer between $1$ and $100$ (inclusive), satisfying the following condition: [center] [i]For every infinite sequence $(a_1, a_2, a_3, \dots)$ of integers between $1$ and $100$, there exist a positive integer $i$ and an index $j$ (with $1 \leqslant j \leqslant n$) such that $(a_i, a_{i+1}, a_{i+2}) = (x_j, y_j, z_j)$.[/i] [/center] Determine the minimum possible value of $n$.

The numbers from 1 to 100 are written in an unknown order. One may ask about any 50 numbers and find out their relative order. What is the fewest questions needed to find the order of all 100 numbers? [i]S. Tokarev[/i]

We would like to give a present to one of $100$ children. We do this by throwing a biased coin $k$ times, after predetermining who wins in each possible outcome of this lottery. Prove that we can choose the probability $p$ of throwing heads, and the value of $k$ such that, by distributing the $2^k$ different outcomes between the children in the right way, we can guarantee that each child has the same probability of winning.

Let $E$ to be an infinite set of congruent ellipses in the plane, and $r$ a fixed line. It is known that each line parallel to $r$ intersects at least one ellipse belonging to $E$. Prove that there exist infinitely many triples of ellipses belonging to $E$, such that there exists a line that intersect the triple of ellipses.

In the plane are given $2000$ congruent triangles of area $1$, which are all images of one triangle under translations. Each of these triangles contains the centroid of every other triangle. Prove that the union of these triangles has area less than $22/9$.

The numbers $1,2,...,100$ are written in a board. We are allowed to choose any two numbers from the board $a,b$ to delete them and replace on the board the number $a+b-1$. What are the possible numbers u can get after $99$ consecutive operations of these?

[u]Round 4[/u] [b]p13.[/b] What is the units digit of the number $(2^1 + 1)(2^2 - 1)(2^3 + 1)(2^4 - 1)...(2^{2010} - 1)$? [b]p14.[/b] Mr. Fat noted that on January $2$, $2010$, the display of the day is $01/02/2010$, and the sequence $01022010$ is a palindrome (a number that reads the same forwards and backwards). How many days does Mr. Fat need to wait between this palindrome day and the last palindrome day of this decade? [b]p15.[/b] Farmer Tim has a $30$-meter by $30$-meter by $30\sqrt2$-meter triangular barn. He ties his goat to the corner where the two shorter sides meet with a 60-meter rope. What is the area, in square meters, of the land where the goat can graze, given that it cannot get inside the barn? [b]p16.[/b] In triangle $ABC$, $AB = 3$, $BC = 4$, and $CA = 5$. Point $P$ lies inside the triangle and the distances from $P$ to two of the sides of the triangle are $ 1$ and $2$. What is the maximum distance from $P$ to the third side of the triangle? [u]Round 5[/u] [b]p17.[/b] Let $Z$ be the answer to the third question on this guts quadruplet. If $x^2 - 2x = Z - 1$, find the positive value of $x$. [b]p18.[/b] Let $X$ be the answer to the first question on this guts quadruplet. To make a FATRON2012, a cubical steel body as large as possible is cut out from a solid sphere of diameter $X$. A TAFTRON2013 is created by cutting a FATRON2012 into $27$ identical cubes, with no material wasted. What is the length of one edge of a TAFTRON2013? [b]p19.[/b] Let $Y$ be the smallest integer greater than the answer to the second question on this guts quadruplet. Fred posts two distinguishable sheets on the wall. Then, $Y$ people walk into the room. Each of the Y people signs up on $0, 1$, or $2$ of the sheets. Given that there are at least two people in the room other than Fred, how many possible pairs of lists can Fred have? [b]p20.[/b] Let $A, B, C$, be the respective answers to the first, second, and third questions on this guts quadruplet. At the Robot Design Convention and Showcase, a series of robots are programmed such that each robot shakes hands exactly once with every other robot of the same height. If the heights of the $16$ robots are $4$, $4$, $4$, $5$, $5$, $7$, $17$, $17$, $17$, $34$, $34$, $42$, $100$, $A$, $B$, and $C$ feet, how many handshakes will take place? [u]Round 6[/u] [b]p21.[/b] Determine the number of ordered triples $(p, q, r)$ of primes with $1 < p < q < r < 100$ such that $q - p = r - q$. [b]p22.[/b] For numbers $a, b, c, d$ such that $0 \le a, b, c, d \le 10$, find the minimum value of $ab + bc + cd + da - 5a - 5b - 5c - 5d$. [b]p23.[/b] Daniel has a task to measure $1$ gram, $2$ grams, $3$ grams, $4$ grams , ... , all the way up to $n$ grams. He goes into a store and buys a scale and six weights of his choosing (so that he knows the value for each weight that he buys). If he can place the weights on either side of the scale, what is the maximum value of $n$? [b]p24.[/b] Given a Rubik’s cube, what is the probability that at least one face will remain unchanged after a random sequence of three moves? (A Rubik’s cube is a $3$ by $3$ by $3$ cube with each face starting as a different color. The faces ($3$ by $3$) can be freely turned. A move is defined in this problem as a $90$ degree rotation of one face either clockwise or counter-clockwise. The center square on each face–six in total–is fixed.) PS. You should use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2766534p24230616]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a certain language there are $n$ letters. A sequence of letters is a word, if there are no two equal letters between two other equal letters. Find the number of words of the maximum length.

Some edges are painted in red. We say that a coloring of this kind is [i]good[/i], if for each vertex of the polyhedron, there exists an edge which concurs in that vertex and is not painted red. Moreover, we say that a coloring where some of the edges of a regular polyhedron is [i]completely good[/i], if in addition to being [i]good[/i], no face of the polyhedron has all its edges painted red. What regular polyhedrons is equal the maximum number of edges that can be painted in a [i]good[/i] color and a [i]completely good[/i]? Explain your answer.

There are $26$ students in the class. They agreed that each of them would either be a liar (liars always lie) or a knight (knights always tell the truth). When they came to the class and sat down for desks, each of them said: “I am sitting next to a liar.” Then some students moved for other desks. After that, everyone says: “ I am sitting next to a knight .” Is this possible? Every time exactly two students sat at any desk.

A division of a group of people into various groups is called $k$-regular if the number of groups is less or equal to $k$ and two people that know each other are in different groups. Let $A$, $B$, and $C$ groups of people such that there are is no person in $A$ and no person in $B$ that know each other. Suppose that the group $A \cup C$ has an $a$-regular division and the group $B \cup C$ has a $b$-regular division. For each $a$ and $b$, determine the least possible value of $k$ for which it is guaranteed that the group $A \cup B \cup C$ has a $k$-regular division.

Given parallelogram $OABC$ in the coodinate with $O$ the origin and $A,B,C$ be lattice points. Prove that for all lattice point $P$ in the internal or boundary of $\triangle ABC$, there exists lattice points $Q,R$(can be the same) in the internal or boundary of $\triangle OAC$ with $\overrightarrow{OP}=\overrightarrow{OQ}+\overrightarrow{OR}$.

[b]p1.[/b] Elsie M. is fixing a watch with three gears. Gear $A$ makes a full rotation every $5$ minutes, gear $B$ makes a full rotation every $8$ minutes, and gear $C$ makes a full rotation every $12$ minutes. The gears continue spinning until all three gears are in their original positions at the same time. How many minutes will it take for the gears to stop spinning? [b]p2.[/b] Optimus has to pick $10$ distinct numbers from the set of positive integers $\{2, 3, 4,..., 29, 30\}$. Denote the numbers he picks by $\{a_1, a_2, ...,a_{10}\}$. What is the least possible value of $$d(a_1 ) + d(a_2) + ... + d(a_{10}),$$ where $d(n)$ denotes the number of positive integer divisors of $n$? For example, $d(33) = 4$ since $1$, $3$, $11$, and $33$ divide $33$. [b]p3.[/b] Michael is given a large supply of both $1\times 3$ and $1\times 5$ dominoes and is asked to arrange some of them to form a $6\times 13$ rectangle with one corner square removed. What is the minimum number of $1\times 3$ dominoes that Michael can use? [img]https://cdn.artofproblemsolving.com/attachments/6/6/c6a3ef7325ecee417e37ec9edb5374aceab9fd.png[/img] [b]p4.[/b] Andy, Ben, and Chime are playing a game. The probabilities that each player wins the game are, respectively, the roots $a$, $b$, and $c$ of the polynomial $x^3 - x^2 + \frac{111}{400}x - \frac{9}{400} = 0$ with $a \le b \le c$. If they play the game twice, what is the probability of the same player winning twice? [b]p5.[/b] TongTong is doodling in class and draws a $3 \times 3$ grid. She then decides to color some (that is, at least one) of the squares blue, such that no two $1 \times 1$ squares that share an edge or a corner are both colored blue. In how many ways may TongTong color some of the squares blue? TongTong cannot rotate or reflect the board. [img]https://cdn.artofproblemsolving.com/attachments/6/0/4b4b95a67d51fda0f155657d8295b0791b3034.png[/img] [b]p6.[/b] Given a positive integer $n$, we define $f(n)$ to be the smallest possible value of the expression $$| \square 1 \square 2 ... \square n|,$$ where we may place a $+$ or a $-$ sign in each box. So, for example, $f(3) = 0$, since $| + 1 + 2 - 3| = 0$. What is $f(1) + f(2) + ... + f(2011)$? [b]p7.[/b] The Duke Men's Basketball team plays $11$ home games this season. For each game, the team has a $\frac34$ probability of winning, except for the UNC game, which Duke has a $\frac{9}{10}$ probability of winning. What is the probability that Duke wins an odd number of home games this season? [b]p8.[/b] What is the sum of all integers $n$ such that $n^2 + 2n + 2$ divides $n^3 + 4n^2 + 4n - 14$? [b]p9.[/b] Let $\{a_n\}^N_{n=1}$ be a finite sequence of increasing positive real numbers with $a_1 < 1$ such that $$a_{n+1} = a_n \sqrt{1 - a^2_1}+ a_1\sqrt{1 - a^2_n}$$ and $a_{10} = 1/2$. What is $a_{20}$? [b]p10.[/b] Three congruent circles are placed inside a unit square such that they do not overlap. What is the largest possible radius of one of these circles? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let ABC be a triangle with angles $\alpha, \beta, \gamma$ commensurable with $\pi$. Starting from a point $P$ interior to the triangle, a ball reflects on the sides of $ABC$, respecting the law of reflection that the angle of incidence is equal to the angle of reflection. Prove that, supposing that the ball never reaches any of the vertices $A,B,C$, the set of all directions in which the ball will move through time is finite. In other words, its path from the moment $0$ to infinity consists of segments parallel to a finite set of lines.