The $49$ numbers $2,3,4,...,49,50$ are written on the blackboard . An allowed operation consists of choosing two different numbers $a$ and $b$ of the blackboard such that $a$ is a multiple of $b$ and delete exactly one of the two. María performs a sequence of permitted operations until she observes that it is no longer possible to perform any more. Determine the minimum number of numbers that can remain on the board at that moment.

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]R4.16 / P1.4[/b] Adam and Becky are building a house. Becky works twice as fast as Adam does, and they both work at constant speeds for the same amount of time each day. They plan to finish building in $6$ days. However, after $2$ days, their friend Charlie also helps with building the house. Because of this, they finish building in just $5$ days. What fraction of the house did Adam build? [b]R4.17[/b] A bag with $10$ items contains both pencils and pens. Kanye randomly chooses two items from the bag, with replacement. Suppose the probability that he chooses $1$ pen and $1$ pencil is $\frac{21}{50}$ . What are all possible values for the number of pens in the bag? [b]R4.18 / P2.8[/b] In cyclic quadrilateral $ABCD$, $\angle ABD = 40^o$, and $\angle DAC = 40^o$. Compute the measure of $\angle ADC$ in degrees. (In cyclic quadrilaterals, opposite angles sum up to $180^o$.) [b]R4.19 / P2.6[/b] There is a strange random number generator which always returns a positive integer between $1$ and $7500$, inclusive. Half of the time, it returns a uniformly random positive integer multiple of $25$, and the other half of the time, it returns a uniformly random positive integer that isn’t a multiple of $25$. What is the probability that a number returned from the generator is a multiple of $30$? [b]R4.20 / P2.7[/b] Julia is shopping for clothes. She finds $T$ different tops and $S$ different skirts that she likes, where $T \ge S > 0$. Julia can either get one top and one skirt, just one top, or just one skirt. If there are $50$ ways in which she can make her choice, what is $T - S$? [u]Set 5[/u] [b]R5.21[/b] A $5 \times 5 \times 5$ cube’s surface is completely painted blue. The cube is then completely split into $ 1 \times 1 \times 1$ cubes. What is the average number of blue faces on each $ 1 \times 1 \times 1$ cube? [b]R5.22 / P2.10[/b] Find the number of values of $n$ such that a regular $n$-gon has interior angles with integer degree measures. [b]R5.23[/b] $4$ positive integers form an geometric sequence. The sum of the $4$ numbers is $255$, and the average of the second and the fourth number is $102$. What is the smallest number in the sequence? [b]R5.24[/b] Let $S$ be the set of all positive integers which have three digits when written in base $2016$ and two digits when written in base $2017$. Find the size of $S$. [b]R5.25 / P3.12[/b] In square $ABCD$ with side length $13$, point $E$ lies on segment $CD$. Segment $AE$ divides $ABCD$ into triangle $ADE$ and quadrilateral $ABCE$. If the ratio of the area of $ADE$ to the area of $ABCE$ is $4 : 11$, what is the ratio of the perimeter of $ADE$ to the perimeter of $ABCE$? [u]Set 6[/u] [b]R6.26 / P6.25[/b] Submit a decimal n to the nearest thousandth between $0$ and $200$. Your score will be $\min (12, S)$, where $S$ is the non-negative difference between $n$ and the largest number less than or equal to $n$ chosen by another team (if you choose the smallest number, $S = n$). For example, 1.414 is an acceptable answer, while $\sqrt2$ and $1.4142$ are not. [b]R6.27 / P6.27[/b] Guang is going hard on his YNA project. From $1:00$ AM Saturday to $1:00$ AM Sunday, the probability that he is not finished with his project $x$ hours after $1:00$ AM on Saturday is $\frac{1}{x+1}$ . If Guang does not finish by 1:00 AM on Sunday, he will stop procrastinating and finish the project immediately. Find the expected number of minutes $A$ it will take for him to finish his project. An estimate of $E$ will earn $12 \cdot 2^{-|E-A|/60}$ points. [b]R6.28 / P6.28[/b] All the diagonals of a regular $100$-gon (a regular polygon with $100$ sides) are drawn. Let $A$ be the number of distinct intersection points between all the diagonals. Find $A$. An estimate of $E$ will earn $12 \cdot \left(16 \log_{10}\left(\max \left(\frac{E}{A},\frac{A}{E}\right)\right)+ 1\right)^{-\frac12}$ or $0$ points if this expression is undefined. [b]R6.29 / P6.29 [/b]Find the smallest positive integer $A$ such that the following is true: if every integer $1, 2, ..., A$ is colored either red or blue, then no matter how they are colored, there are always 6 integers among them forming an increasing arithmetic progression that are all colored the same color. An estimate of $E$ will earn $12 min \left(\frac{E}{A},\frac{A}{E}\right)$ points or $0$ points if this expression is undefined. [b]R6.30 / P6.30[/b] For all integers $n \ge 2$, let $f(n)$ denote the smallest prime factor of $n$. Find $A =\sum^{10^6}_{n=2}f(n)$. In other words, take the smallest prime factor of every integer from $2$ to $10^6$ and sum them all up to get $A$. You may find the following values helpful: there are $78498$ primes below $10^6$, $9592$ primes below $10^5$, $1229$ primes below $10^4$, and $168$ primes below $10^3$. An estimate of $E$ will earn $\max \left(0, 12-4 \log_{10}(max \left(\frac{E}{A},\frac{A}{E}\right)\right)$ or $0$ points if this expression is undefined. PS. You should use hide for answers. R1-15 /P1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2786721p24495629]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABCD$ be a square with the side of $20$ units. Amir divides this square into $400$ unit squares. Reza then picks $4$ of the vertices of these unit squares. These vertices lie inside the square $ABCD$ and define a rectangle with the sides parallel to the sides of the square $ABCD.$ There are exactly $24$ unit squares which have at least one point in common with the sides of this rectangle. Find all possible values for the area of a rectangle with these properties. [hide="Note"][i]Note:[/i] Vid changed to Amir, and Eva change to Reza![/hide]

For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim. Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant? [i]Proposed by Brandon Wang and Edward Wan[/i]

Is it possible to fill the cells of a table of size $2019\times2019$ with pairwise distinct positive integers in such a way that in each rectangle of size $1\times2$ or $2\times1$ the larger number is divisible by the smaller one, and the ratio of the largest number in the table to the smallest one is at most $2019?$

Let $M$ be the set of the vertices of a regular hexagon, our Olympiad symbol. How many chains $\emptyset \subset A \subset B \subset C \subset D \subset M$ of six different set, beginning with the empty set and ending with the $M$, are there?

Arnim and Brentano have a little vase with $1500$ candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat $7$ candies or take $6$ candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?

On a highway, a pedestrian and a cyclist were going in the same direction, while a cart and a car were coming from the opposite direction. All were travelling at different constant speeds. The cyclist caught up with the pedestrian at $10$ o'clock. After a time interval, she met the cart, and after another time interval equal to the first, she met the car. After a third time interval, the car met the pedestrian, and after another time interval equal to the third, the car caught up with the cart. If the pedestrian met the car at $11$ o'clock, when did he meet the cart?

In a football league, whenever a player is transferred from a team $X$ with $x$ players to a team $Y$ with $y$ players, the federation is paid $y-x$ billions liras by $Y$ if $y \geq x$, while the federation pays $x-y$ billions liras to $X$ if $x > y$. A player is allowed to change as many teams as he wishes during a season. Suppose that a season started with $18$ teams of $20$ players each. At the end of the season, $12$ of the teams turn out to have again $20$ players, while the remaining $6$ teams end up with $16,16, 21, 22, 22, 23$ players, respectively. What is the maximal amount the federation may have won during the season?

If $a$ and $b$ are selected uniformly from $\{0,1,\ldots,511\}$ without replacement, the expected number of $1$'s in the binary representation of $a+b$ can be written in simplest from as $\tfrac{m}{n}$. Compute $m+n$.

Let $n$ be a positive integer, the players A and B play the following game: we have $n$ balls with the numbers of $1, 2, 3, 4,...., n$ this balls will be in two boxes with the symbols $\prod$ and $\sum$. In your turn, the player can choose one ball and the player will put this ball in some box, in the final all the balls of the box $\prod$ are multiplied and we will get a number $P$, after this all the balls of the box $\sum$ are added up and we will get a number $Q$(if the box $\prod$ is empty $P = 1$, if the box $\sum$ is empty $Q = 0$). The player(s) play alternately, player A starts, if $P + Q$ is even player A wins, otherwise player B wins. a)If $n= 6$, which player has the winning strategy??? b)If $n = 2012$, which player has the winning strategy???

Let $A=\{1,2,\ldots,2012\}, \: B=\{1,2,\ldots,19\}$ and $S$ be the set of all subsets of $A.$ Find the number of functions $f : S\to B$ satisfying $f(A_1\cap A_2)=\min\{f(A_1),f(A_2)\}$ for all $A_1, A_2 \in S.$

On a $5 \times 5$ board, $n$ white markers are positioned, each marker in a distinct $1 \times 1$ square. A smart child got an assignment to recolor in black as many markers as possible, in the following manner: a white marker is taken from the board, it is colored in black, and then put back on the board on an empty square such that none of the neighboring squares contains a white marker (two squares are called neighboring if they share a common side). If it is possible for the child to succeed in coloring all the markers black, we say that the initial positioning of the markers was [i]good[/i]. a) Prove that if $n = 20$, then a [i]good [/i] initial positioning exists. b) Prove that if $n = 21$, then a [i]good [/i] initial positioning does not exist.

Suppose that $S$ is a finite set of real numbers with the property that any two distinct elements of $S$ form an arithmetic progression with another element in $S$. Give an example of such a set with 5 elements and show that no such set exists with more than $5$ elements.

Let $S$ be a subset with $673$ elements of the set $\{1,2,\ldots ,2010\}$. Prove that one can find two distinct elements of $S$, say $a$ and $b$, such that $6$ divides $a+b$.

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)

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.

the code system of a new 'MO lock' is a regular $n$-gon,each vertex labelled a number $0$ or $1$ and coloured red or blue.it is known that for any two adjacent vertices,either their numbers or colours coincide. find the number of all possible codes(in terms of $n$).

Define a $ k$-[i]clique[/i] to be a set of $ k$ people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.

a) One has a set of stones with weights $1, 2, \ldots, 20$ grams. Find all $k$ for which it is possible to place $k$ and the rest $20-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. b) One has a set of stones with weights $1, 2, \ldots, 51$ grams. Find all $k$ for which it is possible to place $k$ and the rest $51-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. c) One has a set of stones with weights $1, 2, \ldots, n$ grams ($n\in\mathbb{N}$). Find all $n$ and $k$ for which it is possible to place $k$ and the rest $n-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. [size=75] a) and b) were proposed at the festival, c) is a generalization[/size]

Let $ S$ be a set of $ 6n$ points in a line. Choose randomly $ 4n$ of these points and paint them blue; the other $ 2n$ points are painted green. Prove that there exists a line segment that contains exactly $ 3n$ points from $ S$, $ 2n$ of them blue and $ n$ of them green.

Let $n \geq 3$ be an integer, and consider a set of $n$ points in three-dimensional space such that: [list=i] [*] every two distinct points are connected by a string which is either red, green, blue, or yellow; [*] for every three distinct points, if the three strings between them are not all of the same colour, then they are of three different colours; [*] not all the strings have the same colour. [/list] Find the maximum possible value of $n$.

Let the vertex set \( V \) of a graph be partitioned into \( h \) parts \( (V = V_1 \cup V_2 \cup \cdots \cup V_h) \), with \(|V_1| = n_1, |V_2| = n_2, \ldots, |V_h| = n_h \). If there is an edge between any two vertices only when they belong to different parts, the graph is called a complete \( h \)-partite graph, denoted as \( k(n_1, n_2, \ldots, n_h) \). Let \( n \) and \( r \) be positive integers, \( n \geq 6 \), \( r \leq \frac{2}{3}n \). Consider the complete \( r + 1 \)-partite graph \( k\left(\underbrace{1, 1, \ldots, 1}_{r}, n - r\right) \). Answer the following questions: 1. Find the maximum number of disjoint circles (i.e., circles with no common vertices) in this complete \( r + 1 \)-partite graph. 2. Given \( n \), for all \( r \leq \frac{2}{3}n \), find the maximum number of edges in a complete \( r + 1 \)-partite graph \( k(1, 1, \ldots, 1, n - r) \) where no more than one circle is disjoint.

Tireless Thomas and Jeremy construct a sequence. At the beginning there is one positive integer in the sequence. Then they successively write new numbers in the sequence in the following way: Thomas obtains the next number by adding to the previous number one of its (decimal) digits, while Jeremy obtains the next number by subtracting from the previous number one of its digits. Prove that there is a number in this sequence which will be repeated at least $100$ times. (A Shapovalov)