Consider a board of $a \times b$, with $a$ and $b$ integers greater than or equal to $2$. Initially their squares are colored black and white like a chess board. The permitted operation consists of choosing two squares with a common side and recoloring them as follows: a white square becomes black; a black box turns green; a green box turns white. Determine for which values of $a$ and $b$ it is possible, by a succession of allowed operations, to make all the squares that were initially white end black and all the squares that were initially black end white. Clarification: Initially there are no green squares, but they appear after the first operation.

[u]Set 3[/u] [b]p7.[/b] On unit square $ABCD$, a point $P$ is selected on segment $CD$ such that $DP =\frac14$ . The segment $BP$ is drawn and its intersection with diagonal $AC$ is marked as $E$. What is the area of triangle $AEP$? [b]p8.[/b] Five distinct points are arranged on a plane, creating ten pairs of distinct points. Seven pairs of points are distance $1$ apart, two pairs of points are distance $\sqrt3$ apart, and one pair of points is distance $2$ apart. Draw a line segment from one of these points to the midpoint of a pair of these points. What is the longest this line segment can be? [b]p9.[/b] The inhabitants of Mars use a base $8$ system. Mandrew Mellon is competing in the annual Martian College Interesting Competition of Math (MCICM). The first question asks to compute the product of the base $8$ numerals $1245415_8$, $7563265_8$, and $ 6321473_8$. Mandrew correctly computed the product in his scratch work, but when he looked back he realized he smudged the middle digit. He knows that the product is $1014133027\blacksquare 27662041138$. What is the missing digit? PS. You should use hide for answers.

Let $n$ be a natural number and suppose that $ w_1, w_2, \ldots , w_n$ are $n$ weights . We call the set of $\{ w_1, w_2, \ldots , w_n\}$ to be a [i]Perfect Set [/i]if we can achieve all of the $1,2, \ldots, W$ weights with sums of $ w_1, w_2, \ldots , w_n$, where $W=\sum_{i=1}^n w_i $. Prove that if we delete the maximum weight of a Perfect Set, the other weights make again a Perfect Set.

Let $n{}$ be a positive integer, and let $\mathcal{C}$ be a collection of subsets of $\{1,2,\ldots,2^n\}$ satisfying both of the following conditions:[list=1] [*]Every $(2^n-1)$-element subset of $\{1,2,\ldots,2^n\}$ is a member of $\mathcal{C}$, and [*]Every non-empty member $C$ of $\mathcal{C}$ contains an element $c$ such that $C\setminus\{c\}$ is again a member of $\mathcal{C}$. [/list]Determine the smallest size $\mathcal{C}$ may have. [i]Serbia, Pavle Martinovic ́[/i]

Given positive integers $d \ge 3$, $r>2$ and $l$, with $2d \le l <rd$. Every vertice of the graph $G(V,E)$ is assigned to a positive integer in $\{1,2,\cdots,l\}$, such that for any two consecutive vertices in the graph, the integers they are assigned to, respectively, have difference no less than $d$, and no more than $l-d$. A proper coloring of the graph is a coloring of the vertices, such that any two consecutive vertices are not the same color. It's given that there exist a proper subset $A$ of $V$, such that for $G$'s any proper coloring with $r-1$ colors, and for an arbitrary color $C$, either all numbers in color $C$ appear in $A$, or none of the numbers in color $C$ appear in $A$. Show that $G$ has a proper coloring within $r-1$ colors.

Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]

Let $n$ be a nonzero even integer. We fill up all the cells of an $n\times n$ grid with $+$ and $-$ signs ensuring that the number of $+$ signs equals the number of $-$ signs. Show that there exists two rows with the same number of $+$ signs or two collumns with the same number of $+$ signs.

There's a large pile of cards. On each card a number from $1,2,\ldots n$ is written. It is known that sum of all numbers on all of the cards is equal to $k\cdot n!$ for some $k$. Prove that it is possible to arrange cards into $k$ stacks so that sum of numbers written on the cards in each stack is equal to $n!$.

Let $n\geqslant 3$ be a positive integer and $N=\{1,2,\ldots,n\}$ and let $k>0$ be a real number. Let's associate each non-empty of $N{}$ with a point in the plane, such that any two distinct subsets correspond to different points. If the absolute value of the difference between the arithmetic means of the elements of two distinct non-empty subsets of $N{}$ is at most $k{}$ we connect the points associated with these subsets with a segment. Determine the minimum value of $k{}$ such that the points associated with any two distinct non-empty subsets of $N{}$ are connected by a segment or a broken line. [i]Cristi Săvescu[/i]

[u]Round 5[/u] [b]p13.[/b] Given a (not necessarily simplified) fraction $\frac{m}{n}$ , where $m, n > 6$ are positive integers, when $6$ is subtracted from both the numerator and denominator, the resulting fraction is equal to $\frac45$ of the original fraction. How many possible ordered pairs $(m, n)$ are there? [b]p14.[/b] Jamesu's favorite anime show has $3$ seasons, with $12$ episodes each. For $8$ days, Jamesu does the following: on the $n^{th}$ day, he chooses $n$ consecutive episodes of exactly one season, and watches them in order. How many ways are there for Jamesu to finish all $3$ seasons by the end of these $8$ days? (For example, on the first day, he could watch episode $5$ of the first season; on the second day, he could watch episodes $11$ and $12$ of the third season, etc.) [b]p15.[/b] Let $O$ be the center of regular octagon $ABCDEFGH$ with side length $6$. Let the altitude from $O$ meet side $AB$ at $M$, and let $BH$ meet $OM$ at $K$. Find the value of $BH \cdot BK$. [u]Round 6[/u] [b]p16.[/b] Fhomas writes the ordered pair $(2, 4)$ on a chalkboard. Every minute, he erases the two numbers $(a, b)$, and replaces them with the pair $(a^2 + b^2, 2ab)$. What is the largest number on the board after $10$ minutes have passed? [b]p17.[/b] Triangle $BAC$ has a right angle at $A$. Point $M$ is the midpoint of $BC$, and $P$ is the midpoint of $BM$. Point $D$ is the point where the angle bisector of $\angle BAC$ meets $BC$. If $\angle BPA = 90^o$, what is $\frac{PD}{DM}$? [b]p18.[/b] A square is called legendary if there exist two different positive integers $a, b$ such that the square can be tiled by an equal number of non-overlapping $a$ by $a$ squares and $b$ by $b$ squares. What is the smallest positive integer $n$ such that an $n$ by $n$ square is legendary? [u]Round 7[/u] [b]p19.[/b] Let $S(n)$ be the sum of the digits of a positive integer $n$. Let $a_1 = 2019!$, and $a_n = S(a_{n-1})$. Given that $a_3$ is even, find the smallest integer $n \ge 2$ such that $a_n = an_1$. [b]p20.[/b] The local EMCC bakery sells one cookie for $p$ dollars ($p$ is not necessarily an integer), but has a special offer, where any non-zero purchase of cookies will come with one additional free cookie. With $\$27:50$, Max is able to buy a whole number of cookies (including the free cookie) with a single purchase and no change leftover. If the price of each cookie were $3$ dollars lower, however, he would be able to buy double the number of cookies as before in a single purchase (again counting the free cookie) with no change leftover. What is the value of $p$? [b]p21.[/b] Let circle $\omega$ be inscribed in rhombus $ABCD$, with $\angle ABC < 90^o$. Let the midpoint of side $AB$ be labeled $M$, and let $\omega$ be tangent to side $AB$ at $E$. Let the line tangent to $\omega$ passing through $M$ other than line $AB$ intersect segment $BC$ at $F$. If $AE = 3$ and $BE = 12$, what is the area of $\vartriangle MFB$? [u]Round 8[/u] [b]p22.[/b] Find the remainder when $1010 \cdot 1009! + 1011 \cdot 1008! + ... + 2018 \cdot 1!$ is divided by $2019$. [b]p23.[/b] Two circles $\omega_1$ and $\omega_2$ have radii $1$ and $2$, respectively and are externally tangent to one another. Circle $\omega_3$ is externally tangent to both $\omega_1$ and $\omega_2$. Let $M$ be the common external tangent of $\omega_1$ and $\omega_3$ that doesn't intersect $\omega_2$. Similarly, let $N$ be the common external tangent of $\omega_2$ and $\omega_3$ that doesn't intersect $\omega_1$. Given that $M$ and N are parallel, find the radius of $\omega_3$. [b]p24.[/b] Mana is standing in the plane at $(0, 0)$, and wants to go to the EMCCiffel Tower at $(6, 6)$. At any point in time, Mana can attempt to move $1$ unit to an adjacent lattice point, or to make a knight's move, moving diagonally to a lattice point $\sqrt5$ units away. However, Mana is deathly afraid of negative numbers, so she will make sure never to decrease her $x$ or $y$ values. How many distinct paths can Mana take to her destination? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949411p26408196]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider arrangements of the numbers $1$ through $64$ on the squares of an $8\times 8$ chess board, where each square contains exactly one number and each number appears exactly once. A number in such an arrangement is called super-plus-good, if it is the largest number in its row and at the same time the smallest number in its column. Prove or disprove each of the following statements: (a) Each such arrangement contains at least one super-plus-good number. (b) Each such arrangement contains at most one super-plus-good number. Proposed by Gerhard J. Woeginger

Four teams $A$, $B$, $C$ and $D$ play a football tournament in which each team plays exactly two times against each of the remaining three teams (there are $12$ matches). In each matchif it's a tie each team gets $1$ point and if it isn't a tie then the winner gets $3$ points and the loser gets $0$ points. At the end of the tournament the teams $A$, $B$ and $C$ have $8$ points each. Determine all possible points of team $D$.

Compute the number of ways a non-self-intersecting concave quadrilateral can be drawn in the plane such that two of its vertices are $(0, 0)$ and $(1, 0)$, and the other two vertices are two distinct lattice points $(a, b)$, $(c, d)$ with $0 \le a$, $c \le 59$ and $1 \le b$, $d \le 5.$ (A concave quadrilateral is a quadrilateral with an angle strictly larger than $180^o$. A lattice point is a point with both coordinates integers.)

Let \(P\) be a convex polyhedron with the following properties: [b]1)[/b] \(P\) has exactly \(666\) edges. [b]2)[/b] The degrees of all vertices of \(P\) differ by at most \(1\). [b]3)[/b] There is an edge‐coloring of \(P\) with \(k\) colors such that for each color \(c\) and any two distinct vertices \(V_1,V_2\), there exists a path from \(V_1\) to \(V_2\) all of whose edges have color \(c\). Determine the largest positive integer \(k\) for which such a polyhedron \(P\) exists.

The cells of an $n \times n$ table are filled with the numbers $1,2,\dots,n$ for the first row, $n+1,n+2,\dots,2n$ for the second, and so on until $n^2-n,n^2-n+1,\dots,n^2$ for the $n$-th row. Peter picks $n$ numbers from this table such that no two of them lie on the same row or column. Peter then calculates the sum $S$ of the numbers he has chosen. Prove that Peter always gets the same number for $S$, no matter how he chooses his $n$ numbers.

The vertices of a regular $2n$-gon (with $n > 2$ an integer) are labelled with the numbers $1,2,...,2n$ in some order. Assume that the sum of the labels at any two adjacent vertices equals the sum of the labels at the two diametrically opposite vertices. Prove that this is possible if and only if $n$ is odd.

Consider an array $n \times n$ ($n\ge 2$) with $n^2$ integers. In how many ways one can complete the array if the product of the numbers on any row and column is $5$ or $-5$?

Let $ N \equal{} \{1,2 \ldots, n\}, n \geq 2.$ A collection $ F \equal{} \{A_1, \ldots, A_t\}$ of subsets $ A_i \subseteq N,$ $ i \equal{} 1, \ldots, t,$ is said to be separating, if for every pair $ \{x,y\} \subseteq N,$ there is a set $ A_i \in F$ so that $ A_i \cap \{x,y\}$ contains just one element. $ F$ is said to be covering, if every element of $ N$ is contained in at least one set $ A_i \in F.$ What is the smallest value $ f(n)$ of $ t,$ so there is a set $ F \equal{} \{A_1, \ldots, A_t\}$ which is simultaneously separating and covering?

Determine the number of paths from $A$ to $B$ on the picture that go along gridlines only, do not pass through any point twice, and never go upwards? [img]https://cdn.artofproblemsolving.com/attachments/0/2/87868e24a48a2e130fb5039daeb85af42f4b9d.png[/img]

[b]p1.[/b] What is the value of the sum $2 + 20 + 202 + 2022$? [b]p2.[/b] Find the smallest integer greater than $10000$ that is divisible by $12$. [b]p3.[/b] Valencia chooses a positive integer factor of $6^{10}$ at random. The probability that it is odd can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime integers. Find $m + n$. [b]p4.[/b] How many three digit positive integers are multiples of $4$ but not $8$? [b]p5.[/b] At the Jane Street store, Andy accidentally buys $5$ dollars more worth of shirts than he had planned. Originally, including the tip to the cashier, he planned to spend all of the remaining $90$ dollars on his giftcard. To compensate for his gluttony, Andy instead gives the cashier a smaller, $12.5\%$ tip so that he still spends $90$ dollars total. How much percent tip was Andy originally planning on giving? [b]p6.[/b] Let $A,B,C,D$ be four coplanar points satisfying the conditions $AB = 16$, $AC = BC =10$, and $AD = BD = 17$. What is the minimum possible area of quadrilateral $ADBC$? [b]p7.[/b] How many ways are there to select a set of three distinct points from the vertices of a regular hexagon so that the triangle they form has its smallest angle(s) equal to $30^o$? [b]p8.[/b] Jaeyong rolls five fair $6$-sided die. The probability that the sum of some three rolls is exactly $8$ times the sum of the other two rolls can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]p9.[/b] Find the least positive integer n for there exists some positive integer $k > 1$ for which $k$ and $k + 2$ both divide $\underbrace{11...1}_{n\,\,\,1's}$. [b]p10.[/b] For some real constant $k$, line $y = k$ intersects the curve $y = |x^4-1|$ four times: points $A$,$B$,$C$ and $D$, labeled from left to right. If $BC = 2AB = 2CD$, then the value of $k$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]p11.[/b] Let a be a positive real number and $P(x) = x^2 -8x+a$ and $Q(x) = x^2 -8x+a+1$ be quadratics with real roots such that the positive difference of the roots of $P(x)$ is exactly one more than the positive difference of the roots of $Q(x)$. The value of a can be written as a common fraction $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [b]p12.[/b] Let $ABCD$ be a trapezoid satisfying $AB \parallel CD$, $AB = 3$, $CD = 4$, with area $35$. Given $AC$ and $BD$ intersect at $E$, and $M$, $N$, $P$, $Q$ are the midpoints of segments $AE$,$BE$,$CE$,$DE$, respectively, the area of the intersection of quadrilaterals $ABPQ$ and $CDMN$ can be expressed as $\frac{m}{n}$ where $m, n$ are relatively prime positive integers. Find $m + n$. [b]p13.[/b] There are $8$ distinct points $P_1, P_2, ... , P_8$ on a circle. How many ways are there to choose a set of three distinct chords such that every chord has to touch at least one other chord, and if any two chosen chords touch, they must touch at a shared endpoint? [b]p14.[/b] For every positive integer $k$, let $f(k) > 1$ be defined as the smallest positive integer for which $f(k)$ and $f(k)^2$ leave the same remainder when divided by $k$. The minimum possible value of $\frac{1}{x}f(x)$ across all positive integers $x \le 1000$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. Find $m + n$. [b]p15.[/b] In triangle $ABC$, let $I$ be the incenter and $O$ be the circumcenter. If $AO$ bisects $\angle IAC$, $AB + AC = 21$, and $BC = 7$, then the length of segment $AI$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]R[/b]thea, a distant planet, is home to creatures whose DNA consists of two (distinguishable) strands of bases with a fixed orientation. Each base is one of the letters H, M, N, T, and each strand consists of a sequence of five bases, thus forming five pairs. Due to the chemical properties of the bases, each pair must consist of distinct bases. Also, the bases H and M cannot appear next to each other on the same strand; the same is true for N and T. How many possible DNA sequences are there on Rthea?

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

Each vertex of an $m\times n$ grid is colored blue, green or red in such a way that all the boundary vertices are red. We say that a unit square of the grid is properly colored if: $(i)$ all the three colors occur at the vertices of the square, and $(ii)$ one side of the square has the endpoints of the same color. Show that the number of properly colored squares is even.

In a dancing hall, there are $n$ girls standing in one row and $n$ boys in the other row across them (so that all $2n$ dancers form a $2 \times n$ board). Each dancer gives her / his left hand to a neighboring person standing to the left, across, or diagonally to the left. The analogous rule applies for right hands. No dancer gives both hands to the same person. In how many ways can the dancers do this?