Let $s$ and $t$ be two parallel lines. We have marked $k$ points on line $s$ and $n$ points on line $t$ ($k\geq n$). If it is known that the total number of triangles that have their three vertices at marked points is $220$, find all possible values of $k$ and $n$.

Form the infinite graph $A$ by taking the set of primes $p$ congruent to $1\pmod{4}$, and connecting $p$ and $q$ if they are quadratic residues modulo each other. Do the same for a graph $B$ with the primes $1\pmod{8}$. Show $A$ and $B$ are isomorphic to each other. [i]Linus Hamilton.[/i]

Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2n \times 2n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contain two marked cells.

[b]p1.[/b] Find $$2^{\left(0^{\left(2^3\right)}\right)}$$ [b]p2.[/b] Amy likes to spin pencils. She has an $n\%$ probability of dropping the $n$th pencil. If she makes $100$ attempts, the expected number of pencils Amy will drop is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [b]p3.[/b] Determine the units digit of $3 + 3^2 + 3^3 + 3^4 +....+ 3^{2022} + 3^{2023}$. [b]p4.[/b] Cyclic quadrilateral $ABCD$ is inscribed in circle $\omega$ with center $O$ and radius $20$. Let the intersection of $AC$ and $BD$ be $E$, and let the inradius of $\vartriangle AEB$ and $\vartriangle CED$ both be equal to $7$. Find $AE^2 - BE^2$. [b]p5.[/b] An isosceles right triangle is inscribed in a circle which is inscribed in an isosceles right triangle that is inscribed in another circle. This larger circle is inscribed in another isosceles right triangle. If the ratio of the area of the largest triangle to the area of the smallest triangle can be expressed as $a+b\sqrt{c}$, such that $a, b$ and $c$ are positive integers and no square divides $c$ except $1$, find $a + b + c$. [b]p6.[/b] Jonny has three days to solve as many ISL problems as he can. If the amount of problems he solves is equal to the maximum possible value of $gcd \left(f(x), f(x+1) \right)$ for $f(x) = x^3 +2$ over all positive integer values of $x$, then find the amount of problems Jonny solves. [b]p7.[/b] Three points $X$, $Y$, and $Z$ are randomly placed on the sides of a square such that $X$ and $Y$ are always on the same side of the square. The probability that non-degenerate triangle $\vartriangle XYZ$ contains the center of the square can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p8.[/b] Compute the largest integer less than $(\sqrt7 +\sqrt3)^6$. [b]p9.[/b] Find the minimum value of the expression $\frac{(x+y)^2}{x-y}$ given $x > y > 0$ are real numbers and $xy = 2209$. [b]p10.[/b] Find the number of nonnegative integers $n \le 6561$ such that the sum of the digits of $n$ in base $9$ is exactly $4$ greater than the sum of the digits of $n$ in base $3$. [b]p11.[/b] Estimation (Tiebreaker) Estimate the product of the number of people who took the December contest, the sum of all scores in the November contest, and the number of incorrect responses for Problem $1$ and Problem $2$ on the October Contest. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$N> 4$ points move around the circle, each with a constant speed. For Any four of them have a moment in time when they all meet. Prove that is the moment when all the points meet.

Let $X=\{1,2,3,...,10\}$. Find the number of pairs of $\{A,B\}$ such that $A\subseteq X, B\subseteq X, A\ne B$ and $A\cap B=\{5,7,8\}$.

An [i]augmentation[/i] on a graph $G$ is defined as doing the following: - Take some set $D$ of vertices in $G$, and duplicate each vertex $v_i \in D$ to create a new vertex $v_i'$. - If there's an edge between a pair of vertices $v_i, v_j \in D$, create an edge between vertices $v_i'$ and $v_j'$. If there's an edge between a pair of vertices $v_i \in D$, $v_j \notin D$, you can choose to create an edge between $v_i'$ and $v_j$ but do not have to. A graph is called [i]reachable[/i] from $G$ if it can be created through some sequence of augmentations on $G$. Some graph $H$ has $n$ vertices and satisfies that both $H$ and the complement of $H$ are reachable from a complete graph of $2021$ vertices. If the maximum and minimum values of $n$ are $M$ and $m$, find $M+m$. [i]Proposed by Oliver Hayman[/i]

The numbers from $1$ to $2000^2$ were written on a board. Vasya choose $2000$ of them whose sum of them equal to two thousandth of the sum of all numbers. Proof that his friend, Petya, will be able to color each of the remaining numbers by one of other $1999$ colors so that the sum of numbers with each of total $2000$ colors are the same.

Consider $2009$ cards, each having one gold side and one black side, lying on parallel on a long table. Initially all cards show their gold sides. Two player, standing by the same long side of the table, play a game with alternating moves. Each move consists of choosing a block of $50$ consecutive cards, the leftmost of which is showing gold, and turning them all over, so those which showed gold now show black and vice versa. The last player who can make a legal move wins. (a) Does the game necessarily end? (b) Does there exist a winning strategy for the starting player? [i]Proposed by Michael Albert, Richard Guy, New Zealand[/i]

For a positive integer $n$, let $A_n$ and $B_n$ be the families of $n$-element subsets of $S_n=\{1,2,\ldots ,2n\}$ with respectively even and odd sums of elements. Compute $|A_n|-|B_n|$.

[u]Round 1[/u] [b]1.1.[/b] A classroom has $29$ students. A teacher needs to split up the students into groups of at most $4$. What is the minimum number of groups needed? [b]1.2.[/b] On his history map quiz, Eric recalls that Sweden, Norway and Finland are adjacent countries, but he has forgotten which is which, so he labels them in random order. The probability that he labels all three countries correctly can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]1.3.[/b] In a class of $40$ sixth graders, the class average for their final test comes out to be $90$ (out of a $100$). However, a student brings up an issue with problem $5$, and $10$ students receive credit for this question, bringing the class average to a $90.75$. How many points was problem $5$ worth? [u]Round 2[/u] [b]2.1.[/b] Compute $1 - 2 + 3 - 4 + ... - 2022 + 2023$. [b]2.2.[/b] In triangle $ABC$, $\angle ABC = 75^o$. Point $D$ lies on side $AC$ such that $BD = CD$ and $\angle BDC$ is a right angle. Compute the measure of $\angle A$. [b]2.3.[/b] Joe is rolling three four-sided dice each labeled with positive integers from $1$ to $4$. The probability the sum of the numbers on the top faces of the dice is $6$ can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime integers. Find $p + q$. [u]Round 3[/u] [b]3.1.[/b] For positive integers $a, b, c, d$ that satisfy $a + b + c + d = 23$, what is the maximum value of $abcd$? [b]3.2.[/b] A buckball league has twenty teams. Each of the twenty teams plays exactly five games with each of the other teams. If each game takes 1 hour and thirty minutes, then how many total hours are spent playing games? [b]3.3.[/b] For a triangle $\vartriangle ABC$, let $M, N, O$ be the midpoints of $AB$, $BC$, $AC$, respectively. Let $P, Q, R$ be points on $AB$, $BC$, $AC$ such that $AP =\frac13 AB$, $BQ =\frac13 BC$, and $CR =\frac13 AC$. The ratio of the areas of $\vartriangle MNO$ and $\vartriangle P QR$ can be expressed as $\frac{m}{n}$ , where $ m$ and $n$ are relatively prime positive integers. Find $m + n$. [u]Round 4[/u] [b]4.1.[/b] $2023$ has the special property that leaves a remainder of $1$ when divided by $2$, $21$ when divided by $22$, and $22$ when divided by $23$. Let $n$ equal the lowest integer greater than $2023$ with the above properties. What is $n$? [b]4.2.[/b] Ants $A, B$ are on points $(0, 0)$ and $(3, 3)$ respectively, and ant A is trying to get to $(3, 3)$ while ant $B$ is trying to get to $(0, 0)$. Every second, ant $A$ will either move up or right one with equal probability, and ant $B$ will move down or left one with equal probability. The probability that the ants will meet each other be $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]4.3.[/b] Find the number of trailing zeros of $100!$ in base $ 49$. PS. You should use hide for answers. Rounds 5-9 have been posted [url=https://artofproblemsolving.com/community/c3h3129723p28347714]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alice is drawing a shape on a piece of paper. She starts by placing her pencil at the origin, and then draws line segments of length one, alternating between vertical and horizontal segments. Eventually, her pencil returns to the origin, forming a closed, non-self-intersecting shape. Show that the area of this shape is even if and only if its perimeter is a multiple of eight.

The natural numbers $y>x$ are written on the board. Vassya decides to write the reminder of one number on the board to some other non-zero number in each step. Prove that Vassya can find a natural number $k$ such that if $y>k$ then the number distinct numbers on the board after arbitrary number of steps does not exceed $\frac{y}{1000000}.$

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

There are $n$ students sitting on a round table. You collect all of $ n $ name tags and give them back arbitrarily. Each student gets one of $n$ name tags. Now $n$ students repeat following operation: The students who have their own name tags exit the table. The other students give their name tags to the student who is sitting right to him. Find the number of ways giving name tags such that there exist a student who don't exit the table after 4 operations.

$(NET 4)$ A boy has a set of trains and pieces of railroad track. Each piece is a quarter of circle, and by concatenating these pieces, the boy obtained a closed railway. The railway does not intersect itself. In passing through this railway, the train sometimes goes in the clockwise direction, and sometimes in the opposite direction. Prove that the train passes an even number of times through the pieces in the clockwise direction and an even number of times in the counterclockwise direction. Also, prove that the number of pieces is divisible by $4.$

Let $A$ be a set of finite distinct positive real numbers. Two other sets $B$, $C$ are defined by: \[B = \left\{ {\frac{x}{y};x,y \in A} \right\},\; \; \; C = \left\{ {xy;x,y \in A} \right\}\] Prove that $\left| A \right|.\left| B \right| \le {\left| C \right|^2}$.

Let $n \ge 3$ be a positive integer, and let $S$ be a set of $n$ distinct points in the plane. Call an unordered pair of distinct points ${A,B}$ [i]tasty[/i] if there exists a circle passing through $A$ and $B$ not passing through or containing any other point in $S$. Find the maximum number of tasty pairs over all possible sets $S$ of $n$ points. [i]Tiger Zhang[/i]

Consider on the coordinate plane all rectangles whose (i) vertices have integer coordinates; (ii) edges are parallel to coordinate axes; (iii) area is $2^k$, where $k = 0,1,2....$ Is it possible to color all points with integer coordinates in two colors so that no such rectangle has all its vertices of the same color?

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

[u]Round 5[/u] [b]p13.[/b] A unit square is rotated $30^o$ counterclockwise about one of its vertices. Determine the area of the intersection of the original square with the rotated one. [b]p14.[/b] Suppose points $A$ and $B$ lie on a circle of radius $4$ with center $O$, such that $\angle AOB = 90^o$. The perpendicular bisectors of segments $OA$ and $OB$ divide the interior of the circle into four regions. Find the area of the smallest region. [b]p15.[/b] Let $ABCD$ be a quadrilateral such that $AB = 4$, $BC = 6$, $CD = 5$, $DA = 3$, and $\angle DAB = 90^o$. There is a point $I$ inside the quadrilateral that is equidistant from all the sides. Find $AI$. [u]Round 6[/u] [i]The answer to each of the three questions in this round depends on the answer to one of the other questions. There is only one set of correct answers to these problems; however, each question will be scored independently, regardless of whether the answers to the other questions are correct. [/i] [b]p16.[/b] Let $C$ be the answer to problem $18$. Compute $$\left( 1 - \frac{1}{2^2} \right) \left( 1 - \frac{1}{3^2} \right) ... \left( 1 - \frac{1}{C^2} \right).$$ [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $PQRS$ be a square, and let point $M$ lie on segment $PQ$ such that $MQ = 7PM$ and point $N$ lie on segment $PS$ such that $NS = 7PN$. Segments $MS$ and $NQ$ meet at point $X$. Given that the area of quadrilateral $PMXN$ is $A - \frac12$, find the side length of the square. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $N = 6B$. Find the number of ordered triples $(a, b, c)$ of integers between $0$ and $N - 1$, inclusive, such that $a + b + c$ is divisible by $N$. [u]Round 7[/u] [b]p19.[/b] Let $k$ be the units digit of $\underbrace{7^{7^{7^{7^{7^{7^{7}}}}}}}_{Seven \,\,7s}$ . What is the largest prime factor of the number consisting of $k$ $7$’s written in a row? [b]p20.[/b] Suppose that $E = 7^7$ , $M = 7$, and $C = 7·7·7$. The characters $E, M, C, C$ are arranged randomly in the following blanks. $$... \times ... \times ... \times ... $$ Then one of the multiplication signs is chosen at random and changed to an equals sign. What is the probability that the resulting equation is true? [b]p21[/b]. During a recent math contest, Sophy Moore made the mistake of thinking that $133$ is a prime number. Fresh Mann replied, “To test whether a number is divisible by $3$, we just need to check whether the sum of the digits is divisible by $3$. By the same reasoning, to test whether a number is divisible by $7$, we just need to check that the sum of the digits is a multiple of $7$, so $133$ is clearly divisible by $7$.” Although his general principle is false, $133$ is indeed divisible by $7$. How many three-digit numbers are divisible by $7$ and have the sum of their digits divisible by $7$? [u]Round 8[/u] [b]p22.[/b] A [i]look-and-say[/i] sequence is defined as follows: starting from an initial term $a_1$, each subsequent term $a_k$ is found by reading the digits of $a_{k-1}$ from left to right and specifying the number of times each digit appears consecutively. For example, $4$ would be succeeded by $14$ (“One four.”), and $31337$ would be followed by $13112317$ (“One three, one one, two three, one seven.”) If $a_1$ is a random two-digit positive integer, find the probability that $a_4$ is at least six digits long. [b]p23.[/b] In triangle $ABC$, $\angle C = 90^o$. Point $P$ lies on segment $BC$ and is not $B$ or $C$. Point $I$ lies on segment $AP$, and $\angle BIP = \angle PBI = \angle CAB$. If $\frac{AP}{BC} = k$, express $\frac{IP}{CP}$ in terms of $k$. [b]p24.[/b] A subset of $\{1, 2, 3, ... , 30\}$ is called [i]delicious [/i] if it does not contain an element that is $3$ times another element. A subset is called super delicious if it is delicious and no delicious set has more elements than it has. Determine the number of super delicious subsets. PS. You sholud use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2784267p24464980]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] If the pairwise sums of the three numbers $x$, $y$, and $z$ are $22$, $26$, and $28$, what is $x + y + z$? [b]p2.[/b] Suhas draws a quadrilateral with side lengths $7$, $15$, $20$, and $24$ in some order such that the quadrilateral has two opposite right angles. Find the area of the quadrilateral. [b]p3.[/b] Let $(n)*$ denote the sum of the digits of $n$. Find the value of $((((985^{998})*)*)*)*$. [b]p4.[/b] Everyone wants to know Andy's locker combination because there is a golden ticket inside. His locker combination consists of 4 non-zero digits that sum to an even number. Find the number of possible locker combinations that Andy's locker can have. [b]p5.[/b] In triangle $ABC$, $\angle ABC = 3\angle ACB$. If $AB = 4$ and $AC = 5$, compute the length of $BC$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A_1A_2 ...A_{360}$ be a regular $360$-gon with centre $S$. For each of the triangles $A_1A_{50}A_{68}$ and $A_1A_{50}A_{69}$ determine, whether its images under some $120$ rotations with centre $S$ can have (as triangles) all the $360$ points $A_1, A_2, ..., A_{360}$ as vertices.

Let $n\geq 3$ be a positive integer. Inside a $n\times n$ array there are placed $n^2$ positive numbers with sum $n^3$. Prove that we can find a square $2\times 2$ of 4 elements of the array, having the sides parallel with the sides of the array, and for which the sum of the elements in the square is greater than $3n$. [i]Radu Gologan[/i]

66 dwarfs have a total of 111 hats. Each of the hats belongs to a dwarf and colored by 66 different colors. Festivities are organized where each of these dwarfs wears their own hat. There is no dwarf pair wearing the same colored hat in any of the festivities. For any two of the festivities, there exist a dwarf wearing a hat of a different color in these festivities. Find the maximum value of the number of festivities that can be organized.