A table with $m$ rows and $n$ columns is given. At any move one chooses some empty cells such that any two of them lie in different rows and columns, puts a white piece in any of those cells and then puts a black piece in the cells whose rows and columns contain white pieces. The game is over if it is not possible to make a move. Find the maximum possible number of white pieces that can be put on the table.

Let $\sigma, \tau$ be two permutations of the quantity $\{1, 2,. . . , n\}$. Prove that there is a function $f: \{1, 2,. . . , n\} \to \{-1, 1\}$ such that for any $1 \le i \le j \le n$, we have $\left|\sum_{k=i}^{j} f(\sigma (k)) \right| \le 2$ and $\left|\sum_{k=i}^{j} f(\tau (k))\right| \le 2$

Let $P$ be a simple polygon completely in $C$, a circle with radius $1$, such that $P$ does not pass through the center of $C$. The perimeter of $P$ is $36$. Prove that there is a radius of $C$ that intersects $P$ at least $6$ times, or there is a circle which is concentric with $C$ and have at least $6$ common points with $P$. [i]Proposed by Seyed Reza Hosseini[/i]

In a tennis club, each member has exactly $k > 0$ friends, and a tournament is organized in rounds such that each pair of friends faces each other in matches exactly once. Rounds are played in simultaneous matches, choosing pairs until they cannot choose any more (that is, among the unchosen people, there is not a pair of friends which has its match pending). Determine the maximum number of rounds the tournament can have, depending on $k$.

A natural number $n$ is written on a board. On every step, Neneng and Asep changes the number on the board with the following rule: Suppose the number on the board is $X$. Initially, Neneng chooses the sign up or down. Then, Asep will pick a positive divisor $d$ of $X$, and replace $X$ with $X+d$ if Neneng chose the sign "up" or $X-d$ if Neneng chose "down". This procedure is then repeated. Asep wins if the number on the board is a nonzero perfect square, and loses if at any point he writes zero. Prove that if $n \geq 14$, Asep can win in at most $(n-5)/4$ steps.

In his youth, Professor John Horton Conway lived on a farm with $2009$ cows. Conway wishes to move the cows from the negative $x$ axis to the positive $x$ axis. The cows are initially lined up in order $1, 2, . . . , 2009$ on the negative $x$ axis. Conway can give two possible commands to the cows. One is the PUSH command, upon which the first cow from the negative $x$ axis moves to the lowest position on the positive $y$ axis. The other is the POP command, upon which the cow in the lowest position on the $y$ axis moves to the positive $x$ axis. For example, if Conway says PUSH POP $2009$ times, then the resulting permutation of cows is the same, $1, 2, . . . , 2009$. If Conway says PUSH $2009$ times followed by POP $2009$ times, the resulting permutation of cows is $2009, . . . , 2, 1$. How many output permutations are possible after Conway finishes moving all the cows from the negative $x$ axis to the positive $x$ axis?

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Today is Saturday, April $25$, $2020$. What is the value of $6 + 4 + 25 + 2020$? [b]p2.[/b] The figure below consists of a $2$ by $3$ grid of squares. How many squares of any size are in the grid? $\begin{tabular}{|l|l|l|} \hline & & \\ \hline & & \\ \hline \end{tabular}$ [b]p3.[/b] James is playing a game. He first rolls a six-sided dice which contains a different number on each side, then randomly picks one of twelve dierent colors, and finally ips a quarter. How many different possible combinations of a number, a color and a flip are there in this game? [b]p4.[/b] What is the sum of the number of diagonals and sides in a regular hexagon? [b]p5.[/b] Mickey Mouse and Minnie Mouse are best friends but they often fight. Each of their fights take up exactly one hour, and they always fight on prime days. For example, they fight on January $2$nd, $3$rd, but not the $4$th. Knowing this, how many total times do Mickey and Minnie fight in the months of April, May and June? [b]p6.[/b] Apple always loved eating watermelons. Normal watermelons have around $13$ black seeds and $25$ brown seeds, whereas strange watermelons had $45$ black seeds and $2$ brown seeds. If Apple bought $14$ normal watermelons and $7$ strange watermelons, then let $a$ be the total number of black seeds and $b$ be the total number of brown seeds. What is $a - b$? [b]p7.[/b] Jerry and Justin both roll a die once. The probability that Jerry's roll is greater than Justin's can be expressed as a fraction in the form $\frac{m}{n}$ in simplified terms. What is $m + n$? [b]p8.[/b] Taylor wants to color the sides of an octagon. What is the minimum number of colors Taylor will need so that no adjacent sides of the octagon will be filled in with the same color? [b]p9.[/b] The point $\frac23$ of the way from ($-6, 8$) to ($-3, 5$) can be expressed as an ordered pair $(a, b)$. What is $|a - b|$? [b]p10.[/b] Mary Price Maddox laughs $7$ times per class. If she teaches $4$ classes a day for the $5$ weekdays every week but doesn't laugh on Wednesdays, then how many times does she laugh after $5$ weeks of teaching? [b]p11.[/b] Let $ABCD$ be a unit square. If $E$ is the midpoint of $AB$ and $F$ lies inside $ABCD$ such that $CFD$ is an equilateral triangle, the positive difference between the area of $CED$ and $CFD$ can be expressed in the form $\frac{a-\sqrt{b}}{c}$ , where $a$, $b$, $c$ are in lowest simplified terms. What is $a + b + c$? [b]p12.[/b] Eddie has musician's syndrome. Whenever a song is a $C$, $A$, or $F$ minor, he begins to cry and his body becomes very stiff. On the other hand, if the song is in $G$ minor, $A$ at major, or $E$ at major, his eyes open wide and he feels like the happiest human being ever alive. There are a total of $24$ keys. How many different possibilities are there in which he cries while playing one song with two distinct keys? [b]p13.[/b] What positive integer must be added to both the numerator and denominator of $\frac{12}{40}$ to make a fraction that is equivalent to $\frac{4}{11}$ ? [b]p14.[/b] The number $0$ is written on the board. Each minute, Gene the genie either multiplies the number on the board by $3$ or $9$, each with equal probability, and then adds either $1$,$2$, or $3$, each with equal probability. Find the expected value of the number after $3$ minutes. [b]p15.[/b] $x$ satisfies $\dfrac{1}{x+ \dfrac{1}{1+\frac{1}{2}}}=\dfrac{1}{2+ \dfrac{1}{1- \dfrac{1}{2+\frac{1}{2}}}}$ Find $x$. [b]p16.[/b] How many different points in a coordinate plane can a bug end up on if the bug starts at the origin and moves one unit to the right, left, up or down every minute for $8$ minutes? [b]p17.[/b] The triplets Addie, Allie, and Annie, are racing against the triplets Bobby, Billy, and Bonnie in a relay race on a track that is $100$ feet long. The first person of each team must run around the entire track twice and tag the second person for the second person to start running. Then, the second person must run once around the entire track and tag the third person, and finally, the third person would only have to run around half the track. Addie and Bob run first, Allie and Billy second, Annie and Bonnie third. Addie, Allie, and Annie run at $50$ feet per minute (ft/m), $25$ ft/m, and $20$ ft/m, respectively. If Bob, Billy, and Bonnie run half as fast as Addie, Allie, and Annie, respectively, then how many minutes will it take Bob, Billy, and Bonnie to finish the race. Assume that everyone runs at a constant rate. [b]p18.[/b] James likes to play with Jane and Jason. If the probability that Jason and Jane play together is $\frac13$, while the probability that James and Jason is $\frac14$ and the probability that James and Jane play together is $\frac15$, then the probability that they all play together is $\frac{\sqrt{p}}{q}$ for positive integers $p$, $q$ where $p$ is not divisible by the square of any prime. Find $p + q$. [b]p19.[/b] Call an integer a near-prime if it is one more than a prime number. Find the sum of all near-primes less than$ 1000$ that are perfect powers. (Note: a perfect power is an integer of the form $n^k$ where $n, k \ge 2$ are integers.) [b]p20.[/b] What is the integer solution to $\sqrt{\frac{2x-6}{x-11}} = \frac{3x-7}{x+6}$ ? [b]p21.[/b] Consider rectangle $ABCD$ with $AB = 12$ and $BC = 4$ with $F$,$G$ trisecting $DC$ so that $F$ is closer to $D$. Then $E$ is on $AB$. We call the intersection of $EF$ and $DB$ $X$, and the intersection of $EG$ and $DB$ is $Y$. If the area of $\vartriangle XY E$ is \frac{8}{15} , then what is the length of $EB$? [b]p22.[/b] The sum $$\sum^{\infty}_{n=2} \frac{1}{4n^2-1}$$ can be expressed as a common fraction $\frac{a}{b}$ in lowest terms. Find $a + b$. [b]p23.[/b] In square $ABCD$, $M$, $N$, $O$, $P$ are points on sides $\overline{AB}$, $\overline{BC}$, $\overline{CD}$ and $\overline{DA}$, respectively. If $AB = 4$, $AM = BM$ and $DP = 3AP$, the least possible value of $MN + NO + OP$ can be expressed as $\sqrt{x}$ forsome integer x. Find x: [b]p24.[/b] Grand-Ovich the ant is at a vertex of a regular hexagon and he moves to one of the adjacent vertices every minute with equal probability. Let the probability that after $8$ minutes he will have returned to the starting vertex at least once be the common fraction $\frac{a}{b}$ in lowest terms. What is $a + b$? [b]p25.[/b] Find the last two non-zero digits at the end of $2020!$ written as a two digit number. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Sebastian, the traveling ant, walks on top of some square boards. He just walks horizontally or vertically through the squares of the boards and does not pass through the same square twice. On a board of $7\times 7$, in which squares can Sebastian start his journey so that he can pass through all the squares on the board?

In the table below, place the numbers 1--12 in the shaded cells. You start at the center cell (marked with $*$). You repeatedly move up, down, left, or right, chosen uniformly at random each time, until reaching a shaded cell. Your score is the number in the shaded cell that you end up at. Let $m$ be the least possible expected value of your score (based on how you placed the numbers), and $M$ be the greatest possible expected value of your score. Compute $m \cdot M$. [i]Proposed by Justin Hsieh[/i]

Let $A_n$ be the number of ways to tile a $4 \times n$ rectangle using $2 \times 1$ tiles. Prove that $A_n$ is divisible by 2 if and only if $A_n$ is divisible by 3.

A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$. (a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?

A Physicist for Fun discovered three types of very peculiar particles, and classified them as $P$, $H$ and $I$ particles. After months of study, this physicist discovered that he can join such particles and obtain new particles, according to the following operations: • A $P$ particle with an $H$ particle turns into one $I$ particle; • A $P$ particle with an $I$ particle turns into two $P$ particles and one $H$ particle; • An $H$ particle with an $I$ particle turns into four $P$ particles; Nothing happens when we try to join particles of the same type. It is also known that the physicist has $22$ $P$ particles, $21$ $H$ particles and $20$ $I$ particles. (a) After a finite number of operations, what is the largest possible number of particles that can be obtained? And what is the smallest possible number of particles? (b) Is it possible, after a finite number of operations, to obtain $22$ $P$ particles, $20$ $H$ particles, and $21$ $I$ particles? (c) Is it possible, after a finite number of operations, to obtain $34$ $H$ particles and $21$ $I$ particles?

A book contains $30$ stories. Each story has a different number of pages under $31$. The first story starts on page $1$ and each story starts on a new page. What is the largest possible number of stories that can begin on odd page numbers?

In Sikinia we only pay with coins that have a value of either $11$ or $12$ Kulotnik. In a burglary in one of Sikinia's banks, $11$ bandits cracked the safe and could get away with $5940$ Kulotnik. They tried to split up the money equally - so that everyone gets the same amount - but it just doesn't worked. After a while their leader claimed that it actually isn't possible. Prove that they didn't get any coin with the value $12$ Kulotnik.

The points of the plane are colored in black and white so that whenever three vertices of a parallelogram are the same color, the fourth vertex is that color, too. Prove that all the points of the plane are the same color.

Two-way flights are operated between $80$ cities in such a way that each city is connected to at least $7$ other cities by a direct flight and any two cities are connected by a finite sequence of flights. Find the smallest $k$ such that for any such arrangement of flights it is possible to travel from any city to any other city by a sequence of at most $k$ flights.

Each of $N$ people have chosen some $5$ elements from a $23$-element set so that any two people share at most $3$ chosen elements. Does this mean that $N \le 2020$? Answer the same question with $25$ instead of $23$.

It is given a 1001*1001 board divided in 1*1 squares. We want to amrk m squares in such a way that: 1: if 2 squares are adjacent then one of them is marked. 2: if 6 squares lie consecutively in a row or column then two adjacent squares from them are marked. Find the minimun number of squares we most mark.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8\times 8$ chessboard there is a rook. The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second player is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] In Crocodile Country there are banknotes of $1$ dollar, $10$ dollars, $100$ dollars, and $1,000$ dollars. Is it possible to get 1,000,000 dollars by using $250,000$ banknotes? [b]p3.[/b] Fifteen positive numbers (not necessarily whole numbers) are placed around the circle. It is known that the sum of every four consecutive numbers is $30$. Prove that each number is less than $15$. [b]p4.[/b] Donald Duck has $100$ sticks, each of which has length $1$ cm or $3$ cm. Prove that he can break into $2$ pieces no more than one stick, after which he can compose a rectangle using all sticks. [b]p5.[/b] Three consecutive $2$ digit numbers are written next to each other. It turns out that the resulting $6$ digit number is divisible by $17$. Find all such numbers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Evaluate $(2-0)^2 \cdot 3+ \frac{20}{2+3}$ . [b]p2.[/b] Let $x = 11 \cdot 99$ and $y = 9 \cdot 101$. Find the sumof the digits of $x \cdot y$. [b]p3.[/b] A rectangle is cut into two pieces. The ratio between the areas of the two pieces is$ 3 : 1$ and the positive difference between those areas is $20$. What’s the area of the rectangle? [b]p4.[/b] Edgeworth is scared of elevators. He is currently on floor $50$ of a building, and he wants to go down to floor $1$. Edgeworth can go down at most $4$ floors each time he uses the elevator. What’s the minimum number of times he needs to use the elevator to get to floor $1$? [b]p5.[/b] There are $20$ people at a party. Fifteen of those people are normal and $5$ are crazy. A normal person will shake hands once with every other normal person, while a crazy person will shake hands twice with every other crazy person. How many total handshakes occur at the party? [b]p6.[/b] Wam and Sang are chewing gum. Gum comes in packages, each package consisting of $14$ sticks of gum. Wam eats $6$ packs and $9$ individual sticks of gum. Sang wants to eat twice as much gum as Wam. How many packs of gum must Sang buy? [b]p7.[/b] At Lakeside Health School (LHS), $40\%$ of students are male and $60\%$ of the students are female. If half of the students at the school take biology, and the same number ofmale and female students take biology, to the nearest percent, what percent of female students take biology? [b]p8.[/b] Evin is bringing diluted raspberry iced tea to the annual LexingtonMath Team party. He has a cup with $10$ mL of iced tea and a $2000$ mL cup of water with $10\%$ raspberry iced tea. If he fills up the cup with $20$ more mL of $10\%$ raspberry iced tea water, what percent of the solution will be iced tea? [b]p9.[/b] Tree $1$ starts at height $220$ m and grows continuously at $3$ m per year. Tree $2$ starts at height $20$ m and grows at $5$ m during the first year, $7$ m per during the second year, $9$ m during the third year, and in general $(3+2n)$ m in the nth year. After which year is Tree $2$ taller than Tree $1$? [b]p10.[/b] Leo and Chris are playing a game in which Chris flips a coin. The coin lands on heads with probability $\frac{499}{999}$ , tails with probability $\frac{499}{999}$ , and it lands on its side with probability $\frac{1}{999}$ . For each flip of the coin, Leo agrees to give Chris $4$ dollars if it lands on heads, nothing if it lands on tails, and $2$ dollars if it lands on its side. What’s the expected value of the number of dollars Chris gets after flipping the coin $17$ times? [b]p11.[/b] Ephram has a pile of balls, which he tries to divide into piles. If he divides the balls into piles of $7$, there are $5$ balls that don’t get divided into any pile. If he divides the balls into piles of $11$, there are $9$ balls that aren’t in any pile. If he divides the balls into piles of $13$, there are $11$ balls that aren’t in any pile. What is the minimumnumber of balls Ephram has? [b]p12.[/b] Let $\vartriangle ABC$ be a triangle such that $AB = 3$, $BC = 4$, and $C A = 5$. Let $F$ be the midpoint of $AB$. Let $E$ be the point on $AC$ such that $EF \parallel BC$. Let CF and $BE$ intersect at $D$. Find $AD$. [b]p13.[/b] Compute the sum of all even positive integers $n \le 1000$ such that: $$lcm(1,2, 3, ..., (n -1)) \ne lcm(1,2, 3,, ...,n)$$. [b]p14.[/b] Find the sum of all palindromes with $6$ digits in binary, including those written with leading zeroes. [b]p15.[/b] What is the side length of the smallest square that can entirely contain $3$ non-overlapping unit circles? [b]p16.[/b] Find the sum of the digits in the base $7$ representation of $6250000$. Express your answer in base $10$. [b]p17.[/b] A number $n$ is called sus if $n^4$ is one more than a multiple of $59$. Compute the largest sus number less than $2023$. [b]p18.[/b] Michael chooses real numbers $a$ and $b$ independently and randomly from $(0, 1)$. Given that $a$ and $b$ differ by at most $\frac14$, what is the probability $a$ and $b$ are both greater than $\frac12$ ? [b]p19.[/b] In quadrilateral $ABCD$, $AB = 7$ and $DA = 5$, $BC =CD$, $\angle BAD = 135^o$ and $\angle BCD = 45^o$. Find the area of $ABCD$. [b]p20.[/b] Find the value of $$\sum_{i |210} \sum_{j |i} \left \lfloor \frac{i +1}{j} \right \rfloor$$ [b]p21.[/b] Let $a_n$ be the number of words of length $n$ with letters $\{A,B,C,D\}$ that contain an odd number of $A$s. Evaluate $a_6$. [b]p22.[/b] Detective Hooa is investigating a case where a criminal stole someone’s pizza. There are $69$ people involved in the case, among whom one is the criminal and another is a witness of the crime. Every day, Hooa is allowed to invite any of the people involved in the case to his rather large house for questioning. If on some given day, the witness is present and the criminal is not, the witness will reveal who the criminal is. What is the minimum number of days of questioning required such that Hooa is guaranteed to learn who the criminal is? [b]p23.[/b] Find $$\sum^{\infty}_{n=2} \frac{2n +10}{n^3 +4n^2 +n -6}.$$ [b]p24.[/b] Let $\vartriangle ABC$ be a triangle with circumcircle $\omega$ such that $AB = 1$, $\angle B = 75^o$, and $BC =\sqrt2$. Let lines $\ell_1$ and $\ell_2$ be tangent to $\omega$ at $A$ and $C$ respectively. Let $D$ be the intersection of $\ell_1$ and $\ell_2$. Find $\angle ABD$ (in degrees). [b]p25.[/b] Find the sum of the prime factors of $14^6 +27$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In space are given $24$ points, no three of which are collinear. Suppose that there are exactly $2002$ planes determined by three of these points. Prove that there is a plane containing at least six points.

Compute the number of rearrangements $a_1, a_2, \dots, a_{2018}$ of the sequence $1, 2, \dots, 2018$ such that $a_k > k$ for $\textit{exactly}$ one value of $k$.

The numbers $1,2,\cdots,2021$ are arranged in a circle. For any $1 \le i \le 2021$, if $i,i+1,i+2$ are three consecutive numbers in some order such that $i+1$ is not in the middle, then $i$ is said to be a good number. Indices are taken mod $2021$. What is the maximum possible number of good numbers? [i]CSJL[/i]

A group consist of n tourists. Among every 3 of them there are 2 which are not familiar. For every partition of the tourists in 2 buses you can find 2 tourists that are in the same bus and are familiar with each other. Prove that is a tourist familiar to at most $\displaystyle \frac 2{5}n$ tourists.