[b]p1.[/b] Prove that no matter what digits are placed in the four empty boxes, the eight-digit number $9999\Box\Box\Box\Box$ is not a perfect square. [b]p2.[/b] Prove that the number $m/3+m^2/2+m^3/6$ is integral for all integral values of $m$. [b]p3.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p4.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/4/b/ca707bf274ed54c1b22c4f65d3d0b0a5cfdc56.png[/img] [b]p5.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $7$ rocks in the first pile and $9$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p6.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Every face of a cube is colored one of $3$ colors at random. What is the expected number of edges that lie along two faces of different colors?

Some pairs of cities in a certain country are connected by roads, at least three roads going out of each city. Prove that there exists a round path consisting of roads whose number is not divisible by $3$.

The audience arranges $n$ coins in a row. The sequence of heads and tails is chosen arbitrarily. The audience also chooses a number between $1$ and $n$ inclusive. Then the assistant turns one of the coins over, and the magician is brought in to examine the resulting sequence. By an agreement with the assistant beforehand, the magician tries to determine the number chosen by the audience. [list][b](a)[/b] Prove that if this is possible for some $n$, then it is also possible for $2n$. [b](b)[/b] Determine all $n$ for which this is possible.[/list]

Let $S_1, S_2, \ldots, S_{100}$ be finite sets of integers whose intersection is not empty. For each non-empty $T \subseteq \{S_1, S_2, \ldots, S_{100}\},$ the size of the intersection of the sets in $T$ is a multiple of the number of sets in $T$. What is the least possible number of elements that are in at least $50$ sets? [i]Proposed by Rishabh Das[/i]

For $ n\ge 2$, let $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ be $ 2^n$ subsets of $ A \equal{} \{1, 2, 3, \ldots, 2^{n \plus{} 1}\}$ that satisfy the following property: There do not exist indices $ a$ and $ b$ with $ a < b$ and elements $ x$, $ y$, $ z\in A$ with $ x < y < z$ and $ y$, $ z\in S_a$, and $ x$, $ z\in S_b$. Prove that at least one of the sets $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ contains no more than $ 4n$ elements. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

A rectangular array has 9 rows and 2004 columns. In the 9 * 2004 cells of the table we place the numbers from 1 to 2004, each 9 times. And we do this in such a way that two numbers, which stand in exactly the same column in and differ around at most by 3. Find the smallest possible sum of all numbers in the first row.

Let \( m \) and \( n \) be positive integers. Kellem and Carmen play the following game: initially, the number $0$ is on the board. Starting with Kellem and alternating turns, they add powers of \( m \) to the previous number on the board, such that the new value on the board does not exceed \( n \). The player who writes \( n \) wins. Determine, for each pair \( (m, n) \), who has the winning strategy. [b]Note:[/b] A power of \( m \) is a number of the form \( m^k \), where \( k \) is a non-negative integer.

There is a board of $2008\times 2008$ and $2008$ pieces, one in each row and each column of the board. It is allowed to do one of the following movements: a) Take two steps to the right and $10$ up. b) Take two steps to the right and $6$ steps down. c) Take two steps to the left and $6$ steps up. d) Take two steps to the left and $10$ steps down. If the path down cannot be completed, it is skipped to the upper part along the same column and the route continues normally, similarly in the other directions. In each play you will move a checker using any of the allowed operations. Would it be possible that at some point, after a finite number of played, the pieces are located forming a square of side $44$ in the upper left corner of the board and the remaining $72$ are in the last row in the first $72$ boxes?

Given a $2023 \times 2023$ square grid, there are beetles on some of the unit squares, with at most one beetle on each unit square. In the first minute, every beetle will move one step to its right or left adjacent square. In the second minute, every beetle will move again, only this time, in case the beetle moved right or left in the previous minute, it moves to top or bottom in this minute, and vice versa, and so on. What is the minimum number of beetles on the square grid to ensure that, no matter where the beetles are initially, and how they move in the first minute, but after finitely many minutes, at least two beetles will meet at a certain unit square.

Prove that the squares with sides $\frac{1}{1}, \frac{1}{2}, \frac{1}{3},\ldots$ may be put into the square with side $\frac{3}{2} $ in such a way that no two of them have any interior point in common.

At least three players have participated in a tennis tournament. Evey two players have played each other exactly once, and each player has at least one match won. Show that there are three players $A,B,C$ such that $A$ won against $B$, $B$ won against $C$ and $C$ won against $A$.

Three travel companies provide transportation between $n$ cities, such that each connection between a pair of cities is covered by one company only. Prove that, for $n \geq 11$, there must exist a round-trip through some four cities, using the services of a same company, while for $n < 11$ this is not anymore necessarily true. [i]Dan Schwarz[/i]

Consider a grid board of $n \times n$, with $n \ge 5$. Two unit squares are said to be far [i]apart [/i] if they are neither on the same row nor on consecutive rows and neither in the same column nor in consecutive columns. Take $3$ rectangles with vertices and sides on the points and lines of board so that if two unit squares belong to different rectangles, then they are [i]apart [/i]. In how many ways is it possible to do this?

[b]p1.[/b] If $x^2 = 7$, what is $x^4 + x^2 + 1$? [b]p2.[/b] Richard and Alex are competing in a $150$-meter race. If Richard runs at a constant speed of $5$ meters per second and Alex runs at a constant speed of $3$ meters per second, how many more seconds does it take for Alex to finish the race? [b]p3.[/b] David and Emma are playing a game with a chest of $100$ gold coins. They alternate turns, taking one gold coin if the chest has an odd number of gold coins or taking exactly half of the gold coins if the chest has an even number of gold coins. The game ends when there are no more gold coins in the chest. If Emma goes first, how many gold coins does Emma have at the end? [b]p4.[/b] What is the only $3$-digit perfect square whose digits are all different and whose units digit is $5$? [b]p5.[/b] In regular pentagon $ABCDE$, let $F$ be the midpoint of $\overline{AB}$, $G$ be the midpoint of $\overline{CD}$, and $H$ be the midpoint of $\overline{AE}$. What is the measure of $\angle FGH$ in degrees? [b]p6.[/b] Water enters at the left end of a pipe at a rate of $1$ liter per $35$ seconds. Some of the water exits the pipe through a leak in the middle. The rest of the water exits from the right end of the pipe at a rate of $1$ liter per $36$ seconds. How many minutes does it take for the pipe to leak a liter of water? [b]p7.[/b] Carson wants to create a wire frame model of a right rectangular prism with a volume of $2022$ cubic centimeters, where strands of wire form the edges of the prism. He wants to use as much wire as possible. If Carson also wants the length, width, and height in centimeters to be distinct whole numbers, how many centimeters of wire does he need to create the prism? [b]p8.[/b] How many ways are there to fill the unit squares of a $3 \times 5$ grid with the digits $1$, $2$, and $3$ such that every pair of squares that share a side differ by exactly $1$? [b]p9.[/b] In pentagon ABCDE, $AB = 54$, $AE = 45$, $DE = 18$, $\angle A = \angle C = \angle E$, $D$ is on line segment $\overline{BE}$, and line $BD$ bisects angle $\angle ABC$, as shown in the diagram below. What is the perimeter of pentagon $ABCDE$? [img]https://cdn.artofproblemsolving.com/attachments/2/0/7c25837bb10b128a1c7a292f6ce8ce3e64b292.png[/img] [b]p10.[/b] If $x$ and $y$ are nonzero real numbers such that $\frac{7}{x} + \frac{8}{y} = 91$ and $\frac{6}{x} + \frac{10}{y} = 89$, what is the value of $x + y$? [b]p11.[/b] Hilda and Marianne play a game with a shued deck of $10$ cards, numbered from $1$ to $10$. Hilda draws five cards, and Marianne picks up the five remaining cards. Hilda observes that she does not have any pair of consecutive cards - that is, no two cards have numbers that differ by exactly $1$. Additionally, the sum of the numbers on Hilda's cards is $1$ less than the sum of the numbers on Marianne's cards. Marianne has exactly one pair of consecutive cards - what is the sum of this pair? [b]p12.[/b] Regular hexagon $AUSTIN$ has side length $2$. Let $M$ be the midpoint of line segment $\overline{ST}$. What is the area of pentagon $MINUS$? [b]p13.[/b] At a collector's store, plushes are either small or large and cost a positive integer number of dollars. All small plushes cost the same price, and all large plushes cost the same price. Two small plushes cost exactly one dollar less than a large plush. During a shopping trip, Isaac buys some plushes from the store for 59 dollars. What is the smallest number of dollars that the small plush could not possibly cost? [b]p14.[/b] Four fair six-sided dice are rolled. What is the probability that the median of the four outcomes is $5$? [b]p15.[/b] Suppose $x_1, x_2,..., x_{2022}$ is a sequence of real numbers such that: $x_1 + x_2 = 1$ $x_2 + x_3 = 2$ $...$ $x_{2021} + x_{2022} = 2021$ If $x_1 + x_{499} + x_{999} + x_{1501} = 222$, then what is the value of $x_{2022}$? [b]p16.[/b] A cone has radius $3$ and height $4$. An infinite number of spheres are placed in the cone in the following way: sphere $C_0$ is placed inside the cone such that it is tangent to the base of the cone and to the curved surface of the cone at more than one point, and for $i \ge 1$, sphere $C_i$ is placed such that it is externally tangent to sphere $C_{i-1}$ and internally tangent to more than one point of the curved surface of the cone. If $V_i$ is the volume of sphere $C_i$, compute $V_0 + V_1 + V_2 + ... $ . [img]https://cdn.artofproblemsolving.com/attachments/b/4/b43e40bb0a5974dd9d656691c14b4ae268b5b5.png[/img] [b]p17.[/b] Call an ordered pair, $(x, y)$, relatable if $x$ and $y$ are positive integers where $y$ divides $3600$, $x$ divides $y$ and $\frac{y}{x}$ is a prime number. For every relatable ordered pair, Leanne wrote down the positive difference of the two terms of the pair. What is the sum of the numbers she wrote down? [b]p18.[/b] Let $r, s$, and $t$ be the three roots of $P(x) = x^3 - 9x - 9$. Compute the value of $(r^3 + r^2 - 10r - 8)(s^3 + s^2 - 10s - 8)(t^3 + t^2 - 10t - 8)$. [b]p19.[/b] Compute the number of ways to color the digits $0, 1, 2, 3, 4, 5, 6, 7, 8$ and $9$ red, blue, or green such that: (a) every prime integer has at least one digit that is not blue, and (b) every composite integer has at least one digit that is not green. Note that $0$ is not composite. For example, since $12$ is composite, either the digit $1$, the digit $2$, or both must be not green. [b]p20.[/b] Pentagon $ABCDE$ has $AB = DE = 4$ and $BC = CD = 9$ with $\angle ABC = \angle CDE = 90^o$, and there exists a circle tangent to all five sides of the pentagon. What is the length of segment $\overline{AE}$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In duck language, only letters $q$, $a$, and $k$ are used. There is no word with two consonants after each other, because the ducks cannot pronounce them. However, all other four-letter words are meaningful in duck language. How many such words are there? In duck language, too, the letter $a$ is a vowel, while $q$ and $k$ are consonants.

Compute the expected sum of elements in a subset of $\{1, 2, 3, . . . , 2020\}$ (including the empty set) chosen uniformly at random.

A grasshopper is jumping about in a grid. From the point with coordinates $(a, b)$ it can jump to either $(a + 1, b),(a + 2, b),(a + 1, b + 1),(a, b + 2)$ or $(a, b + 1)$. In how many ways can it reach the line $x + y = 2014?$ Where the grasshopper starts in $(0, 0)$.

Let $G$ be a complete directed graph with $2024$ vertices and let $k \leq 10^5$ be a positive integer. Angel and Boris play the following game: Angel colors $k$ of the edges in red and puts a pawn in one of the vertices. After that in each move, first Angel moves the pawn to a neighboring vertex and then Boris has to flip one of the non-colored edges. Boris wins if at some point Angel can't make a move. Find, depending on $G$ and $k$, whether or not Boris has a winning strategy.

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

There are $n>1000$ people at a round table. Some of them are knights who always tell the truth, and the rest are liars who always tell lies. Each of those sitting said the phrase: “among the $20$ people sitting clockwise from where I sit there are as many knights as among the $20$ people seated counterclockwise from where I sit”. For what $n$ could this happen?

There is graph $ G_0$ on vertices $ A_1, A_2, \ldots, A_n$. Graph $ G_{n \plus{} 1}$ on vertices $ A_1, A_2, \ldots, A_n$ is constructed by the rule: $ A_i$ and $ A_j$ are joined only if in graph $ G_n$ there is a vertices $ A_k\neq A_i, A_j$ such that $ A_k$ is joined with both $ A_i$ and $ A_j$. Prove that the sequence $ \{G_n\}_{n\in\mathbb{N}}$ is periodic after some term with period $ T \le 2^n$.

[b]p1.[/b] How many lines of symmetry does a square have? [b]p2.[/b] Compute$ 1/2 + 1/6 + 1/12 + 1/4$. [b]p3.[/b] What is the maximum possible area of a rectangle with integer side lengths and perimeter $8$? [b]p4.[/b] Given that $1$ printer weighs $400000$ pennies, and $80$ pennies weighs $2$ books, what is the weight of a printer expressed in books? [b]p5.[/b] Given that two sides of a triangle are $28$ and $3$ and all three sides are integers, what is the sum of the possible lengths of the remaining side? [b]p6.[/b] What is half the sum of all positive integers between $1$ and $15$, inclusive, that have an even number of positive divisors? [b]p7.[/b] Austin the Snowman has a very big brain. His head has radius $3$, and the volume of his torso is one third of his head, and the volume of his legs combined is one third of his torso. If Austin's total volume is $a\pi$ where $a$ is an integer, what is $a$? [b]p8.[/b] Neethine the Kiwi says that she is the eye of the tiger, a fighter, and that everyone is gonna hear her roar. She is standing at point $(3, 3)$. Neeton the Cat is standing at $(11,18)$, the farthest he can stand from Neethine such that he can still hear her roar. Let the total area of the region that Neeton can stand in where he can hear Neethine's roar be $a\pi$ where $a$ is an integer. What is $a$? [b]p9.[/b] Consider $2018$ identical kiwis. These are to be divided between $5$ people, such that the first person gets $a_1$ kiwis, the second gets $a_2$ kiwis, and so forth, with $a_1 \le a_2 \le a_3 \le a_4 \le a_5$. How many tuples $(a_1, a_2, a_3, a_4, a_5)$ can be chosen such that they form an arithmetic sequence? [b]p10.[/b] On the standard $12$ hour clock, each number from $1$ to $12$ is replaced by the sum of its divisors. On this new clock, what is the number of degrees in the measure of the non-reflex angle between the hands of the clock at the time when the hour hand is between $7$ and $6$ while the minute hand is pointing at $15$? [b]p11.[/b] In equiangular hexagon $ABCDEF$, $AB = 7$, $BC = 3$, $CD = 8$, and $DE = 5$. The area of the hexagon is in the form $\frac{a\sqrt{b}}{c}$ with $b$ square free and $a$ and $c$ relatively prime. Find $a+b+c$ where $a, b,$ and $c$ are integers. [b]p12.[/b] Let $\frac{p}{q} = \frac15 + \frac{2}{5^2} + \frac{3}{5^3} + ...$ . Find $p + q$, where $p$ and $q$ are relatively prime positive integers. [b]p13.[/b] Two circles $F$ and $G$ with radius $10$ and $4$ respectively are externally tangent. A square $ABMC$ is inscribed in circle $F$ and equilateral triangle $MOP$ is inscribed in circle $G$ (they share vertex $M$). If the area of pentagon $ABOPC$ is equal to $a + b\sqrt{c}$, where $a$, $b$, $c$ are integers $c$ is square free, then find $a + b + c$. [b]p14.[/b] Consider the polynomial $P(x) = x^3 + 3x^2 + ax + 8$. Find the sum of all integer $a$ such that the sum of the squares of the roots of $P(x)$ divides the sum of the coecients of $P(x)$. [b]p15.[/b] Nithin and Antonio play a number game. At the beginning of the game, Nithin picks a prime $p$ that is less than $100$. Antonio then tries to find an integer $n$ such that $n^6 + 2n^5 + 2n^4 + n^3 + (n^2 + n + 1)^2$ is a multiple of $p$. If Antonio can find such a number n, then he wins, otherwise, he loses. Nithin doesn't know what he is doing, and he always picks his prime randomly while Antonio always plays optimally. The probability of Antonio winning is $a/b$ where $a$ and $b$ are relatively prime positive integers. Find$a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

There are villager $0$, villager $1$, . . . , villager $2015$ i.e. $2016$ people in the village. You are villager $0$. Each villager is either honest or liar. You don’t know each villager is honest or liar, but you know you are honest and the number of liar is equal or smaller than integer $T$. The villagers became to write one letter without fail from one day. For integers $1 \le n \le 2015$, there are set integers $1 < k_n < 2015$. The letter villager $i$ wrote in day $n$ of the morning is delivered to villager $i + k_n$ if villager $i$ is honest, or villager $i - k_n$ if villager $i$ is liar in day $n$ of the evening. If $i - j$ is divisible by $2016$, villager $i$ and $j$ point same villager. Villagers don’t know $k_n$, but sender is told when letters are received. Villager can write anything on a letter, and each villager receives letters from any villagers a sufficient number of times after enough time. i.e. there are $n$ satisfying $k = k_n$ infinitely for each integer $1 \le k \le 2015$. You want to know the honest persons of this village. You can gather all villagers just once and instruct in one day of noon. The honest person obeys your instruction but the liar person not always obeys and he or she writes on a letter anything possible. One day from your instruction for a while, you could determine all honest persons of this village. Find the maximum value of $T$ such that it is possible to do this if you instruct appropriate regardless of the villagers who are honest or liar.