Let $n$ be some positive integer. Find all functions $f:{{R}^{+}}\to R$ (i.e., functions defined by the set of all positive real numbers with real values) for which equality holds $f\left( {{x}^{n+1}}+ {{y}^{n+1}} \right)={{x}^{n}}f\left( x \right)+{{y}^{n}}f\left( y \right)$ for any positive real numbers $x, y$

[b]p1.[/b] $17.5\%$ of what number is $4.5\%$ of $28000$? [b]p2.[/b] Let $x$ and $y$ be two randomly selected real numbers between $-4$ and $4$. The probability that $(x - 1)(y - 1)$ is positive can be written in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p3.[/b] In the $xy$-plane, Mallen is at $(-12, 7)$ and Anthony is at $(3,-14)$. Mallen runs in a straight line towards Anthony, and stops when she has traveled $\frac23$ of the distance to Anthony. What is the sum of the $x$ and $y$ coordinates of the point that Mallen stops at? [b]p4.[/b] What are the last two digits of the sum of the first $2021$ positive integers? [b]p5.[/b] A bag has $19$ blue and $11$ red balls. Druv draws balls from the bag one at a time, without replacement. The probability that the $8$th ball he draws is red can be written in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p6.[/b] How many terms are in the arithmetic sequence $3$, $11$, $...$, $779$? [b]p7.[/b] Ochama has $21$ socks and $4$ drawers. She puts all of the socks into drawers randomly, making sure there is at least $1$ sock in each drawer. If $x$ is the maximum number of socks in a single drawer, what is the difference between the maximum and minimum possible values of $x$? [b]p8.[/b] What is the least positive integer $n$ such that $\sqrt{n + 1} - \sqrt{n} < \frac{1}{20}$? [b]p9.[/b] Triangle $\vartriangle ABC$ is an obtuse triangle such that $\angle ABC > 90^o$, $AB = 10$, $BC = 9$, and the area of $\vartriangle ABC$ is $36$. Compute the length of $AC$. [img]https://cdn.artofproblemsolving.com/attachments/a/c/b648d0d60c186d01493fcb4e21b5260c46606e.png[/img] [b]p10.[/b] If $x + y - xy = 4$, and $x$ and $y$ are integers, compute the sum of all possible values of$ x + y$. [b]p11.[/b] What is the largest number of circles of radius $1$ that can be drawn inside a circle of radius $2$ such that no two circles of radius $1$ overlap? [b]p12.[/b] $22.5\%$ of a positive integer $N$ is a positive integer ending in $7$. Compute the smallest possible value of $N$. [b]p13.[/b] Alice and Bob are comparing their ages. Alice recognizes that in five years, Bob's age will be twice her age. She chuckles, recalling that five years ago, Bob's age was four times her age. How old will Alice be in five years? [b]p14.[/b] Say there is $1$ rabbit on day $1$. After each day, the rabbit population doubles, and then a rabbit dies. How many rabbits are there on day $5$? [b]15.[/b] Ajit draws a picture of a regular $63$-sided polygon, a regular $91$-sided polygon, and a regular $105$-sided polygon. What is the maximum number of lines of symmetry Ajit's picture can have? [b]p16.[/b] Grace, a problem-writer, writes $9$ out of $15$ questions on a test. A tester randomly selects $3$ of the $15$ questions, without replacement, to solve. The probability that all $3$ of the questions were written by Grace can be written in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p17.[/b] Compute the number of anagrams of the letters in $BMMTBMMT$ with no two $M$'s adjacent. [b]p18.[/b] From a $15$ inch by $15$ inch square piece of paper, Ava cuts out a heart such that the heart is a square with two semicircles attached, and the arcs of the semicircles are tangent to the edges of the piece of paper, as shown in the below diagram. The area (in square inches) of the remaining pieces of paper, after the heart is cut out and removed, can be written in the form $a-b\pi$, where $a$ and $b$ are positive integers. Compute $a + b$. [b]p19.[/b] Bayus has $2021$ marbles in a bag. He wants to place them one by one into $9$ different buckets numbered $1$ through $9$. He starts by putting the first marble in bucket $1$, the second marble in bucket $2$, the third marble in bucket $3$, etc. After placing a marble in bucket $9$, he starts back from bucket $1$ again and repeats the process. In which bucket will Bayus place the last marble in the bag? [img]https://cdn.artofproblemsolving.com/attachments/9/8/4c6b1bd07367101233385b3ffebc5e0abba596.png[/img] [b]p20.[/b] What is the remainder when $1^5 + 2^5 + 3^5 +...+ 2021^5$ is divided by $5$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all real numbers $a$ for which there exists a function $f: R \to R$ asuch that $x + f(y) =a(y + f(x))$ for all real numbers $x,y\in R$. I.Voronovich

There are 6 distinct values of $x$ strictly between $0$ and $\frac{\pi}{2}$ that satisfy the equation \[ \tan(15 x) = 15 \tan(x) . \] Call these 6 values $r_1$, $r_2$, $r_3$, $r_4$, $r_5$, and $r_6$. What is the value of the sum \[ \frac{1}{\tan^2 r_1} + \frac{1}{\tan^2 r_2} + \frac{1}{\tan^2 r_3} + \frac{1}{\tan^2 r_4} + \frac{1}{\tan^2 r_5} + \frac{1}{\tan^2 r_6} \, ? \]

For any positive $a$ and $b$, find positive solutions of the system $$\begin{cases} \dfrac{a^2}{x^2}- \dfrac{b^2}{y^2}=8(y^4-x^4) \\ ax-by=x^4-y^4 \end{cases}$$

Let $a,b,c$ be positive real numbers. Prove that $\frac{a^3+3b^3}{5a+b}+\frac{b^3+3c^3}{5b+c}+\frac{c^3+3a^3}{5c+a} \geq \frac{2}{3}(a^2+b^2+c^2)$.

Determine all functions $f : R \to R$ satisfying $f (f(x)f(y) + f(y)f(z) + f(z)f(x))= f(x) + f(y) + f(z)$ for all real numbers $x, y, z$.

Let \(\mathbb R_{>0}\) denote the set of positive real numbers. Find all functions \(f:\mathbb R_{>0}\to\mathbb R_{>0}\) such that for all positive real numbers \(x\) and \(y\), \[f(xy+1)=f(x)f\left(\frac1x+f\left(\frac1y\right)\right).\] [i]Proposed by Luke Robitaille[/i]

For a given positive integer $n$, let $A_n$ be the set of all points $(x,y)$ in the coordinate plane with $x,y \in \{0,1,...,n\}$. A point $(i, j)$ is called internal if $0 < i, j < n$. A real function $f$ , defined on $A_n$, is called [i]good [/i] if it has the following property: For every internal point $x$, the value of $f(x)$ is the arithmetic mean of its values on the four neighboring points (i.e. the points at the distance $1$ from $x$). Prove that if $f$ and $g$ are good functions that coincide at the non-internal points of $A_n$, then $f \equiv g$.

Let $f$ be the function defined by $f(x) = -2 \sin(\pi x)$. How many values of $x$ such that $-2 \le x \le 2$ satisfy the equation $f(f(f(x))) = f(x)$?

Find all functions $f:\mathbb{R}\longrightarrow\mathbb{R}$ such that $f(x+y)+xy=f(x)f(y)$ for all reals $x, y$

Let $f: \mathbb R \to \mathbb R,g: \mathbb R \to \mathbb R$ and $\varphi: \mathbb R \to \mathbb R$ be three ascendant functions such that \[f(x) \leq g(x) \leq \varphi(x) \qquad \forall x \in \mathbb R.\] Prove that \[f(f(x)) \leq g(g(x)) \leq \varphi(\varphi(x)) \qquad \forall x \in \mathbb R.\] [i]Note. The function is $k(x)$ ascendant if for every $ x,y \in D_k, x \leq {y}$ we have $g(x)\leq{g(y)}$.[/i]

Find all ordered pairs $(x,y)$ of real numbers that satisfy the following system of equations: $$\begin{cases} y(x+y)^2=2\\ 8y(x^3-y^3) = 13. \end{cases}$$

Let $f_1(x)=\sqrt{1-x}$, and for integers $n \ge 2$, let $f_n(x)=f_{n-1}(\sqrt{n^2-x})$. If $N$ is the largest value of $n$ for which the domain of $f_n$ is nonempty, the domain of $f_N$ is ${c}$. What is $N+c$? $ \textbf{(A)}\ -226 \qquad \textbf{(B)}\ -144 \qquad \textbf{(C)}\ -20 \qquad \textbf{(D)}\ 20 \qquad \textbf{(E)}\ 144$

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

A walker and a jogger travel along the same straight line in the same direction. The walker walks at one meter per second, while the jogger runs at two meters per second. The jogger starts one meter in front of the walker. A dog starts with the walker, and then runs back and forth between the walker and the jogger with constant speed of three meters per second. Let $f(n)$ meters denote the total distance travelled by the dog when it has returned to the walker for the nth time (so $f(0)=0$). Find a formula for $f(n)$.

Given three numbers $x, y, z$, and set $x_1 = |x - y|, y_1 = | y -z|, z_1 = |z- x|$. From $x_1, y_1, z_1$, form in the same fashion the numbers $x_2, y_2, z_2$, and so on. It is known that $x_n = x, y_n = y, z_n = z$ for some $n$. Find all possible values of $(x, y, z)$.

Let $p$ be a prime number. Prove that the determinant of the matrix \[ \begin{bmatrix}x & y & z\\ x^p & y^p & z^p \\ x^{p^2} & y^{p^2} & z^{p^2} \end{bmatrix} \] is congruent modulo $p$ to a product of polynomials of the form $ax+by+cz$, where $a$, $b$, and $c$ are integers. (We say two integer polynomials are congruent modulo $p$ if corresponding coefficients are congruent modulo $p$.)

Let $a, b, c, d \in [0, 1]$. Prove that $$\frac{a}{1 + b}+\frac{b}{1 + c}+\frac{c}{1 + d}+\frac{d}{1 + a}+ abcd \le 3.$$

Determine all integer solutions (a,b,c) with $c\leq 94$ for which: $(a+\sqrt c)^2+(b+\sqrt c)^2 = 60 + 20\sqrt c$

A sequence $a_1,a_2,\dots$ satisfy $$ \sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10}, $$ for every $n\in\mathbb{N}$. Let $c$ be a positive integer. Prove that, for every positive integer $n$, $$ \frac{c^{a_n}-c^{a_{n-1}}}{n} $$ is an integer.

The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for every integer $n$. Let $k$ be a fixed integer. A sequence $(a_n)$ of integers is said to be $\textit{phirme}$ if $a_n + a_{n+1} = F_{n+k}$ for all $n \geq 1$. Find all $\textit{phirme}$ sequences in terms of $n$ and $k$.

Find all pairs of positive integers $(a, b)$ such that $$11ab \le a^3 - b^3 \le 12ab.$$

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].