On a blackboard there are $ n \geq 2, n \in \mathbb{Z}^{\plus{}}$ numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all numbers $ n$ for which it is possible to yield $ n$ identical number after a finite number of steps.

Denote every permutation of $1,2,\dots, n$ as $\sigma =(a_1,a_2,\dots,n)$. Prove that the sum $$\sum \frac{1}{(a_1)(a_1+a_2)(a_1+a_2+a_3)\dots(a_1+a_2+\dots+a_n)}$$ taken over all possible permutations $\sigma$ equals $\frac{1}{n!}$.

We play a game of musical chairs with $n$ chairs numbered $1$ to $n$. You attach $n$ leaves, numbered $1$ to $n$, to the chairs in such a way that the number on a leaf does not match the number on the chair it is attached to. One player sits on each chair. Every time you clap, each player looks at the number on the leaf attached to his current seat and moves to sit on the seat with that number. Prove that, for any $m$ that is not a prime power with$ 1 < m \leq n$, it is possible to attach the leaves to the seats in such a way that after $m$ claps everyone has returned to the chair they started on for the first time.

Is it possible to partition all positive integers into disjoint sets $A$ and $B$ such that (i) no three numbers of $A$ form an arithmetic progression, (ii) no infinite non-constant arithmetic progression can be formed by numbers of $B$?

There are $32$ students in the class with $10$ interesting group. Each group contains exactly $16$ students. For each couple of students, the square of the number of the groups which are only involved by just one of the two students is defined as their $interests-disparity$. Define $S$ as the sum of the $interests-disparity$ of all the couples, $\binom{32}{2}\left ( =\: 496 \right )$ ones in total. Determine the minimal possible value of $S$.

Given a positive integer $k$ and other two integers $b > w > 1.$ There are two strings of pearls, a string of $b$ black pearls and a string of $w$ white pearls. The length of a string is the number of pearls on it. One cuts these strings in some steps by the following rules. In each step: [b](i)[/b] The strings are ordered by their lengths in a non-increasing order. If there are some strings of equal lengths, then the white ones precede the black ones. Then $k$ first ones (if they consist of more than one pearl) are chosen; if there are less than $k$ strings longer than 1, then one chooses all of them. [b](ii)[/b] Next, one cuts each chosen string into two parts differing in length by at most one. (For instance, if there are strings of $5, 4, 4, 2$ black pearls, strings of $8, 4, 3$ white pearls and $k = 4,$ then the strings of 8 white, 5 black, 4 white and 4 black pearls are cut into the parts $(4,4), (3,2), (2,2)$ and $(2,2)$ respectively.) The process stops immediately after the step when a first isolated white pearl appears. Prove that at this stage, there will still exist a string of at least two black pearls. [i]Proposed by Bill Sands, Thao Do, Canada[/i]

There are $n$ straight lines in the plane such that each intersects exactly $1999$ of the others . Find all posssible values of $n$. (R Zhenodarov)

RyNo, a little rhinoceros, has $17$ scratch marks on its body. Some are horizontal and the rest are vertical. Some are on the left side and the rest are on the right side. If RyNo rubs one side of its body against a tree, two scratch marks, either both horizontal or both vertical, will disappear from that side. However, at the same time, two new scratch marks, one horizontal and one vertical, will appear on the other side. If there are less than two horizontal and less than two vertical scratch marks on the side being rubbed, then nothing happens. If RyNo continues to rub its body against trees, is it possible that at some point in time, the numbers of horizontal and vertical scratch marks have interchanged on each side of its body?

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We call $A_{1},A_{2},A_{3}$ [i]mangool[/i] iff there is a permutation $\pi$ that $A_{\pi(2)}\not\subset A_{\pi(1)},A_{\pi(3)}\not\subset A_{\pi(1)}\cup A_{\pi(2)}$. A good family is a family of finite subsets of $\mathbb N$ like $X,A_{1},A_{2},\dots,A_{n}$. To each goo family we correspond a graph with vertices $\{A_{1},A_{2},\dots,A_{n}\}$. Connect $A_{i},A_{j}$ iff $X,A_{i},A_{j}$ are mangool sets. Find all graphs that we can find a good family corresponding to it.

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

A set $S$ of integers is Balearic, if there are two (not necessarily distinct) elements $s,s'\in S$ whose sum $s+s'$ is a power of two; otherwise it is called a non-Balearic set. Find an integer $n$ such that $\{1,2,\ldots,n\}$ contains a 99-element non-Balearic set, whereas all the 100-element subsets are Balearic.

At each vertex of a regular $2008$-gon is placed a coin. We choose two coins and move each of them to an adjacent vertex, one in the clock-wise direction and the other in the anticlock-wise direction. Determine whether or not it is possible, by making several such pairs of moves, to move all the coins into (a) $8$ heaps of $251$ coins each, (b) $251$ heaps of $8$ coins each.

[u]Round 1[/u] [b]p1.[/b] A party is attended by ten people (men and women). Among them is Pat, who always lies to people of the opposite gender and tells the truth to people of the same gender. Pat tells five of the guests: “There are more men than women at the party.” Pat tells four of the guests: “There are more women than men at the party.” Is Pat a man or a woman? [b]p2.[/b] Once upon a time in a land far, far away there lived $100$ knights, $99$ princesses, and $101$ dragons. Over time, knights beheaded dragons, dragons ate princesses, and princesses poisoned knights. But they always obeyed an ancient law that prohibits killing any creature who has killed an odd number of others. Eventually only one creature remained alive. Could it have been a knight? A dragon? A princess? [b]p3.[/b] The numbers $1 \circ 2 \circ 3 \circ 4 \circ 5 \circ 6 \circ 7 \circ 8 \circ 9 \circ 10$ are written in a line. Alex and Vicky play a game, taking turns inserting either an addition or a multiplication symbol between adjacent numbers. The last player to place a symbol wins if the resulting expression is odd and loses if it is even. Alex moves first. Who wins? (Remember that multiplication is performed before addition.) [b]p4.[/b] A chess tournament had $8$ participants. Each participant played each other participant once. The winner of a game got $1$ point, the loser $0$ points, and in the case of a draw each got $1/2$ a point. Each participant scored a different number of points, and the person who got $2$nd prize scored the same number of points as the $5$th, $6$th, $7$th and $8$th place participants combined. Can you determine the result of the game between the $3$rd place player and the $5$th place player? [b]p5.[/b] One hundred gnomes sit in a circle. Each gnome gets a card with a number written on one side and a different number written on the other side. Prove that it is possible for all the gnomes to lay down their cards so that no two neighbors have the same numbers facing up. [u]Round 2[/u] [b]p6.[/b] A casino machine accepts tokens of $32$ different colors, one at a time. For each color, the player can choose between two fixed rewards. Each reward is up to $\$10$ cash, plus maybe another token. For example, a blue token always gives the player a choice of getting either $\$5$ plus a red token or $\$3$ plus a yellow token; a black token can always be exchanged either for $\$10$ (but no token) or for a brown token (but no cash). A player may keep playing as long as he has a token. Rob and Bob each have one white token. Rob watches Bob play and win $\$500$. Prove that Rob can win at least $\$1000$. [img]https://cdn.artofproblemsolving.com/attachments/6/6/e55614bae92233c9b2e7d66f5f425a18e6475a.png[/img] [b]p7.[/b] Each of the $100$ residents of Pleasantville has at least $30$ friends in town. A resident votes in the mayoral election only if one of her friends is a candidate. Prove that it is possible to nominate two candidates for mayor so that at least half of the residents will vote. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider partitions of an $n \times n$ square (composed of $n^2$ unit squares) into rectangles with one integer side and the other side equal to $1$. What is the largest possible number of such partitions among which no two have an identical rectangle at the same place?

We have a closed path on a vertices of a $ n$×$ n$ square which pass from each vertice exactly once . prove that we have two adjacent vertices such that if we cut the path from these points then length of each pieces is not less than quarter of total path .

Let $n \geqslant 100$ be an integer. Ivan writes the numbers $n, n+1, \ldots, 2 n$ each on different cards. He then shuffles these $n+1$ cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.

In a town there are four pubs, $A,B,C,D$, and any two of them are connected to each other except $A$ and $D$. A drunkard wanders about the pubs starting with $A$ and, after having a drink, goes to any of the pubs directly connected, with equal probability. (a) What is the probability that the drunkard is at $C$ at its fifth drink? (b) Where is the drunkard most likely to be after $n$ drinks ($n > 5$)?

Let $n$ and $k$ be integers with $k\leq n-2$. The absolute value of the sum of elements of any $k$-element subset of $\{a_1,a_2,\cdots,a_n\}$ is less than or equal to 1. Show that: If $|a_1|\geq1$, then for any $2\leq i \leq n$, we have: $$|a_1|+|a_i|\leq2$$

Shiori places seven books, numbered from $1$ to $7$, on a bookshelf in some order. Later, she discovers that she can place two dividers between the books, separating the books into left, middle, and right sections, such that: $\bullet$ The left section is numbered in increasing order from left to right, or has at most one book. $\bullet$ The middle section is numbered in decreasing order from left to right, or has at most one book. $\bullet$ The right section is numbered in increasing order from left to right, or has at most one book. In how many possible orderings could Shiori have placed the books? For example, $(2, 3, 5, 4, 1, 6, 7)$ and $(2, 3, 4, 1, 5, 6, 7)$ are possible orderings with the partitions $2, 3, 5|4, 1|6, 7$ and $2, 3, 4|1|5, 6, 7$, but $(5, 6, 2, 4, 1, 3, 7)$ is not.

On the planet Mars there are $100$ states that are in dispute. To achieve a peace situation, blocs must be formed that meet the following two conditions: (1) Each block must have at most $50$ states. (2) Every pair of states must be together in at least one block. Find the minimum number of blocks that must be formed.

From an equilateral triangle with side 2014 we cut off another equilateral triangle with side 214, such that both triangles have one common vertex and two of the side of the smaller triangles lie on two of the side of the bigger triangle. Is it possible to cover this figure with figures in the picture without overlapping (rotation is allowed) if all figures are made of equilateral triangles with side 1? Explain the answer! [asy] import olympiad; unitsize(20); pair A,B,C,D,E,F,G,H; A=(0,0); B=(1,0); C=rotate(60)*B; D=rotate(60)*C; E=rotate(60)*D; F=rotate(60)*E; G=rotate(60)*F; draw(A--B); draw(A--C); draw(A--D); draw(A--E); draw(A--F); draw(A--G); draw(B--C--D--E--F--G--B); A=(2,0); B=A+(1,0); C=A+rotate(60)*(B-A); D=A+rotate(60)*(C-A); E=A+rotate(120)*(D-A); F=A+rotate(60)*(E-A); G=2*F-E; H=2*C-D; draw(A--D--C--A--B--C--H--B--G--F--E--A--F--B); A=(4,0); B=A+(1,0); C=A+rotate(-60)*(B-A); D=B+rotate(60)*(C-B); E=B+rotate(60)*(D-B); F=B+rotate(60)*(E-B); G=E+rotate(60)*(D-E); H=E+rotate(60)*(G-E); draw(A--B--C--A); draw(C--D--B); draw(D--E--B); draw(B--F--E); draw(E--G--D); draw(E--H--G); A=(8.5,0.5); B=A+(1,0); C=A+rotate(60)*(B-A); D=A+rotate(60)*(C-A); E=A+rotate(60)*(D-A); F=A+rotate(60)*(E-A); G=A+rotate(60)*(F-A); H=G+rotate(60)*(F-G); draw(A--B); draw(A--C); draw(A--D); draw(A--E); draw(A--F); draw(A--G); draw(B--C); draw(D--E--F--G--B); draw(G--H--F);[/asy]

[u]Round 1[/u] [b]p1.[/b] Alex is on a week-long mining quest. Each morning, she mines at least $1$ and at most $10$ diamonds and adds them to her treasure chest (which already contains some diamonds). Every night she counts the total number of diamonds in her collection and finds that it is divisible by either $22$ or $25$. Show that she miscounted. [b]p2.[/b] Hermione set out a row of $11$ Bertie Bott’s Every Flavor Beans for Ron to try. There are $5$ chocolateflavored beans that Ron likes and $6$ beans flavored like earwax, which he finds disgusting. All beans look the same, and Hermione tells Ron that a chocolate bean always has another chocolate bean next to it. What is the smallest number of beans that Ron must taste to guarantee he finds a chocolate one? [b]p3.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [b]p4.[/b] There are $100$ food trucks in a circle and $10$ gnomes who sample their menus. For the first course, all the gnomes eat at different trucks. For each course after the first, gnome #$1$ moves $1$ truck left or right and eats there; gnome #$2$ moves $2$ trucks left or right and eats there; ... gnome #$10$ moves $10$ trucks left or right and eats there. All gnomes move at the same time. After some number of courses, each food truck had served at least one gnome. Show that at least one gnome ate at some food truck twice. [b]p5.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company lays lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses.The Edison lighting company hangs strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [u]Round 2[/u] [b]p6.[/b] What is the largest number of zeros that could appear at the end of $1^n + 2^n + 3^n + 4^n$, where n can be any positive integer? [b]p7.[/b] A tennis academy has $2023$ members. For every group of 1011 people, there is a person outside of the group who played a match against everyone in it. Show there is someone who has played against all $2022$ other members. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider a $10 \times 10$ grid. On every move, we colour $4$ unit squares that lie in the intersection of some two rows and two columns. A move is allowed if at least one of the $4$ squares is previously uncoloured. What is the largest possible number of moves that can be taken to colour the whole grid?