There are $1001$ stacks of coins $S_1, S_2, \dots, S_{1001}$. Initially, stack $S_k$ has $k$ coins for each $k = 1,2,\dots,1001$. In an operation, one selects an ordered pair $(i,j)$ of indices $i$ and $j$ satisfying $1 \le i < j \le 1001$ subject to two conditions: [list] [*]The stacks $S_i$ and $S_j$ must each have at least $1$ coin. [*]The ordered pair $(i,j)$ must [i]not[/i] have been selected before. [/list] Then, if $S_i$ and $S_j$ have $a$ coins and $b$ coins respectively, one removes $\gcd(a,b)$ coins from each stack. What is the maximum number of times this operation could be performed? [i]Galin Totev[/i]

A point is chosen inside a regular $k$-gon in such a way that its orthogonal projections on to the sides all meet the respective sides at interior points. These points divide the sides into $2k$ segments. Let these segments be enumerated consecutively by the numbers $1,2, 3, ... ,2k$. Prove that the sum of the lengths of the segments having even numbers equals the sum of the segments having odd numbers. (A Andjans, Riga)

Three doctors, four nurses, and three patients stand in a line in random order. The probability that there is at least one doctor and at least one nurse between each pair of patients is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

For positive integers $n$ consider the lattice points $S_n=\{(x,y,z):1\le x\le n, 1\le y\le n, 1\le z\le n, x,y,z\in \mathbb N\}.$ Is it possible to find a positive integer $n$ for which it is possible to choose more than $n\sqrt{n}$ lattice points from $S_n$ such that for any two chosen lattice points at least two of the coordinates of one is strictly greater than the corresponding coordinates of the other? [I]Proposed by Endre Csóka, Budapest[/i]

There are three types of piece shown as below. Today Alice wants to cover a $100 \times 101$ board with these pieces without gaps and overlaps. Determine the minimum number of $1\times 1$ pieces should be used to cover the whole board and not exceed the board. (There are an infinite number of these three types of pieces.) [asy] size(9cm,0); defaultpen(fontsize(12pt)); draw((9,10) -- (59,10) -- (59,60) -- (9,60) -- cycle); draw((59,10) -- (109,10) -- (109,60) -- (59,60) -- cycle); draw((9,60) -- (59,60) -- (59,110) -- (9,110) -- cycle); draw((9,110) -- (59,110) -- (59,160) -- (9,160) -- cycle); draw((109,10) -- (159,10) -- (159,60) -- (109,60) -- cycle); draw((180,11) -- (230,11) -- (230,61) -- (180,61) -- cycle); draw((180,61) -- (230,61) -- (230,111) -- (180,111) -- cycle); draw((230,11) -- (280,11) -- (280,61) -- (230,61) -- cycle); draw((230,61) -- (280,61) -- (280,111) -- (230,111) -- cycle); draw((280,11) -- (330,11) -- (330,61) -- (280,61) -- cycle); draw((280,61) -- (330,61) -- (330,111) -- (280,111) -- cycle); draw((330,11) -- (380,11) -- (380,61) -- (330,61) -- cycle); draw((330,61) -- (380,61) -- (380,111) -- (330,111) -- cycle); draw((401,11) -- (451,11) -- (451,61) -- (401,61) -- cycle); [/asy] [i]Proposed by amano_hina[/i]

Given several nonnegative integers (repetitions allowed), the allowed operation is to choose a positive integer $a$ and replace each number $b$ greater than or equal to $a$ by $b-a$ (the numbers $a$ , if any, are replaced by $0$). Initially, the integers from $1$ are written on the blackboard until $2013$ inclusive. After a few operations the numbers on the board have a sum equal to $10$. Determine what the numbers that remained on the board could be. Find all the possibilities.

Let $n \geq 3$ be an odd number and suppose that each square in a $n \times n$ chessboard is colored either black or white. Two squares are considered adjacent if they are of the same color and share a common vertex and two squares $a,b$ are considered connected if there exists a sequence of squares $c_1,\ldots,c_k$ with $c_1 = a, c_k = b$ such that $c_i, c_{i+1}$ are adjacent for $i=1,2,\ldots,k-1$. \\ \\ Find the maximal number $M$ such that there exists a coloring admitting $M$ pairwise disconnected squares.

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

There are $2016$ costumers who entered a shop on a particular day. Every customer entered the shop exactly once. (i.e. the customer entered the shop, stayed there for some time and then left the shop without returning back.) Find the maximal $k$ such that the following holds: There are $k$ customers such that either all of them were in the shop at a specic time instance or no two of them were both in the shop at any time instance.

Alice and Bob take turns taking balloons from a box containing infinitely many balloons. In the first turn, Alice takes $k_1$ amount of balloons, where $\gcd(30;k_1)\neq1$. Then, on his first turn, Bob takes $k_2$ amount of ballons where $k_1<k_2<2k_1$. After first turn, Alice and Bob alternately takes as many balloons as his/her partner has. Is it possible for Bob to take $k_2$ amount of balloons at first, such that after a finite amount of turns, one of them have a number of balloons that is a multiple of $2025^{2025}$?

Two coloured points are marked on a line, with the blue one at the left and the red one at the right. You may add to the line two neighbouring points of the same color (both red or both blue) or delete two such points (neighbouring means that there is no coloured point between these two). Prove that after several such transformation you cannot again get only two points on the line in which the red one is at the left and the blue one is at the right. (A Belov)

In January Kolya and Vasya have been assessed at school $20$ times and each has been given $20$ marks (each being an integer no greater than $5$ , with both Kolya and Vasya receiving at least twos on each occasion). Kolya has been given as many fives as Vasya fours, as many fours as Vasya threes, as many threes as Vasya twos and as many twos as Vasya fives. If each has the same average mark , determine how many twos were given to Kolya. (S . Fomin, Leningrad)

Show that the number of ordered pairs $(S,T)$ of subsets of $[n]$ satisfying $s>|T|$ for all $s\in S$ and $t>|S|$ for all $t\in T$ is equal to the Fibonacci number $F_{2n+2}$. [color=#008000] Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?p=296007#p296007 http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=515970&hilit=Putnam+1990[/color]

A candy store has $100$ pieces of candy to give away. When you get to the store, there are five people in front of you, numbered from $1$ to $5$. The $i$th person in line considers the set of positive integers congruent to $i$ modulo $5$ which are at most the number of pieces of candy remaining. If this set is empty, then they take no candy. Otherwise they pick an element of this set and take that many pieces of candy. For example, the first person in line will pick an integer from the set $\{1,6,\dots,96\}$ and take that many pieces of candy. How many ways can the first five people take their share of candy so that after they are done there are at least $35$ pieces of candy remaining?

Find all positive integers $n$ for which it is possible to partition a regular $n$-gon into triangles with diagonals not intersecting inside the $n$-gon such that at every vertex of the $n$-gon an odd number of triangles meet.

Several small villages are situated on the banks of a straight river. On one side, there are 20 villages in a row, and on the other there are 15 villages in a row. We would like to build bridges, each of which connects a village on the one side with a village on the other side. The bridges must not cross, and it should be possible to get from any village to any other village using only those bridges (and not any roads that might exist between villages on the same side of the river). How many different ways are there to build the bridges.

Find all integers $n$ for which there exists a table with $n$ rows, $2022$ columns, and integer entries, such that subtracting any two rows entry-wise leaves every remainder modulo $2022$. [i]Proposed by Tony Wang[/i]

Let $n$ be a positive integer. $2n+1$ tokens are in a row, each being black or white. A token is said to be [i]balanced[/i] if the number of white tokens on its left plus the number of black tokens on its right is $n$. Determine whether the number of [i]balanced[/i] tokens is even or odd.

For a positive integer $n$ and a subset $S$ of $\{1, 2, \dots, n\}$, let $S$ be "$n$-good" if and only if for any $x$, $y\in S$ (allowed to be same), if $x+y\leq n$, then $x+y\in S$. Let $r_n$ be the smallest real number such that for any positive integer $m\leq n$, there is always a $m$-element "$n$-good" set, so that the sum of its elements is not more than $m\cdot r_n$. Prove that there exists a real number $\alpha$ such that for any positive integer $n$, $|r_n-\alpha n|\leq 2024.$

We wish to place natural numbers around a circle such that the following property is satisfied: the absolute values of the differences of each pair of neighboring numbers are all different. a) Is it possible to place the numbers from 1 to 2009 satisfying this property b) Is it possible to suppress one of the numbers from 1 to 2009 in such a way that the remaining 2008 numbers can be placed satisfying the property

[u]Set 1[/u] [b]p1.[/b] Find $1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11$. [b]p2.[/b] Find $1 \cdot 11 + 2 \cdot 10 + 3 \cdot 9 + 4 \cdot 8 + 5 \cdot 7 + 6 \cdot 6$. [b]p3.[/b] Let $\frac{1}{1\cdot 2} +\frac{1}{2\cdot 3} +\frac{1}{3\cdot 4} +\frac{1}{4\cdot 5} +\frac{1}{5\cdot 6} +\frac{1}{6\cdot 7} +\frac{1}{7\cdot 8} +\frac{1}{8\cdot 9} +\frac{1}{9\cdot 10} +\frac{1}{10\cdot 11} =\frac{m}{n}$ , where $m$ and $n$ are positive integers that share no prime divisors. Find $m + n$. [u]Set 2[/u] [b]p4.[/b] Define $0! = 1$ and let $n! = n \cdot (n - 1)!$ for all positive integers $n$. Find the value of $(2! + 0!)(1! + 8!)$. [b]p5.[/b] Rachel’s favorite number is a positive integer $n$. She gives Justin three clues about it: $\bullet$ $n$ is prime. $\bullet$ $n^2 - 5n + 6 \ne 0$. $\bullet$ $n$ is a divisor of $252$. What is Rachel’s favorite number? [b]p6.[/b] Shen eats eleven blueberries on Monday. Each day after that, he eats five more blueberries than the day before. For example, Shen eats sixteen blueberries on Tuesday. How many blueberries has Shen eaten in total before he eats on the subsequent Monday? [u]Set 3[/u] [b]p7.[/b] Triangle $ABC$ satisfies $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ can be expressed in the form $m\sqrt{n}$, where $n$ is not divisible by the square of a prime, then determine $m + n$. [b]p8.[/b] Sebastian is playing the game Split! on a coordinate plane. He begins the game with one token at $(0, 0)$. For each move, he is allowed to select a token on any point $(x, y)$ and take it off the plane, replacing it with two tokens, one at $(x + 1, y)$, and one at $(x, y + 1)$. At the end of the game, for a token on $(a, b)$, it is assigned a score $\frac{1}{2^{a+b}}$ . These scores are summed for his total score. Determine the highest total score Sebastian can get in $100$ moves. [b]p9.[/b] Find the number of positive integers $n$ satisfying the following two properties: $\bullet$ $n$ has either four or five digits, where leading zeros are not permitted, $\bullet$ The sum of the digits of $n$ is a multiple of $3$. [u]Set 4[/u] [b]p10.[/b] [i]A unit square rotated $45^o$ about a vertex, Sweeps the area for Farmer Khiem’s pen. If $n$ is the space the pigs can roam, Determine the floor of $100n$.[/i] If $n$ is the area a unit square sweeps out when rotated 4$5$ degrees about a vertex, determine $\lfloor 100n \rfloor$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. [img]https://cdn.artofproblemsolving.com/attachments/b/1/129efd0dbd56dc0b4fb742ac80eaf2447e106d.png[/img] [b]p11.[/b][i] Michael is planting four trees, In a grid, three rows of three, If two trees are close, Then both are bulldozed, So how many ways can it be?[/i] In a three by three grid of squares, determine the number of ways to select four squares such that no two share a side. [b]p12.[/b] [i]Three sixty-seven Are the last three digits of $n$ cubed. What is $n$?[/i] If the last three digits of $n^3$ are $367$ for a positive integer $n$ less than $1000$, determine $n$. [u]Set 5[/u] [b]p13.[/b] Determine $\sqrt[4]{97 + 56\sqrt{3}} + \sqrt[4]{97 - 56\sqrt{3}}$. [b]p14. [/b]Triangle $\vartriangle ABC$ is inscribed in a circle $\omega$ of radius $12$ so that $\angle B = 68^o$ and $\angle C = 64^o$ . The perpendicular from $A$ to $BC$ intersects $\omega$ at $D$, and the angle bisector of $\angle B$ intersects $\omega$ at $E$. What is the value of $DE^2$? [b]p15.[/b] Determine the sum of all positive integers $n$ such that $4n^4 + 1$ is prime. [u]Set 6[/u] [b]p16.[/b] Suppose that $p, q, r$ are primes such that $pqr = 11(p + q + r)$ such that $p\ge q \ge r$. Determine the sum of all possible values of $p$. [b]p17.[/b] Let the operation $\oplus$ satisfy $a \oplus b =\frac{1}{1/a+1/b}$ . Suppose $$N = (...((2 \oplus 2) \oplus 2) \oplus ... 2),$$ where there are $2018$ instances of $\oplus$ . If $N$ can be expressed in the form $m/n$, where $m$ and $n$ are relatively prime positive integers, then determine $m + n$. [b]p18.[/b] What is the remainder when $\frac{2018^{1001} - 1}{2017}$ is divided by $2017$? PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777307p24369763]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On a competition called [i]"Mathematical duels"[/i] students were given $n$ problems and each student solved exactly 3 of them. For each two students there is at most one problem that is solved from both of them. Prove that, if $s\in \mathbb{N}$ is a number for which $s^2-s+1<2n$, then there are $s$ problems among the $n$, no three of which solved by one student.

Find the largest natural number $ n$ for which there exist different sets $ S_1,S_2,\ldots,S_n$ such that: $ 1^\circ$ $ |S_i\cup S_j|\leq 2004$ for each two $ 1\leq i,j\le n$ and $ 2^\circ$ $ S_i\cup S_j\cup S_k\equal{}\{1,2,\ldots,2008\}$ for each three integers $ 1\le i<j<k\le n$.

a) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$, one can find $100$ members for which $a_k > k$. b) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$ there are infinitely many such numbers $a_k$ such that $a_k > k$. (A Andjans, Riga) PS. (a) for juniors (b) for seniors

Given are $n$ different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points $A,B$.We consider $k$ distinct lines passing through $A$ and $m$ distinct lines passing through $B$.There is no line passing through both $A$ and $B$ and all the lines passing through $k$ intersect with all the lines passing through $B$.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.