Let $r\geq2$ be a fixed positive integer, and let $F$ be an infinite family of sets, each of size $r$, no two of which are disjoint. Prove that there exists a set of size $r-1$ that meets each set in $F$.

Let m be a positive integer. An $m$-[i]pattern [/i] is a sequence of $m$ symbols of strict inequalities. An $m$-pattern is said to be [i]realized [/i] by a sequence of $m + 1$ real numbers when the numbers meet each of the inequalities in the given order. (For example, the $5$-pattern $ <, <,>, < ,>$ is realized by the sequence of numbers $1, 4, 7, -3, 1, 0$.) Given $m$, which is the least integer $n$ for which there exists any number sequence $x_1,... , x_n$ such that each $m$-pattern is realized by a subsequence $x_{i_1},... , x_{i_{m + 1}}$ with $1 \le i_1 <... < i_{m + 1} \le n$?

Suppose that $p(n)$ is the number of ways to express $n$ as a sum of some naturall numbers (the two representations $4=1+1+2$ and $4=1+2+1$ are considered the same). Prove that for an infinite number of $n$'s $p(n)$ is even and for an infinite number of $n$'s $p(n)$ is odd.

Prove that there exists an absolute constant $c$ such that any set $H$ of $n$ points of the plane in general position can be coloured with $c\log n$ colours in such a way that any disk of the plane containing at least one point of $H$ intersects some colour class of $H$ in exactly one point.

Find the smallest positive integer $n$ that satisfies the following condition: For every finite set of points on the plane, if for any $n$ points from this set there exist two lines containing all the $n$ points, then there exist two lines containing all points from the set.

[u]Set 6[/u] [b]p16.[/b] Let $n! = n \times (n - 1) \times ... \times 2 \times 1$. Find the maximum positive integer value of $x$ such that the quotient $\frac{160!}{160^x}$ is an integer. [b]p17.[/b] Let $\vartriangle OAB$ be a triangle with $\angle OAB = 90^o$ . Draw points $C, D, E, F, G$ in its plane so that $$\vartriangle OAB \sim \vartriangle OBC \sim \vartriangle OCD \sim \vartriangle ODE \sim \vartriangle OEF \sim \vartriangle OFG,$$ and none of these triangles overlap. If points $O, A, G$ lie on the same line, then let $x$ be the sum of all possible values of $\frac{OG}{OA }$. Then, $x$ can be expressed in the form $m/n$ for relatively prime positive integers $m, n$. Compute $m + n$. [b]p18.[/b] Let $f(x)$ denote the least integer greater than or equal to $x^{\sqrt{x}}$. Compute $f(1)+f(2)+f(3)+f(4)$. [u]Set 7[/u] The Fibonacci sequence $\{F_n\}$ is defined as $F_0 = 0$, $F_1 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all integers $n \ge 0$. [b]p19.[/b] Find the least odd prime factor of $(F_3)^{20} + (F_4)^{20} + (F_5)^{20}$. [b]p20.[/b] Let $$S = \frac{1}{F_3F_5}+\frac{1}{F_4F_6}+\frac{1}{F_5F_7}+\frac{1}{F_6F_8}+...$$ Compute $420S$. [b]p21.[/b] Consider the number $$Q = 0.000101020305080130210340550890144... ,$$ the decimal created by concatenating every Fibonacci number and placing a 0 right after the decimal point and between each Fibonacci number. Find the greatest integer less than or equal to $\frac{1}{Q}$. [u]Set 8[/u] [b]p22.[/b] In five dimensional hyperspace, consider a hypercube $C_0$ of side length $2$. Around it, circumscribe a hypersphere $S_0$, so all $32$ vertices of $C_0$ are on the surface of $S_0$. Around $S_0$, circumscribe a hypercube $C_1$, so that $S_0$ is tangent to all hyperfaces of $C_1$. Continue in this same fashion for $S_1$, $C_2$, $S_2$, and so on. Find the side length of $C_4$. [b]p23.[/b] Suppose $\vartriangle ABC$ satisfies $AC = 10\sqrt2$, $BC = 15$, $\angle C = 45^o$. Let $D, E, F$ be the feet of the altitudes in $\vartriangle ABC$, and let $U, V , W$ be the points where the incircle of $\vartriangle DEF$ is tangent to the sides of $\vartriangle DEF$. Find the area of $\vartriangle UVW$. [b]p24.[/b] A polynomial $P(x)$ is called spicy if all of its coefficients are nonnegative integers less than $9$. How many spicy polynomials satisfy $P(3) = 2019$? [i]The next set will consist of three estimation problems.[/i] [u]Set 9[/u] Points will be awarded based on the formulae below. Answers are nonnegative integers that may exceed $1,000,000$. [b]p25.[/b] Suppose a circle of radius $20192019$ has area $A$. Let s be the side length of a square with area $A$. Compute the greatest integer less than or equal to $s$. If $n$ is the correct answer, an estimate of $e$ gives $\max \{ 0, \left\lfloor 1030 ( min \{ \frac{n}{e},\frac{e}{n}\}^{18}\right\rfloor -1000 \}$ points. [b]p26.[/b] Given a $50 \times 50$ grid of squares, initially all white, define an operation as picking a square and coloring it and the four squares horizontally or vertically adjacent to it blue, if they exist. If a square is already colored blue, it will remain blue if colored again. What is the minimum number of operations necessary to color the entire grid blue? If $n$ is the correct answer, an estimate of $e$ gives $\left\lfloor \frac{180}{5|n-e|+6}\right\rfloor$ points. [b]p27.[/b] The sphere packing problem asks what percent of space can be filled with equally sized spheres without overlap. In three dimensions, the answer is $\frac{\pi}{3\sqrt2} \approx 74.05\%$ of space (confirmed as recently as $2017!$), so we say that the packing density of spheres in three dimensions is about $0.74$. In fact, mathematicians have found optimal packing densities for certain other dimensions as well, one being eight-dimensional space. Let d be the packing density of eight-dimensional hyperspheres in eightdimensional hyperspace. Compute the greatest integer less than $10^8 \times d$. If $n$ is the correct answer, an estimate of e gives $\max \left\{ \lfloor 30-10^{-5}|n - e|\rfloor, 0 \right\}$ points. PS. You had better use hide for answers. First sets have be posted [url=https://artofproblemsolving.com/community/c4h2777330p24370124]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $N$ be the number of ways of choosing a subset of $5$ distinct numbers from the set $${10a+b:1\leq a\leq 5, 1\leq b\leq 5}$$ where $a,b$ are integers, such that no two of the selected numbers have the same units digits and no two have the same tens digit. What is the remainder when $N$ is divided by $73$?

We are given $2021$ points on a plane, no three of which are collinear. Among any $5$ of these points, at least $4$ lie on the same circle. Is it necessarily true that at least $2020$ of the points lie on the same circle?

Let $(a_1, a_2,\ldots , a_n)$ be a permutation of $1, 2, \ldots , n,$ where $n  \geq 2.$ For each $k = 1, \ldots , n$, we know that $a_k$ apples are placed at the point $k$ on the real axis. Children named $A,B,C$ are assigned respective points $x_A, x_B, x_C \in \{1, \ldots , n\}.$ For each $k,$ the children whose points are closest to $ k$ divide $a_k$ apples equally among themselves. We call $(x_A, x_B, x_C)$ a [i]stable configuration[/i] if no child’s total share can be increased by assigning a new point to this child and not changing the points of the other two. Determine the values of $n$ for which a stable configuration exists for some distribution $(a_1, \ldots, a_n)$ of the apples.

Consider an equilateral triangle with every side divided by $n$ points into $n+1$ equal parts. We put a marker on every of the $3n$ division points. We draw lines parallel to the sides of the triangle through the division points, and this way divide the triangle into $(n+1)^2$ smaller ones. Consider the following game: if there is a small triangle with exactly one vertex unoccupied, we put a marker on it and simultaneously take markers from the two its occupied vertices. We repeat this operation as long as it is possible. (a) If $n\equiv1\pmod3$, show that we cannot manage that only one marker remains. (b) If $n\equiv0$ or $n\equiv2\pmod3$, prove that we can finish the game leaving exactly one marker on the triangle.

A set of $n$ lines are said to be in [i]standard form[/i] if no two are parallel and no three are concurrent. Does there exist a value of $k$ such that given any $n$ lines in [i]standard form[/i], it is possible to colour the regions bounded by the $n$ lines using $k$ colours in such a way that no two regions of the same colour share a common intersection point of the $n$ lines?

Given $2015$ subsets $A_1, A_2,...,A_{2015}$ of the set $\{1, 2,..., 1000\}$ such that $|A_i| \ge 2$ for every $i \ge 1$ and $|A_i \cap A_j| \ge 1$ for every $1 \le i < j \le 2015$. Prove that $k = 3$ is the smallest number of colors such that we can always color the elements of the set $\{1, 2,..., 1000\}$ by $k$ colors with the property that the subset $A_i$ has at least two elements of different colors for every $i \ge 1$. Lê Anh Vinh

In the country of PUMaC-land, there are $5$ villages and $3$ cities. Vedant is building roads between the $8$ settlements according to the following rules: a) There is at most one road between any two settlements; b) Any city has exactly three roads connected to it; c) Any village has exactly one road connected to it; d) Any two settlements are connected by a path of roads. In how many ways can Vedant build the roads?

How many rooks can be placed in an $n\times n$ chessboard such that each rook is threatened by at most $2k$ rooks? (15 points) [i]Proposed by Mostafa Einollah zadeh[/i]

Let us choose arbitrarily $n$ vertices of a regular $2n$-gon and color them red. The remaining vertices are colored blue. We arrange all red-red distances into a nondecreasing sequence and do the same with the blue-blue distances. Prove that the two sequences thus obtained are identical.

We call a tiling of an $m \times n$ rectangle with corners (see figure below) "regular" if there is no sub-rectangle which is tiled with corners. Prove that if for some $m$ and $n$ there exists a "regular" tiling of the $m \times n$ rectangular then there exists a "regular" tiling also for the $2m \times 2n $ rectangle.

Ten bowls are in a circle. They will go clockwise - starting somewhere filled with $1, 2, 3, ..., 9$ or $10$ marbles. You can have two choices in every move . Add a marble to neighboring shells or from two neighboring shells - if both of them are not empty - remove one marble each. Can you achieve that after finally many moves in each bowl exactly $2011$ marbles lying?

3. We have a $n \times n$ board. We color the unit square $(i,j)$ black if $i=j$, red if $i<j$ and green if $i>j$. Let $a_{i,j}$ be the color of the unit square $(i,j)$. In each move we switch two rows and write down the $n$-tuple $(a_{1,1},a_{2,2},\cdots,a_{n,n})$. How many $n$-tuples can we obtain by repeating this process? (note that the order of the numbers are important)

Let $ L $ be the set of all polylines $ ABCDA $, where $ A, B, C, D $ are different vertices of a fixed regular $1985$ -gon. We randomly select a polyline from the set $L$. Calculate the probability that it is the side of a convex quadrilateral.

In the Cartesian plane is given a set of points with integer coordinate \[ T=\{ (x;y)\mid x,y\in\mathbb{Z} ; \ |x|,|y|\leq 20 ; \ (x;y)\ne (0;0)\} \] We colour some points of $ T $ such that for each point $ (x;y)\in T $ then either $ (x;y) $ or $ (-x;-y) $ is coloured. Denote $ N $ to be the number of couples $ {(x_1;y_1),(x_2;y_2)} $ such that both $ (x_1;y_1) $ and $ (x_2;y_2) $ are coloured and $ x_1\equiv 2x_2 \pmod {41}, y_1\equiv 2y_2 \pmod {41} $. Find the all possible values of $ N $.

A frog is placed on each cell of a $n \times n$ square inside an infinite chessboard (so initially there are a total of $n \times n$ frogs). Each move consists of a frog $A$ jumping over a frog $B$ adjacent to it with $A$ landing in the next cell and $B$ disappearing (adjacent means two cells sharing a side). Prove that at least $ \left[\frac{n^2}{3}\right]$ moves are needed to reach a configuration where no more moves are possible.

[u]Set 6[/u] [b]B16.[/b] Let $\ell_r$ denote the line $x + ry + r^2 = 420$. Jeffrey draws the lines $\ell_a$ and $\ell_b$ and calculates their single intersection point. [b]B17.[/b] Let set $L$ consist of lines of the form $3x + 2ay = 60a + 48$ across all real constants a. For every line $\ell$ in $L$, the point on $\ell$ closest to the origin is in set $T$ . The area enclosed by the locus of all the points in $T$ can be expressed in the form nπ for some positive integer $n$. Compute $n$. [b]B18.[/b] What is remainder when the $2020$-digit number $202020 ... 20$ is divided by $275$? [u]Set 7[/u] [b]B19.[/b] Consider right triangle $\vartriangle ABC$ where $\angle ABC = 90^o$, $\angle ACB = 30^o$, and $AC = 10$. Suppose a beam of light is shot out from point $A$. It bounces off side $BC$ and then bounces off side $AC$, and then hits point $B$ and stops moving. If the beam of light travelled a distance of $d$, then compute $d^2$. [b]B20.[/b] Let $S$ be the set of all three digit numbers whose digits sum to $12$. What is the sum of all the elements in $S$? [b]B21.[/b] Consider all ordered pairs $(m, n)$ where $m$ is a positive integer and $n$ is an integer that satisfy $$m! = 3n^2 + 6n + 15,$$ where $m! = m \times (m - 1) \times ... \times 1$. Determine the product of all possible values of $n$. [u]Set 8[/u] [b]B22.[/b] Compute the number of ordered pairs of integers $(m, n)$ satisfying $1000 > m > n > 0$ and $6 \cdot lcm(m - n, m + n) = 5 \cdot lcm(m, n)$. [b]B23.[/b] Andrew is flipping a coin ten times. After every flip, he records the result (heads or tails). He notices that after every flip, the number of heads he had flipped was always at least the number of tails he had flipped. In how many ways could Andrew have flipped the coin? [b]B24.[/b] Consider a triangle $ABC$ with $AB = 7$, $BC = 8$, and $CA = 9$. Let $D$ lie on $\overline{AB}$ and $E$ lie on $\overline{AC}$ such that $BCED$ is a cyclic quadrilateral and $D, O, E$ are collinear, where $O$ is the circumcenter of $ABC$. The area of $\vartriangle ADE$ can be expressed as $\frac{m\sqrt{n}}{p}$, where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. What is $m + n + p$? [u]Set 9[/u] [i]This set consists of three estimation problems, with scoring schemes described.[/i] [b]B25.[/b] Submit one of the following ten numbers: $$3 \,\,\,\, 6\,\,\,\, 9\,\,\,\, 12\,\,\,\, 15\,\,\,\, 18\,\,\,\, 21\,\,\,\, 24\,\,\,\, 27\,\,\,\, 30.$$ The number of points you will receive for this question is equal to the number you selected divided by the total number of teams that selected that number, then rounded up to the nearest integer. For example, if you and four other teams select the number $27$, you would receive $\left\lceil \frac{27}{5}\right\rceil = 6$ points. [b]B26.[/b] Submit any integer from $1$ to $1,000,000$, inclusive. The standard deviation $\sigma$ of all responses $x_i$ to this question is computed by first taking the arithmetic mean $\mu$ of all responses, then taking the square root of average of $(x_i -\mu)^2$ over all $i$. More, precisely, if there are $N$ responses, then $$\sigma =\sqrt{\frac{1}{N} \sum^N_{i=1} (x_i -\mu)^2}.$$ For this problem, your goal is to estimate the standard deviation of all responses. An estimate of $e$ gives $\max \{ \left\lfloor 130 ( min \{ \frac{\sigma }{e},\frac{e}{\sigma }\}^{3}\right\rfloor -100,0 \}$ points. [b]B27.[/b] For a positive integer $n$, let $f(n)$ denote the number of distinct nonzero exponents in the prime factorization of $n$. For example, $f(36) = f(2^2 \times 3^2) = 1$ and $f(72) = f(2^3 \times 3^2) = 2$. Estimate $N = f(2) + f(3) +.. + f(10000)$. An estimate of $e$ gives $\max \{30 - \lfloor 7 log_{10}(|N - e|)\rfloor , 0\}$ points. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777391p24371239]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a $32 \times 32$ table, we put a mouse (facing up) at the bottom left cell and a piece of cheese at several other cells. The mouse then starts moving. It moves forward except that when it reaches a piece of cheese, it eats a part of it, turns right, and continues moving forward. We say that a subset of cells containing cheese is good if, during this process, the mouse tastes each piece of cheese exactly once and then falls off the table. Show that: (a) No good subset consists of 888 cells. (b) There exists a good subset consisting of at least 666 cells.

A computer science teacher has asked his students to write a program that, given a list of $n$ numbers $a_1, a_2, ..., a_n$, calculates the list $b_1, b_2, ..., b_n$ where $b_k$ is the number of times the number $a_k$ appears in the list. So, for example, for the list $1,2,3,1$, the program returns the list $2,1,1,2$. Next, the teacher asked Alexandre to run the program for a list of $2025$ numbers. Then he asked him to apply the program to the resulting list, and so on, until a number greater than or equal to $k$ appears in the list. Find the largest value of $k$ for which, whatever the initial list of $2025$ positive integers $a_1, a_2, ..., a_{2025}$, it is possible for Alexander to do what the teacher asked him to do.

Two students $A$ and $B$ play a game on a $20 \text{ x } 20$ chessboard. It is known that two squares are said to be [i]adjacent[/i] if the two squares have a common side. At the beginning, there is a chess piece in a certain square of the chessboard. Given that $A$ will be the first one to move the chess piece, $A$ and $B$ will alternately move this chess piece to an adjacent square. Also, the common side of any pair of adjacent squares can only be passed once. If the opponent cannot move anymore, then he will be declared the winner (to clarify since the wording wasn’t that good, you lose if you can’t move). Who among $A$ and $B$ has a winning strategy? Justify your claim.