There are $169$ non-zero digits written around a circle. Prove that they can be split into $14$ non-empty blocks of consecutive digits so that among the $14$ natural numbers formed by the digits in those blocks, at least $13$ of them are divisible by $13$ (the digits in each block are read in clockwise direction).

Let $AB$ be a segment of a plane. Is it possible to paint the plane in $2009$ colors in such a way that both of the following conditions are satisfied? 1) Every two points of the same color can be connected by a polygonal line. 2) For any point $C$ of $AB$, every $n \in N$ and every $k\in \{1,2,3,...,2009\}$ , there exists a point $D$, painted in $k$-th color such that the length of $CD$ is less than $0,0...01$, where all the zeros after the decimal point are exactly $n$.

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] Evaluate $20 \times 21 + 2021$. [b]p2.[/b] Let points $A$, $B$, $C$, and $D$ lie on a line in that order. Given that $AB = 5CD$ and $BD = 2BC$, compute $\frac{AC}{BD}$. [b]p3.[/b] There are $18$ students in Vincent the Bug's math class. Given that $11$ of the students take U.S. History, $15$ of the students take English, and $2$ of the students take neither, how many students take both U.S. History and English? [b]p4.[/b] Among all pairs of positive integers $(x, y)$ such that $xy = 12$, what is the least possible value of $x + y$? [b]p5.[/b] What is the smallest positive integer $n$ such that $n! + 1$ is composite? [b]p6.[/b] How many ordered triples of positive integers $(a, b,c)$ are there such that $a + b + c = 6$? [b]p7.[/b] Thomas orders some pizzas and splits each into $8$ slices. Hungry Yunseo eats one slice and then finds that she is able to distribute all the remaining slices equally among the $29$ other math club students. What is the fewest number of pizzas that Thomas could have ordered? [b]p8.[/b] Stephanie has two distinct prime numbers $a$ and $b$ such that $a^2-9b^2$ is also a prime. Compute $a + b$. [b]p9.[/b] Let $ABCD$ be a unit square and $E$ be a point on diagonal $AC$ such that $AE = 1$. Compute $\angle BED$, in degrees. [b]p10.[/b] Sheldon wants to trace each edge of a cube exactly once with a pen. What is the fewest number of continuous strokes that he needs to make? A continuous stroke is one that goes along the edges and does not leave the surface of the cube. [b]p11.[/b] In base $b$, $130_b$ is equal to $3n$ in base ten, and $1300_b$ is equal to $n^2$ in base ten. What is the value of $n$, expressed in base ten? [b]p12.[/b] Lin is writing a book with $n$ pages, numbered $1,2,..., n$. Given that $n > 20$, what is the least value of $n$ such that the average number of digits of the page numbers is an integer? [b]p13.[/b] Max is playing bingo on a $5\times 5$ board. He needs to fill in four of the twelve rows, columns, and main diagonals of his bingo board to win. What is the minimum number of boxes he needs to fill in to win? [b]p14.[/b] Given that $x$ and $y$ are distinct real numbers such that $x^2 + y = y^2 + x = 211$, compute the value of $|x - y|$. [b]p15.[/b] How many ways are there to place 8 indistinguishable pieces on a $4\times 4$ checkerboard such that there are two pieces in each row and two pieces in each column? [b]p16.[/b] The Manhattan distance between two points $(a, b)$ and $(c, d)$ in the plane is defined to be $|a - c| + |b - d|$. Suppose Neil, Neel, and Nail are at the points $(5, 3)$, $(-2,-2)$ and $(6, 0)$, respectively, and wish to meet at a point $(x, y)$ such that their Manhattan distances to$ (x, y)$ are equal. Find $10x + y$. [b]p17.[/b] How many positive integers that have a composite number of divisors are there between $1$ and $100$, inclusive? [b]p18.[/b] Find the number of distinct roots of the polynomial $$(x - 1)(x - 2) ... (x - 90)(x^2 - 1)(x^2 - 2) ... (x^2 - 90)(x^4 - 1)(x^4 - 2)...(x^4 - 90)$$. [b]p19.[/b] In triangle $ABC$, let $D$ be the foot of the altitude from $ A$ to $BC$. Let $P,Q$ be points on $AB$, $AC$, respectively, such that $PQ$ is parallel to $BC$ and $\angle PDQ = 90^o$. Given that $AD = 25$, $BD = 9$, and $CD = 16$, compute $111 \times PQ$. [b]p20.[/b] The simplified fraction with numerator less than $1000$ that is closest but not equal to $\frac{47}{18}$ is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p$ be a prime number. Determine the largest possible $n$ such that the following holds: it is possible to fill an $n\times n$ table with integers $a_{ik}$ in the $i$th row and $k$th column, for $1\le i,k\le n$, such that for any quadruple $i,j,k,l$ with $1\le i<j\le n$ and $1\le k<l\le n$, the number $a_{ik}a_{jl}-a_{il}a_{jk}$ is not divisible by $p$. [i]Proposed by oneplusone[/i]

The $2001$ towns in a country are connected by some roads, at least one road from each town, so that no town is connected by a road to every other city. We call a set $D$ of towns [i]dominant[/i] if every town not in $D$ is connected by a road to a town in $D$. Suppose that each dominant set consists of at least $k$ towns. Prove that the country can be partitioned into $2001-k$ republics in such a way that no two towns in the same republic are connected by a road.

We say that a set of positive integers is [i]regular [/i] if, for any selection of numbers from the set, the sum of the chosen numbers is different from $1810$. Divide the set of integers from $452$ to $1809$ (inclusive) into the smallest possible number of regular sets.

Given the square table $n\times n$ with $(n-1)$ marked fields. Prove that it is possible to move all the marked fields below the diagonal by moving rows and columns.

A triangle is given on a sphere of radius $1$, the sides of which are arcs of three different circles of radius $1$ centered in the center of a sphere having less than $\pi$ in length and an area equal to a quarter of the area of the sphere. Prove that four copies of such a triangle can cover the entire sphere. A. Zaslavsky

We are given a finite, simple, non-directed graph. Ann writes positive real numbers on each edge of the graph such that for all vertices the following is true: the sum of the numbers written on the edges incident to a given vertex is less than one. Bob wants to write non-negative real numbers on the vertices in the following way: if the number written at vertex $v$ is $v_0$, and Ann's numbers on the edges incident to $v$ are $e_1,e_2,\ldots,e_k$, and the numbers on the other endpoints of these edges are $v_1,v_2,\ldots,v_k$, then $v_0=\sum_{i=1}^k e_iv_i+2022$. Prove that Bob can always number the vertices in this way regardless of the graph and the numbers chosen by Ann. Proposed by [i]Boldizsár Varga[/i], Verőce

Determine if it is possible to choose nine points in the plane such that there are $n=10$ lines in the plane each of which passes through exactly three of the chosen points. What if $n=11$?

In a board $8$x$8$, the unit squares have numbers $1-64$, as shown. The unit square with a multiple of $3$ on it are red. Find the minimum number of chess' bishops that we need to put on the board such that any red unit square either has a bishop on it or is attacked by at least one bishop. Note: A bishops moves diagonally. [img]https://i.imgur.com/03baBwp.jpeg[/img]

Marko lives on the origin of the Cartesian plane. Every second, Marko moves $1$ unit up with probability $\tfrac{2}{9}$, $1$ unit right with probability $\tfrac{2}{9}$, $1$ unit up and $1$ unit right with probability $\tfrac{4}{9}$, and he doesn’t move with probability $\tfrac{1}{9}$. After $2019$ seconds, Marko ends up on the point $(A, B)$. What is the expected value of $A\cdot B$?

Let $n \ge 2$ be an integer and $M= \{1,2,\ldots,n\}.$ For each $k \in \{1,2,\ldots,n-1\}$ we define $$x_k= \frac{1}{n+1} \sum_{\substack{A \subset M \\ |A|=k}} (\min A + \max A).$$ Prove that the numbers $x_k$ are integers and not all of them are divisible by $4.$ [hide=Notations]$|A|$ is the cardinal of $A$ $\min A$ is the smallest element in $A$ $\max A$ is the largest element in $A$[/hide]

Consider $9$ points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $\,n\,$ such that whenever exactly $\,n\,$ edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

Daniel, Ethan, and Zack are playing a multi-round game of Tetris. Whoever wins $11$ rounds first is crowned the champion. However Zack is trying to pull off a "reverse-sweep", where (at-least) one of the other two players first hits $10$ wins while Zack is still at $0$, but Zack still ends up being the first to reach $11$. How many possible sequences of round wins can lead to Zack pulling off a reverse sweep? [i]Proposed by Dilhan Salgado[/i]

Let $S=\{(x,y)| x,y\in \mathbb{Q} , 0\le x,y\le 1\}$, where $\mathbb{Q}$ is the set of all rational numbers. Given a set of lines and a set of marked points in $S$, Euclid can do one of two moves: (i) Draw a line connecting two marked points, or (ii) Mark a point in $S$ which lies on at least two drawn lines. At first, the five distinct points $A(0,0), B(1,0), C(1,1), D(0,1)$ and $P\in S$ are marked. Find all such points $P$ such that Euclid can mark any point in $S$ after finitely many moves. [i]Glen Lim[/i]

[b]p1.[/b] Let $A = \{D,U,K,E\}$ and $B = \{M, A, T,H\}$. How many maps are there from $A$ to $B$? [b]p2.[/b] The product of two positive integers $x$ and $y$ is equal to $3$ more than their sum. Find the sum of all possible $x$. [b]p3.[/b] There is a bag with $1$ red ball and $1$ blue ball. Jung takes out a ball at random and replaces it with a red ball. Remy then draws a ball at random. Given that Remy drew a red ball, what is the probability that the ball Jung took was red? [b]p4.[/b] Let $ABCDE$ be a regular pentagon and let $AD$ intersect $BE$ at $P$. Find $\angle APB$. [b]p5.[/b] It is Justin and his $4\times 4\times 4$ cube again! Now he uses many colors to color all unit-cubes in a way such that two cubes on the same row or column must have different colors. What is the minimum number of colors that Justin needs in order to do so? [b]p6.[/b] $f(x)$ is a polynomial of degree $3$ where $f(1) = f(2) = f(3) = 4$ and $f(-1) = 52$. Determine $f(0)$. [b]p7.[/b] Mike and Cassie are partners for the Duke Problem Solving Team and they decide to meet between $1$ pm and $2$ pm. The one who arrives first will wait for the other for $10$ minutes, the lave. Assume they arrive at any time between $1$ pm and $2$ pm with uniform probability. Find the probability they meet. [b]p8.[/b] The remainder of $2x^3 - 6x^2 + 3x + 5$ divided by $(x - 2)^2$ has the form $ax + b$. Find $ab$. [b]p9.[/b] Find $m$ such that the decimal representation of m! ends with exactly $99$ zeros. [b]p10.[/b] Let $1000 \le n = \overline{DUKE} \le 9999$. be a positive integer whose digits $\overline{DUKE}$ satisfy the divisibility condition: $$1111 | \left( \overline{DUKE} + \overline{DU} \times \overline{KE} \right)$$ Determine the smallest possible value of $n$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $6$ pieces of cheese of different weights. For any two pieces we can identify the heavier piece. Given that it is possible to divide them into two groups of equal weights with three pieces in each. Give the explicit way to find these groups by performing two weightings on a regular balance.

An evil witch is making a potion to poison the people of PUMAClandia. In order for the potion to work, the number of poison dart frogs cannot exceed $5$, the number of wolves’ teeth must be an even number, and the number of dragon scales has to be a multiple of $6$. She can also put in any number of tiger nails. Given that the stew has exactly $2021$ ingredients, in how many ways can she add ingredients for her potion to work?

Each face of a $7 \times 7 \times 7$ cube is divided into unit squares. What is the maximum number of squares that can be chosen so that no two chosen squares have a common point? [i]A. Chukhnov[/i]

In a checkered square $101 \times 101$, each cell of the inner square $99 \times 99$ is painted in one of ten colors (cells adjacent to the border of the square, not painted). Could it turn out that in every in a $3\times 3$ square, is exactly one more cell painted the same color as the central cell?

Let $n>1$ be a given integer. In a deck of cards the cards are of $n$ different suites and $n$ different values, and for each pair of a suite and a value there is exactly one such card. We shuffle the deck and distribute the cards among $n$ players giving each player $n$ cards. The players' goal is to choose a way to sit down around a round table so that they will be able to do the following: the first player puts down an arbitrary card, and then each consecutive player puts down a card that has a different suite and different value compared to the previous card that was put down on the table. For which $n$ is it possible that the cards were distributed in such a way that the players cannot achieve their goal? (The players work together, and they can see each other's cards.) Proposed by [i]Anett Kocsis[/i], Budapest

Students have taken a test paper in each of $n \ge 3$ subjects. It is known that in any subject exactly three students got the best score, and for any two subjects exactly one student got the best scores in both subjects. Find the smallest $n$ for which the above conditions imply that exactly one student got the best score in each of the $n$ subjects.

A hundred tourists arrive to a hotel at night. They know that in the hotel there are single rooms numbered as $1, 2, \ldots , n$, and among them $k{}$ (the tourists do not know which) are under repair, the other rooms are free. The tourists, one after another, check the rooms in any order (maybe different for different tourists), and the first room not under repair is taken by the tourist. The tourists don’t know whether a room is occupied until they check it. However it is forbidden to check an occupied room, and the tourists may coordinate their strategy beforehand to avoid this situation. For each $k{}$ find the smallest $n{}$ for which the tourists may select their rooms for sure. [i]Fyodor Ivlev[/i]

A frog starts a journey at $(6,9).$ A skip is the act of traveling a positive integer number of units straight south or a positive integer number of units straight west. A jump is the act of traveling one unit straight west. A hop consists of any skip followed by a jump. How many different sequences of hops can the frog take so that the frog's final destination is $(0,0)$? [i]Proposed by Jack Ma[/i]