[u]Round 1[/u] [b]p1.[/b] When Shiqiao sells a bale of kale, he makes $x$ dollars, where $$x =\frac{1 + 2 + 3 + 4 + 5 + 6 + 7 + 8}{3 + 4 + 5 + 6}.$$ Find $x$. [b]p2.[/b] The fraction of Shiqiao’s kale that has gone rotten is equal to $$\sqrt{ \frac{100^2}{99^2} -\frac{100}{99}}.$$ Find the fraction of Shiqiao’s kale that has gone rotten. [b]p3.[/b] Shiqiao is growing kale. Each day the number of kale plants doubles, but $4$ of his kale plants die afterwards. He starts with $6$ kale plants. Find the number of kale plants Shiqiao has after five days. [u]Round 2[/u] [b]p4.[/b] Today the high is $68$ degrees Fahrenheit. If $C$ is the temperature in Celsius, the temperature in Fahrenheit is equal to $1.8C + 32$. Find the high today in Celsius. [b]p5.[/b] The internal angles in Evan’s triangle are all at most $68$ degrees. Find the minimum number of degrees an angle of Evan’s triangle could measure. [b]p6.[/b] Evan’s room is at $68$ degrees Fahrenheit. His thermostat has two buttons, one to increase the temperature by one degree, and one to decrease the temperature by one degree. Find the number of combinations of $10$ button presses Evan can make so that the temperature of his room never drops below $67$ degrees or rises above $69$ degrees. [u]Round 3[/u] [b]p7.[/b] In a digital version of the SAT, there are four spaces provided for either a digit $(0-9)$, a fraction sign $(\/)$, or a decimal point $(.)$. The answer must be in simplest form and at most one space can be a non-digit character. Determine the largest fraction which, when expressed in its simplest form, fits within this space, but whose exact decimal representation does not. [b]p8.[/b] Rounding Rox picks a real number $x$. When she rounds x to the nearest hundred, its value increases by $2.71828$. If she had instead rounded $x$ to the nearest hundredth, its value would have decreased by $y$. Find $y$. [b]p9.[/b] Let $a$ and $b$ be real numbers satisfying the system of equations $$\begin{cases} a + \lfloor b \rfloor = 2.14 \\ \lfloor a \rfloor + b = 2.72 \end{cases}$$ Determine $a + b$. [u]Round 4[/u] [b]p10.[/b] Carol and Lily are playing a game with two unfair coins, both of which have a $1/4$ chance of landing on heads. They flip both coins. If they both land on heads, Lily loses the game, and if they both land on tails, Carol loses the game. If they land on different sides, Carol and Lily flip the coins again. They repeat this until someone loses the game. Find the probability that Lily loses the game. [b]p11.[/b] Dongchen is carving a circular coin design. He carves a regular pentagon of side length $1$ such that all five vertices of the pentagon are on the rim of the coin. He then carves a circle inside the pentagon so that the circle is tangent to all five sides of the pentagon. Find the area of the region between the smaller circle and the rim of the coin. [b]p12.[/b] Anthony flips a fair coin six times. Find the probability that at some point he flips $2$ heads in a row. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3248731p29808147]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Considering all numbers of the form $n = \lfloor \frac{k^3}{2012} \rfloor$, where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$, and $k$ ranges from $1$ to $2012$, how many of these $n$’s are distinct?

Let $X = \{-5,-4,-3,-2,-1,0,1,2,3,4,5\}$ and $S = \{(a,b)\in X\times X:x^2+ax+b \text{ and }x^3+bx+a \text{ have at least a common real zero .}\}$ How many elements are there in $S$?

$a,b,c,x,y,z$ are positive real numbers and $bz+cy=a$, $az+cx=b$, $ay+bx=c$. Find the least value of following function $f(x,y,z)=\frac{x^2}{1+x}+\frac{y^2}{1+y}+\frac{z^2}{1+z}$

[b]8.1[/b] In the parallelogram $ABCD$ , the diagonal $AC$ is greater than the diagonal $BD$. The point $M$ on the diagonal $AC$ is such that around the quadrilateral $BCDM$ one can circumscribe a circle. Prove that $BD$ is the common tangent of the circles circumscribed around the triangles $ABM$ and $ADM$. [img]https://cdn.artofproblemsolving.com/attachments/b/3/9f77ff1f2198c201e5c270ec5b091a9da4d0bc.png[/img] [b]8.2 [/b] $A$ is an odd integer, $x$ and $y$ are roots of equation $t^2+At-1=0$. Prove that $x^4 + y^4$ and $x^5+ y^5$ are coprime integer numbers. [b]8.3[/b] A regular triangle is reflected symmetrically relative to one of its sides. The new triangle is again reflected symmetrically about one of its sides. This is repeated several times. It turned out that the resulting triangle coincides with the original one. Prove that an even number of reflections were made. [b]8.4 /7.6[/b] Several circles are arbitrarily placed in a circle of radius $3$, the sum of their radii is $25$. Prove that there is a straight line that intersects at least $9$ of these circles. [b]8.5 [/b] All two-digit numbers that do not end in zero are written one after another so that each subsequent number begins with that the same digit with which the previous number ends. Prove that you can do this and find the sum of the largest and smallest of all multi-digit numbers that can be obtained in this way. [url=https://artofproblemsolving.com/community/c6h3390996p32049528]8,6*[/url] (asterisk problems in separate posts) PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988084_1968_leningrad_math_olympiad]here[/url].

Let $ p$ be a prime and let $ d \in \left\{0,\ 1,\ \ldots,\ p\right\}$. Prove that \[ \sum_{k \equal{} 0}^{p \minus{} 1}{\binom{2k}{k \plus{} d}}\equiv r \pmod{p}, \]where $ r \equiv p\minus{}d \pmod 3$, $ r\in\{\minus{}1,0,1\}$.

Find all real numbers $a$ for which there exists a function $f$ defined on the set of all real numbers which takes as its values all real numbers exactly once and satisfies the equality $$ f(f(x))=x^2f(x)+ax^2 $$ for all real $x$.

Find all functions $f$ from the set of real numbers into the set of real numbers which satisfy for all $x$, $y$ the identity \[ f\left(xf(x+y)\right) = f\left(yf(x)\right) +x^2\] [i]Proposed by Japan[/i]

Find all poltnomials $ P(x)$ with real coefficients satisfying: For all $ a>1995$, the number of real roots of $ P(x)\equal{}a$ (incuding multiplicity of each root) is greater than 1995, and every roots are greater than 1995.

Find all polynomials $ P\in\mathbb{R}[x]$ such that for all $ r\in\mathbb{Q}$,there exist $ d\in\mathbb{Q}$ such that $ P(d)\equal{}r$

[b]p1.[/b] We say that integers $a$ and $b$ are [i]friends [/i] if their product is a perfect square. Prove that if $a$ is a friend of $b$, then $a$ is a friend of $gcd (a, b)$. [b]p2.[/b] On the island of knights and liars, a traveler visited his friend, a knight, and saw him sitting at a round table with five guests. "I wonder how many knights are among you?" he asked. " Ask everyone a question and find out yourself" advised him one of the guests. "Okay. Tell me one: Who are your neighbors?" asked the traveler. This question was answered the same way by all the guests. "This information is not enough!" said the traveler. "But today is my birthday, do not forget it!" said one of the guests. "Yes, today is his birthday!" said his neighbor. Now the traveler was able to find out how many knights were at the table. Indeed, how many of them were there if [i]knights always tell the truth and liars always lie[/i]? [b]p3.[/b] A rope is folded in half, then in half again, then in half yet again. Then all the layers of the rope were cut in the same place. What is the length of the rope if you know that one of the pieces obtained has length of $9$ meters and another has length $4$ meters? [b]p4.[/b] The floor plan of the palace of the Shah is a square of dimensions $6 \times 6$, divided into rooms of dimensions $1 \times 1$. In the middle of each wall between rooms is a door. The Shah orders his architect to eliminate some of the walls so that all rooms have dimensions $2 \times 1$, no new doors are created, and a path between any two rooms has no more than $N$ doors. What is the smallest value of $N$ such that the order could be executed? [b]p5.[/b] There are $10$ consecutive positive integers written on a blackboard. One number is erased. The sum of remaining nine integers is $2011$. Which number was erased? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ be a finite set, and let $\mathcal{A}$ be the set of all functions from $S$ to $S$. Let $f$ be an element of $\mathcal{A}$, and let $T=f(S)$ be the image of $S$ under $f$. Suppose that $f\circ g\circ f\ne g\circ f\circ g$ for every $g$ in $\mathcal{A}$ with $g\ne f$. Show that $f(T)=T$.

A sequence of natural numbers $a_1,a_2,...$ satisfies $a_1 = 1, a_{n+2} = 2a_{n+1} - a_n +2$ for $n \in N$. Prove that for every natural $n$ there exists a natural $m$ such that $a_na_{n+1} = a_m$.

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ with the property that for every real numbers $x$ and $y$ it holds that $$f(x+yf(x+y))=f(x)+f(xy)+y^2.$$

The paper is written on consecutive integers $1$ through $n$. Then are deleted all numbers ending in $4$ and $9$ and the rest alternating between $-$ and $+$. Finally, an opening parenthesis is added after each character and at the end of the expression the corresponding number of parentheses: $1 - (2 + 3 - (5 + 6 - (7 + 8 - (10 +...))))$. Find all numbers $n$ such that the value of this expression is $13$.

Given a real number $t\ge3$, suppose a polynomial $f\in\mathbb R[x]$ satisfies $$\left|f(k)-t^k\right|<1,\enspace\forall k=0,1,\ldots,n.$$Prove that $\deg f\ge n$.

[u]Set 6[/u] [b]p16.[/b] Let $x$ and $y$ be non-negative integers. We say point $(x, y)$ is square if $x^2 + y$ is a perfect square. Find the sum of the coordinates of all distinct square points which also satisfy $x^2 + y \le 64$. [b]p17.[/b] Two integers $a$ and $b$ are randomly chosen from the set $\{1, 2, 13, 17, 19, 87, 115, 121\}$, with $a > b$. What is the expected value of the number of factors of $ab$? [b]p18.[/b] Marnie the Magical Cello is jumping on nonnegative integers on number line. She starts at $0$ and jumps following two specific rules. For each jump she can either jump forward by $1$ or jump to the next multiple of $4$ (the next multiple must be strictly greater than the number she is currently on). How many ways are there for her to jump to $2022$? (Two ways are considered distinct only if the sequence of numbers she lands on is different.) PS. You should use hide for answers.

[u]Round 1[/u] [b]p1.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p2.[/b] A positive number is placed on each of the $10$ circles in this picture. It turns out that for each of the nine little equilateral triangles, the number on one of its corners is the sum of the numbers on the other two corners. Is it possible that all $10$ numbers are different? [img]https://cdn.artofproblemsolving.com/attachments/b/f/c501362211d1c2a577e718d2b1ed1f1eb77af1.png[/img] [b]p3.[/b] Pablo and Nina take turns entering integers into the cells of a $3 \times 3$ table. Pablo goes first. The person who fills the last empty cell in a row must make the numbers in that row add to $0$. Can Nina ensure at least two of the columns have a negative sum, no matter what Pablo does? [b]p4. [/b]All possible simplified fractions greater than $0$ and less than $1$ with denominators less than or equal to $100$ are written in a row with a space before each number (including the first). Zeke and Qing play a game, taking turns choosing a blank space and writing a “$+$” or “$-$” sign in it. Zeke goes first. After all the spaces have been filled, Zeke wins if the value of the resulting expression is an integer. Can Zeke win no matter what Qing does? [img]https://cdn.artofproblemsolving.com/attachments/3/6/15484835686fbc2aa092e8afc6f11cd1d1fb88.png[/img] [b]p5.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/0/c/d827cf26c8eaabfd5b0deb92612a6e6ebffb47.png[/img] [u]Round 2[/u] [b]p6.[/b] Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$. [b]p7.[/b] Given a list of three numbers, a zap consists of picking two of the numbers and decreasing each of them by their average. For example, if the list is $(5, 7, 10)$ and you zap $5$ and $10$, whose average is $7.5$, the new list is $(-2.5, 7, 2.5)$. Is it possible to start with the list $(3, 1, 4)$ and, through some sequence of zaps, end with a list in which the sum of the three numbers is $0$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve the system of equations $$\begin{cases} x+y+z+t=6 \\ \sqrt{1-x^2}+\sqrt{4-y^2}+\sqrt{9-z^2}+\sqrt{16-t^2}=8 \end{cases}$$

We have an infinite sequence of integers $\{x_n\}$, such that $x_1 = 1$, and, for all $n \ge 1$, it holds that $x_n < x_{n+1} \le 2n$. Prove that there are two terms of the sequence,$ x_r$ and $x_s$, such that $x_r - x_s = 2018$.

Prove the existence of a unique sequence $\{u_n\} \ (n = 0, 1, 2 \ldots )$ of positive integers such that \[u_n^2 = \sum_{r=0}^n \binom{n+r}{r} u_{n-r} \qquad \text{for all } n \geq 0\]

Show that there is precisely one sequence $ a_1,a_2,...$ of integers which satisfies $ a_1\equal{}1, a_2>1,$ and $ a_{n\plus{}1}^3\plus{}1\equal{}a_n a_{n\plus{}2}$ for $ n \ge 1$.

Let $n$ be a positive integer. Consider sequences $a_0, a_1, ..., a_k$ and $b_0, b_1,,..,b_k$ such that $a_0 = b_0 = 1$ and $a_k = b_k = n$ and such that for all $i$ such that $1 \le i \le k $, we have that $(a_i, b_i)$ is either equal to $(1 + a_{i-1}, b_{i-1})$ or $(a_{i-1}; 1 + b_{i-1})$. Consider for $1 \le i \le k$ the number $c_i = \begin{cases} a_i \,\,\, if \,\,\, a_i = a_{i-1} \\ b_i \,\,\, if \,\,\, b_i = b_{i-1}\end{cases}$ Show that $c_1 + c_2 + ... + c_k = n^2 - 1$.

Let $q$ be a real number. Gugu has a napkin with ten distinct real numbers written on it, and he writes the following three lines of real numbers on the blackboard: [list] [*]In the first line, Gugu writes down every number of the form $a-b$, where $a$ and $b$ are two (not necessarily distinct) numbers on his napkin. [*]In the second line, Gugu writes down every number of the form $qab$, where $a$ and $b$ are two (not necessarily distinct) numbers from the first line. [*]In the third line, Gugu writes down every number of the form $a^2+b^2-c^2-d^2$, where $a, b, c, d$ are four (not necessarily distinct) numbers from the first line. [/list] Determine all values of $q$ such that, regardless of the numbers on Gugu's napkin, every number in the second line is also a number in the third line.

[b]p1.[/b] If $a \diamond b = ab - a + b$, find $(3 \diamond 4) \diamond 5$ [b]p2.[/b] If $5$ chickens lay $5$ eggs in $5$ days, how many chickens are needed to lay $10$ eggs in $10$ days? [b]p3.[/b] As Alissa left her house to go to work one hour away, she noticed that her odometer read $16261$ miles. This number is a "special" number for Alissa because it is a palindrome and it contains exactly $1$ prime digit. When she got home that evening, it had changed to the next greatest "special" number. What was Alissa's average speed, in miles per hour, during her two hour trip? [b]p4.[/b] How many $1$ in by $3$ in by $8$ in blocks can be placed in a $4$ in by $4$ in by $9$ in box? [b]p5.[/b] Apple loves eating bananas, but she prefers unripe ones. There are $12$ bananas in each bunch sold. Given any bunch, if there is a $\frac13$ probability that there are $4$ ripe bananas, a $\frac16$ probability that there are $6$ ripe bananas, and a $\frac12$ probability that there are $10$ ripe bananas, what is the expected number of unripe bananas in $12$ bunches of bananas? [b]p6.[/b] The sum of the digits of a $3$-digit number $n$ is equal to the same number without the hundreds digit. What is the tens digit of $n$? [b]p7.[/b] How many ordered pairs of positive integers $(a, b)$ satisfy $a \le 20$, $b \le 20$, $ab > 15$? [b]p8.[/b] Let $z(n)$ represent the number of trailing zeroes of $n!$. What is $z(z(6!))?$ (Note: $n! = n\cdot (n-1) \cdot\cdot\cdot 2 \cdot 1$) [b]p9.[/b] On the Cartesian plane, points $A = (-1, 3)$, $B = (1, 8)$, and $C = (0, 10)$ are marked. $\vartriangle ABC$ is reflected over the line $y = 2x + 3$ to obtain $\vartriangle A'B'C'$. The sum of the $x$-coordinates of the vertices of $\vartriangle A'B'C'$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Compute $a + b$. [b]p10.[/b] How many ways can Bill pick three distinct points from the figure so that the points form a non-degenerate triangle? [img]https://cdn.artofproblemsolving.com/attachments/6/a/8b06f70d474a071b75556823f70a2535317944.png[/img] [b]p11.[/b] Say piece $A$ is attacking piece $B$ if the piece $B$ is on a square that piece $A$ can move to. How many ways are there to place a king and a rook on an $8\times 8$ chessboard such that the rook isn't attacking the king, and the king isn't attacking the rook? Consider rotations of the board to be indistinguishable. (Note: rooks move horizontally or vertically by any number of squares, while kings move $1$ square adjacent horizontally, vertically, or diagonally). [b]p12.[/b] Let the remainder when $P(x) = x^{2020} - x^{2017} - 1$ is divided by $S(x) = x^3 - 7$ be the polynomial $R(x) = ax^2 + bx + c$ for integers $a$, $b$, $c$. Find the remainder when $R(1)$ is divided by $1000$. [b]p13.[/b] Let $S(x) = \left \lfloor \frac{2020}{x} \right\rfloor + \left \lfloor \frac{2020}{x + 1} \right\rfloor$. Find the number of distinct values $S(x)$ achieves for integers $x$ in the interval $[1, 2020]$. [b]p14.[/b] Triangle $\vartriangle ABC$ is inscribed in a circle with center $O$ and has sides $AB = 24$, $BC = 25$, $CA = 26$. Let $M$ be the midpoint of $\overline{AB}$. Points $K$ and $L$ are chosen on sides $\overline{BC}$ and $\overline{CA}$, respectively such that $BK < KC$ and $CL < LA$. Given that $OM = OL = OK$, the area of triangle $\vartriangle MLK$ can be expressed as $\frac{a\sqrt{b}}{c}$ where $a, b, c$ are positive integers, $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p15.[/b] Euler's totient function, $\phi (n)$, is defined as the number of positive integers less than $n$ that are relatively prime to $n$. Let $S(n)$ be the set of composite divisors of $n$. Evaluate $$\sum^{50}_{k=1}\left( k - \sum_{d\in S(k)} \phi (d) \right)$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].