The positive integers are colored with black and white such that: - There exists a bijection from the black numbers to the white numbers, - The sum of three black numbers is a black number, and - The sum of three white numbers is a white number. Find the number of possible colorings that satisfies the above conditions.

$1600$ bananas are distributed among $100$ monkeys (it is possible that some monkeys do not receive bananas). Prvove that at least four monkeys receive the same amount of bananas.

[b]p19.[/b] Sequences $a_n$ and $b_n$ of positive integers satisfy the following properties: (1) $a_1 = b_1 = 1$ (2) $a_5 = 6, b_5 \ge 7$ (3) Both sequences are strictly increasing (4) In each sequence, the difference between consecutive terms is either $1$ or $2$ (5) $\sum^5_{n=1}na_n =\sum^5_{n=1}nb_n = S$ Compute $S$. [b]p20.[/b] Let $A$, $B$, and $C$ be points lying on a line in that order such that $AB = 4$ and $BC = 2$. Let $I$ be the circle centered at B passing through $C$, and let $D$ and $E$ be distinct points on $I$ such that $AD$ and $AE$ are tangent to $I$. Let $J$ be the circle centered at $C$ passing through $D$, and let $F$ and $G$ be distinct points on $J$ such that $AF$ and $AG$ are tangent to $J$ and $DG < DF$. Compute the area of quadrilateral $DEFG$. [b]p21.[/b] Twain is walking randomly on a number line. They start at $0$, and flip a fair coin $10$ times. Every time the coin lands heads, they increase their position by 1, and every time the coin lands tails, they decrease their position by $1$. What is the probability that at some point the absolute value of their position is at least $3$? PS. You should use hide for answers.

Let $S$ be a circle, and $\alpha =\{A_1,\ldots ,A_n\}$ a family of open arcs in $S$. Let $N(\alpha )=n$ denote the number of elements in $\alpha$. We say that $\alpha$ is a covering of $S$ if $\bigcup_{k=1}^n A_k\supset S$. Let $\alpha=\{A_1,\ldots ,A_n\}$ and $\beta =\{B_1,\ldots ,B_m\}$ be two coverings of $S$. Show that we can choose from the family of all sets $A_i\cap B_j,\ i=1,2,\ldots ,n,\ j=1, 2,\ldots ,m,$ a covering $\gamma$ of $S$ such that $N(\gamma )\le N(\alpha)+N(\beta)$.

Players $A$ and $B$ play the following game: $A$ tosses a coin $n$ times, and $B$ does $n+1$ times. The player who obtains more ”heads” wins; or in the case of equal balances, $A$ is assigned victory. Find the values of $n$ for which this game is fair (i.e. both players have equal chances for victory).

Let $k$ and $n$ be positive integers. Consider an array of $2\left(2^n-1\right)$ rows by $k$ columns. A $2$-coloring of the elements of the array is said to be [i]acceptable[/i] if any two columns agree on less than $2^n-1$ entries on the same row. Given $n$, determine the maximum value of $k$ for an acceptable $2$-coloring to exist.

Prove that there are infinitely many positive integers $n$ for which it is possible for a knight, starting at one of the squares of an $n \times n$ chessboard, to go through each of the squares exactly once.

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line $L$ parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on $L$ is not greater than $1$?

[b]p1.[/b] The remainder of a number when divided by $7$ is $5$. If I multiply the number by $32$ and add $18$ to the product, what is the new remainder when divided by $7$? [b]p2.[/b] If a fair coin is flipped $15$ times, what is the probability that there are more heads than tails? [b]p3.[/b] Let $-\frac{\sqrt{p}}{q}$ be the smallest nonzero real number such that the reciprocal of the number is equal to the number minus the square root of the square of the number, where $p$ and $q$ are positive integers and $p$ is not divisible the square of any prime. Find $p + q$. [b]p4.[/b] Rachel likes to put fertilizers on her grass to help her grass grow. However, she has cows there as well, and they eat $3$ little fertilizer balls on average. If each ball is spherical with a radius of $4$, then the total volume that each cow consumes can be expressed in the form $a\pi$ where $a$ is an integer. What is $a$? [b]p5.[/b] One day, all $30$ students in Precalc class are bored, so they decide to play a game. Everyone enters into their calculators the expression $9 \diamondsuit 9 \diamondsuit 9 ... \diamondsuit 9$, where $9$ appears $2020$ times, and each $\diamondsuit$ is either a multiplication or division sign. Each student chooses the signs randomly, but they each choose one more multiplication sign than division sign. Then all $30$ students calculate their expression and take the class average. Find the expected value of the class average. [b]p6.[/b] NaNoWriMo, or National Novel Writing Month, is an event in November during which aspiring writers attempt to produce novel-length work - formally defined as $50,000$ words or more - within the span of $30$ days. Justin wants to participate in NaNoWriMo, but he's a busy high school student: after accounting for school, meals, showering, and other necessities, Justin only has six hours to do his homework and perhaps participate in NaNoWriMo on weekdays. On weekends, he has twelve hours on Saturday and only nine hours on Sunday, because he goes to church. Suppose Justin spends two hours on homework every single day, including the weekends. On Wednesdays, he has science team, which takes up another hour and a half of his time. On Fridays, he spends three hours in orchestra rehearsal. Assume that he spends all other time on writing. Then, if November $1$st is a Friday, let $w$ be the minimum number of words per minute that Justin must type to finish the novel. Round $w$ to the nearest whole number. [b]p7.[/b] Let positive reals $a$, $b$, $c$ be the side lengths of a triangle with area $2030$. Given $ab + bc + ca = 15000$ and $abc = 350000$, find the sum of the lengths of the altitudes of the triangle. [b]p8.[/b] Find the minimum possible area of a rectangle with integer sides such that a triangle with side lengths $3$, $4$, $5$, a triangle with side lengths $4$, $5$, $6$, and a triangle with side lengths $\frac94$, $4$, $4$ all fit inside the rectangle without overlapping. [b]p9.[/b] The base $16$ number $10111213...99_{16}$, which is a concatenation of all of the (base $10$) $2$-digit numbers, is written on the board. Then, the last $2n$ digits are erased such that the base $10$ value of remaining number is divisible by $51$. Find the smallest possible integer value of $n$. [b]p10.[/b] Consider sequences that consist entirely of $X$'s, $Y$ 's and $Z$'s where runs of consecutive $X$'s, $Y$ 's, and $Z$'s are at most length $3$. How many sequences with these properties of length $8$ are there? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $E$ denote the set of $25$ points $(m,n)$ in the $\text{xy}$-plane, where $m,n$ are natural numbers, $1\leq m\leq5,1\leq n\leq5$. Suppose the points of $E$ are arbitrarily coloured using two colours, red and blue. SHow that there always exist four points in the set $E$ of the form $(a,b),(a+k,b),(a+k,b+k),(a,b+k)$ for some positive integer $k$ such that at least three of these four points have the same colour. (That is, there always exist four points in the set $E$ which form the vertices of a square with sides parallel to the axes and having at least three points of the same colour.)

Given is a prime number $p$ and natural $n$ such that $p \geq n \geq 3$. Set $A$ is made of sequences of lenght $n$ with elements from the set $\{0,1,2,...,p-1\}$ and have the following property: For arbitrary two sequence $(x_1,...,x_n)$ and $(y_1,...,y_n)$ from the set $A$ there exist three different numbers $k,l,m$ such that: $x_k \not = y_k$, $x_l \not = y_l$, $x_m \not = y_m$. Find the largest possible cardinality of $A$.

Define a positive integer $n$ to be a fake square if either $n = 1$ or $n$ can be written as a product of an even number of not necessarily distinct primes. Prove that for any even integer $k \geqslant 2$, there exist distinct positive integers $a_1$, $a_2, \cdots, a_k$ such that the polynomial $(x+a_1)(x+a_2) \cdots (x+a_k)$ takes ‘fake square’ values for all $x = 1,2,\cdots,2023$. [i]Proposed by Prof. Aditya Karnataki[/i]

Eight rooks are placed on a $8\times 8$ chessboard, so that no two rooks attack one another. All squares of the board are divided between the rooks as follows. A square where a rook is placed belongs to it. If a square is attacked by two rooks then it belongs to the nearest rook; in case these two rooks are equidistant from this square each of them possesses a half of the square. Prove that every rook possesses the equal area.

An integer set [i][b]T[/b][/i] is orensan if there exist integers[b] a<b<c[/b], where [b]a [/b]and [b]c[/b] are part of [i][b]T[/b][/i], but [b]b[/b] is not part of [b][i]T[/i][/b]. Count the number of subsets [b][i]T[/i][/b] of {1,2,...,2019} which are orensan.

A box contains red, blue, and white balls, $100$ balls in total. It is known that among any $26$ of them there are always $10$ balls of the same color. Find the minimal number $N$ such that among any $N$ balls there are always $30$ balls of the same color.

There are $20$ collinear points, separated by the same distance: $$. \,\,\, . \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\,. \,\,\, .$$ Miguel has to paint three or more of these points red, in such a way that the red points are separated by the same distance and it is impossible to paint exactly one more point red without violating the previous condition. Determine in how many ways Miguel can do his homework.

It is allowed to perform the following transformations in the plane with any integers $a$: (1) Transform every point $(x, y)$ to the corresponding point $(x + ay, y)$, (2) Transform every point $(x, y)$ to the corresponding point $(x, y + ax)$. Does there exist a non-square rhombus whose all vertices have integer coordinates and which can be transformed to: a) Vertices of a square, b) Vertices of a rectangle with unequal side lengths?

Call a subset of $\{1,2,\ldots, n\}$ [i]unfriendly[/i] if no two of its elements are consecutive. Show that the number of unfriendly subsets with $k$ elements is $\binom{n-k+1}{k}.$

A basket is called "[i]Stuff Basket[/i]" if it includes $10$ kilograms of rice and $30$ number of eggs. A market is to distribute $100$ Stuff Baskets. We know that there is totally $1000$ kilograms of rice and $3000$ number of eggs in the baskets, but some of market's baskets include either more or less amount of rice or eggs. In each step, market workers can select two baskets and move an arbitrary amount of rice or eggs between selected baskets. Starting from an arbitrary situation, what's the minimum number of steps that workers provide $100$ Stuff Baskets?

Every pair of communities in a county are linked directly by one mode of transportation; bus, train, or airplane. All three methods of transportation are used in the county with no community being serviced by all three modes and no three communities being linked pairwise by the same mode. Determine the largest number of communities in this county.

Bilbo, Gandalf, and Nitzan play the following game. First, Nitzan picks a whole number between $1$ and $2^{2022}$ inclusive and reveals it to Bilbo. Bilbo now compiles a string of length $4044$ built from the three letters $a,b,c$. Nitzan looks at the string, chooses one of the three letters $a,b,c$, and removes from the string all instances of the chosen letter. Only then is the string revealed to Gandalf. He must now guess the number Nitzan chose. Can Bilbo and Gandalf work together and come up with a strategy beforehand that will always allow Gandalf to guess Nitzan's number correctly, no matter how he acts?

We say that a graph $G$ is [i]divisive[/i], if we can write a positive integer on each of its vertices such that all the integers are distinct, and any two of these integers divide each other if and only if there is an edge running between them in $G$. Which Platonic solids form a divisive graph? [img]https://cdn.artofproblemsolving.com/attachments/1/5/7c81439ee148ccda09c429556e0740865723e0.png[/img]

Given a $m \times n$ rectangle where $m,n\geq 2023$. The square in the $i$-th row and $j$-th column is filled with the number $i+j$ for $1\leq i \leq m, 1\leq j \leq n$. In each move, Alice can pick a $2023 \times 2023$ subrectangle and add $1$ to each number in it. Alice wins if all the numbers are multiples of $2023$ after a finite number of moves. For which pairs $(m,n)$ can Alice win? [i]Proposed by Boon Qing Hong[/i]

Find the smallest integer $n$ satisfying the following condition: regardless of how one colour the vertices of a regular $n$-gon with either red, yellow or blue, one can always find an isosceles trapezoid whose vertices are of the same colour.