Find the maximum number of different integers that can be selected from the set $ \{1,2,...,2013\}$ so that no two exist that their difference equals to $17$.

Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.

A single player game has the following rules: initially, there are $10$ piles of stones with $1,2,...,10$ stones, respectively. A movement consists on making one of the following operations: i) to choose $2$ piles, both of them with at least $2$ stones, combine them and then add $2$ stones to the new pile; ii) to choose a pile with at least $4$ stones, remove $2$ stones from it, and then split it into two piles with amount of piles to be chosen by the player. The game continues until is not possible to make an operation. a) Give an example of a sequence of moves leading to the end of the game. b) Make a table with the total number of stones and the number of piles before and after the first 5 operations in your example above. c) Show that the number of piles with one stone in the end of the game is always the same, no matter how the movements are made.

Given is a set of $n\ge5$ people and $m$ commissions with $3$ persons in each. Let all the commissions be [i]nice[/i] if there are no two commissions $A$ and $B$, such that $\mid A\cap B\mid=1$. Find the biggest possible $m$ (as a function of $n$).

A [i]lattice point[/i] in the plane is a point with integer coordinates. Let $T$ be a triangle in the plane whose vertice are lattice points, but with no other lattice points on its sides. Furthermore, suppose $T$ contains exactly four lattice points in its interior. Prove that these four points lie on a straight line.

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats, and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were there in each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $50$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a 6 cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $150$ coins? [b]p3.[/b] Pinocchio multiplied two $2$ digit numbers. But witch Masha erased some of the digits. The erased digits are the ones marked with a $*$. Could you help Pinocchio to restore all the erased digits? $\begin{tabular}{ccccc} & & & 9 & 5 \\ x & & & * & * \\ \hline & & & * & * \\ + & 1 & * & * & \\ \hline & * & * & * & * \\ \end{tabular}$ Find all solutions. [b]p4.[/b] There are $50$ senators and $435$ members of House of Representatives. On Friday all of them voted a very important issue. Each senator and each representative was required to vote either "yes" or "no". The announced results showed that the number of "yes" votes was greater than the number of "no" votes by $24$. Prove that there was an error in counting the votes. [b]p5.[/b] Was there a year in the last millennium (from $1000$ to $2000$) such that the sum of the digits of that year is equal to the product of the digits? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There is a frog in every vertex of a regular 2n-gon with circumcircle($n \geq 2$). At certain time, all frogs jump to the neighborhood vertices simultaneously (There can be more than one frog in one vertex). We call it as $\textsl{a way of jump}$. It turns out that there is $\textsl{a way of jump}$ with respect to 2n-gon, such that the line connecting any two distinct vertice having frogs on it after the jump, does not pass through the circumcentre of the 2n-gon. Find all possible values of $n$.

Henry invited $2N$ guests to his birthday party. He has $N$ white hats and $N$ black hats. He wants to place hats on his guests and split his guests into one or several dancing circles so that in each circle there would be at least two people and the colors of hats of any two neighbours would be different. Prove that Henry can do this in exactly $(2N)!$ different ways. (All the hats with the same color are identical, all the guests are obviously distinct, $(2N)! = 1 \cdot 2 \cdot . . . \cdot (2N)$.) Gleb Pogudin

Show how to divide space into (a) congruent tetrahedra, (b) congruent “equifaced” tetrahedra. (A tetrahedron is called equifaced if all its faces are congruent triangles.) (NB Vassiliev)

[b](9.7)[/b] On the segment $[0, 2002]$ its ends and the point with coordinate $d$ are marked, where $d$ is a coprime number to $1001$. It is allowed to mark the midpoint of any segment with ends at the marked points, if its coordinate is integer. Is it possible, by repeating this operation several times, to mark all the integer points on a segment? [b](10.7)[/b] On the segment $[0, 2002]$ its ends and $n-1 > 0$ integer points are marked so that the lengths of the segments into which the segment $ [0, 2002]$ is divided are corpime in the total (i.e., have no common divisor greater than $1$). It is allowed to divide any segment with marked ends into $n$ equal parts and mark the division points if they are all integers. (The point can be marked a second time, but it remains marked.) Is it possible, by repeating this operation several times, mark all the integer points on the segment? [b](11.8)[/b] On the segment $ [0,N]$ its ends and $2 $ more points are marked so that the lengths segments into which the segment $[0,N]$ is divided are integer and coprime in total. If there are two marked points $A$ and $B$ such that the distance between them is a multiple of $3$, then we can divide from cutting $AB$ by $3$ equal parts, mark one of the division points and erase one of the points $A, B$. Is it true that for several such actions you can mark any predetermined integer point of the segment $[0,N]$?

Find all positive integers $N$ such that an $N\times N$ board can be tiled using tiles of size $5\times 5$ or $1\times 3$. Note: The tiles must completely cover all the board, with no overlappings.

Initially numbers from 1 to 1000000 are all colored black. A move consists of picking one number, then change the color (black to white or white to black) of itself and all other numbers NOT coprime with the chosen number. Can all numbers become white after finite numbers of moves? Edited by pbornsztein

Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.

$k$ marbles are placed onto the cells of a $2024 \times 2024$ grid such that each cell has at most one marble and there are no two marbles are placed onto two neighboring cells (neighboring cells are defined as cells having an edge in common). a) Assume that $k=2024$. Find a way to place the marbles satisfying the conditions above, such that moving any placed marble to any of its neighboring cells will give an arrangement that does not satisfy both the conditions. b) Determine the largest value of $k$ such that for all arrangements of $k$ marbles satisfying the conditions above, we can move one of the placed marble onto one of its neighboring cells and the new arrangement satisfies the conditions above.

A $3 \times 3$ square is filled with numbers: $a, b, c, d, e, f, g, h, i$ in the following way: [img]https://cdn.artofproblemsolving.com/attachments/8/9/737c41e9d0dbfdc81be1b986b8e680290db55e.png[/img] Given that the square is magic (sums of the numbers in each row, column and each of two diagonals are the same), show that a) $2(a + c + g + i) = b + d + f + h + 4e$. (3) b) $2(a^3 + c^3 + g^3 + i^3) = b^3 + d^3 + f^3 + h^3 + 4e^3$. (3)

Several square-shaped papers are situated on a table such that every side of the paper is positioned parallel to the sides of the table. Each paper has a colour, and there are $n$ different coloured papers. It is known that for every $n$ papers with distinct colors, we can always find an overlapping pair of papers. Prove that, using $2n- 2$ nails, it is possible to hammer all the squares of a certain colour to the table.

The cells of the $9 \times 9$ table are colored black and white. It turned out, that there were $k$ rows, in each of which there are more black cells than white ones white, and there were $k$ columns, each of which contained more than black. At what highest $ k$ is this possible?

We are given tiles in the form of right angled triangles having perpendicular sides of length $1$ cm and $2$ cm. Is it possible to form a square from $20$ such tiles? ( S . Fomin , Leningrad)

Maria wants to solve a challenge with a deck of cards, each with a different figure. Initially, the cards are distributed randomly into two piles, not necessarily in equal parts. Maria's goal is to get all the cards into the same pile. On each turn, Maria takes the top card from each pile and compares them. In the rule book, there's a table that indicates, for each card match, which of the two wins. Both cards are then placed on the bottom of the winning card in the order Maria chooses. The challenge ends when all the cards are in one pile. Show that it is always possible for Maria to solve the challenge. Regardless of the initial distribution of the cards and the table in the rule book.

On a plane, $n$ straight lines are drawn. Two domains are called [i]adjacent [/i] if they border by a line segment. Prove that the domains into which the plane is divided by these lines can be painted two colors so that no two [i]adjacent [/i] domains are of the same color.

Consider the set $M=\{1,2,3,...,2020\}.$ Find the smallest positive integer $k$ such that for any subset $A$ of $M$ with $k$ elements, there exist $3$ distinct numbers $a,b,c$ from $M$ such that $a+b, b+c$ and $c+a$ are all in $A.$

The problem committee of a mathematical olympiad prepares some variants of the contest. Each variant contains $4$ problems, chosen from a shortlist of $n$ problems, and any two variants have at most one problem in common. (a) If $n = 14$, determine the largest possible number of variants the problem committee can prepare. (b) Find the smallest value of n such that it is possible to prepare ten variants of the contest.

Six points are given so that there are not three on the same line and that the lengths of the segments determined by these points are all different. We consider all the triangles that they have their vertices at these points. Show that there is a segment that is both the shortest side of one of those triangles and the longest side of another.

A Magician and a Detective play a game. The Magician lays down cards numbered from $1$ to $52$ face-down on a table. On each move, the Detective can point to two cards and inquire if the numbers on them are consecutive. The Magician replies truthfully. After a finite number of moves, the Detective points to two cards. She wins if the numbers on these two cards are consecutive, and loses otherwise. Prove that the Detective can guarantee a win if and only if she is allowed to ask at least $50$ questions. [i]Proposed by Anant Mudgal[/i]

In the figures, the vertices are marked with a circle. The segments that join vertices are called paths. Non-negative integers are distributed to the vertices and, to the paths, the differences between the numbers at their ends. [img]https://cdn.artofproblemsolving.com/attachments/d/6/e6fce93719a5b35dbf34d58652b01a8631de57.gif[/img] We will say that a distribution of numbers is [i]graceful [/i] if all the numbers from $1$ to $n$ appear in the paths, where $n$ is the number of paths. The following is an example of graceful distribution: [img]https://cdn.artofproblemsolving.com/attachments/1/1/a8c2b4fde673ca902b655804c4f5321f9666e9.gif[/img] Give -if possible- a graceful distribution for the following figures. If you can't do it, show why.