Find all functions $f:\mathbb{Z}\rightarrow \mathbb{Z}$ satisfying the following: $i)$ $f(1)=1$; $ii)$ $f(m+n)(f(m)-f(n))=f(m-n)(f(m)+f(n))$ for all $m,n \in \mathbb{Z}$.

Find all functions $f : R \to R$ such that for all $x, y \in R$: $$f(x + yf(x + y)) = y^2 + f(xf(y + 1)).$$

Determine all positive integers $n$ satisfying the following condition: for every monic polynomial $P$ of degree at most $n$ with integer coefficients, there exists a positive integer $k\le n$ and $k+1$ distinct integers $x_1,x_2,\cdots ,x_{k+1}$ such that \[P(x_1)+P(x_2)+\cdots +P(x_k)=P(x_{k+1})\]. [i]Note.[/i] A polynomial is [i]monic[/i] if the coefficient of the highest power is one.

Let $ a\ge 3 $ and a polynom $ P. $ Show that: $$ \max_{1\le k\le \text{grad} P} \left| a^{k-1}-P(k-1) \right| \ge 1 $$

$A, B$ are reals. Find a necessary and sufficient condition for $Ax + B[x] = Ay + B[y]$ to have no solutions except $x = y$.

Given integer $a_1\geq 2$. For integer $n\geq 2$, define $a_n$ to be the smallest positive integer which is not coprime to $a_{n-1}$ and not equal to $a_1,a_2,\cdots, a_{n-1}$. Prove that every positive integer except 1 appears in this sequence $\{a_n\}$.

A sequence $a_1,a_2,a_3,\ldots $ of non-negative integers is such that $a_{n+1}$ is the last digit of $a_n^n+a_{n-1}$ for all $n>2$. Is it always true that for some $n_0$ the sequence $a_{n_0},a_{n_0+1},a_{n_0+2},\ldots$ is periodic?

Find the largest $n$ such that the last nonzero digit of $n!$ is $1$.

Do either (1) or (2): (1) Show that any solution $f(t)$ of the functional equation $$f(x+y)f(x-y)=f(x)^{2} +f(y)^{2} -1$$ for $x,y\in \mathbb{R}$ satisfies $$f''(t)= \pm c^{2} f(t)$$ for a constant $c$, assuming the existence and continuity of the second derivative. Deduce that $f(t)$ is one of the functions $$ \pm \cos ct, \;\;\; \pm \cosh ct.$$ (2) Let $(a_{i})_{i=1,...,n}$ and $(b_{i})_{i=1,...,n}$ be real numbers. Define an $(n+1)\times (n+1)$-matrix $A=(c_{ij})$ by $$ c_{i1}=1, \; \; c_{1j}= x^{j-1} \; \text{for} \; j\leq n,\; \; c_{1n+1}=p(x), \;\; c_{ij}=a_{i-1}^{j-1} \; \text{for}\; i>1, j\leq n,\;\; c_{in+1}=b_{i-1}\; \text{for}\; i>1.$$ The polynomial $p(x)$ is defined by the equation $\det A=0$. Let $f$ be a polynomial and replace $(b_{i})$ with $(f(b_{i}))$. Then $\det A=0$ defines another polynomial $q(x)$. Prove that $f(p(x))-q(x)$ is a multiple of $$\prod_{i=1}^{n} (x-a_{i}).$$

Let $N$ be the set of positive integers. Find all functions $f : N \to N$ such that both $\bullet$ $f(f(m)f(n)) = mn$ $\bullet$ $f(2022a + 1) = 2022a + 1$ hold for all positive integers $m, n$ and $a$.

[b]p1.[/b] David runs at $3$ times the speed of Alice. If Alice runs $2$ miles in $30$ minutes, determine how many minutes it takes for David to run a mile. [b]p2.[/b] Al has $2019$ red jelly beans. Bob has $2018$ green jelly beans. Carl has $x$ blue jelly beans. The minimum number of jelly beans that must be drawn in order to guarantee $2$ jelly beans of each color is $4041$. Compute $x$. [b]p3.[/b] Find the $7$-digit palindrome which is divisible by $7$ and whose first three digits are all $2$. [b]p4.[/b] Determine the number of ways to put $5$ indistinguishable balls in $6$ distinguishable boxes. [b]p5.[/b] A certain reduced fraction $\frac{a}{b}$ (with $a,b > 1$) has the property that when $2$ is subtracted from the numerator and added to the denominator, the resulting fraction has $\frac16$ of its original value. Find this fraction. [b]p6.[/b] Find the smallest positive integer $n$ such that $|\tau(n +1)-\tau(n)| = 7$. Here, $\tau(n)$ denotes the number of divisors of $n$. [b]p7.[/b] Let $\vartriangle ABC$ be the triangle such that $AB = 3$, $AC = 6$ and $\angle BAC = 120^o$. Let $D$ be the point on $BC$ such that $AD$ bisect $\angle BAC$. Compute the length of $AD$. [b]p8.[/b] $26$ points are evenly spaced around a circle and are labeled $A$ through $Z$ in alphabetical order. Triangle $\vartriangle LMT$ is drawn. Three more points, each distinct from $L, M$, and $T$ , are chosen to form a second triangle. Compute the probability that the two triangles do not overlap. [b]p9.[/b] Given the three equations $a +b +c = 0$ $a^2 +b^2 +c^2 = 2$ $a^3 +b^3 +c^3 = 19$ find $abc$. [b]p10.[/b] Circle $\omega$ is inscribed in convex quadrilateral $ABCD$ and tangent to $AB$ and $CD$ at $P$ and $Q$, respectively. Given that $AP = 175$, $BP = 147$,$CQ = 75$, and $AB \parallel CD$, find the length of $DQ$. [b]p11. [/b]Let $p$ be a prime and m be a positive integer such that $157p = m^4 +2m^3 +m^2 +3$. Find the ordered pair $(p,m)$. [b]p12.[/b] Find the number of possible functions $f : \{-2,-1, 0, 1, 2\} \to \{-2,-1, 0, 1, 2\}$ that satisfy the following conditions. (1) $f (x) \ne f (y)$ when $x \ne y$ (2) There exists some $x$ such that $f (x)^2 = x^2$ [b]p13.[/b] Let $p$ be a prime number such that there exists positive integer $n$ such that $41pn -42p^2 = n^3$. Find the sum of all possible values of $p$. [b]p14.[/b] An equilateral triangle with side length $ 1$ is rotated $60$ degrees around its center. Compute the area of the region swept out by the interior of the triangle. [b]p15.[/b] Let $\sigma (n)$ denote the number of positive integer divisors of $n$. Find the sum of all $n$ that satisfy the equation $\sigma (n) =\frac{n}{3}$. [b]p16[/b]. Let $C$ be the set of points $\{a,b,c\} \in Z$ for $0 \le a,b,c \le 10$. Alice starts at $(0,0,0)$. Every second she randomly moves to one of the other points in $C$ that is on one of the lines parallel to the $x, y$, and $z$ axes through the point she is currently at, each point with equal probability. Determine the expected number of seconds it will take her to reach $(10,10,10)$. [b]p17.[/b] Find the maximum possible value of $$abc \left( \frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)^3$$ where $a,b,c$ are real such that $a +b +c = 0$. [b]p18.[/b] Circle $\omega$ with radius $6$ is inscribed within quadrilateral $ABCD$. $\omega$ is tangent to $AB$, $BC$, $CD$, and $DA$ at $E, F, G$, and $H$ respectively. If $AE = 3$, $BF = 4$ and $CG = 5$, find the length of $DH$. [b]p19.[/b] Find the maximum integer $p$ less than $1000$ for which there exists a positive integer $q$ such that the cubic equation $$x^3 - px^2 + q x -(p^2 -4q +4) = 0$$ has three roots which are all positive integers. [b]p20.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle ABC = 60^o$,$\angle ACB = 20^o$. Let $P$ be the point such that $CP$ bisects $\angle ACB$ and $\angle PAC = 30^o$. Find $\angle PBC$. PS. You had better use hide for answers.

Let $\mathbb{R}$ denote the set of all real numbers. Find all functions $f$ from $\mathbb{R}$ to $\mathbb{R}$ such that \[x^2f(x^2+y^2)+y^4=(xf(x+y)+y^2)(xf(x-y)+y^2)\] for all $x,y \in \mathbb{R}$.

Four points $A$, $B$, $C$, $D$ lie on the hyperbola $y=\frac{1}{x}$. In triangle $BCD$ the point $A_1$ is the circumcenter of the triangle, which vertices are the midpoints of sides of $BCD$. In triangles $ACD$, $ABD$ and $ABC$ points $B_1$, $C_1$ and $D_1$ are chosen similarly. It turned out that points $A_1$, $B_1$, $C_1$ and $D_1$ are pairwise different and concyclic. Prove that the center of that circle coincides with the $(0,0)$ point.

Let $a$, $b$, $c$ be the three roots of the equation $x^3-(k+1)x^2+kx+12=0$, where $k$ is a real number. If $(a-2)^3+(b-2)^3+(c-2)^3=-18$, find the value of $k$.

Find all the functions $ f: \mathbb{N}\rightarrow \mathbb{N}$ such that \[ 3f(f(f(n))) \plus{} 2f(f(n)) \plus{} f(n) \equal{} 6n, \quad \forall n\in \mathbb{N}.\]

Prove that $[\sqrt{n}+\sqrt{n+1}]=[\sqrt{4n+1}]$ for all $n \in N$.

Find all real numbers $a$ for which there exist functions $f,g: \mathbb{R} \to \mathbb{R}$, where $g$ is strictly increasing, such that $f(1) = 1$, $f(2) = a$, and \[ f(x) - f(y) \leq (x-y)(g(x) - g(y)) \] for all real numbers $x$ and $y$.

[b]p1.[/b] Steven has just learned about polynomials and he is struggling with the following problem: expand $(1-2x)^7$ as $a_0 +a_1x+...+a_7x^7$ . Help Steven solve this problem by telling him what $a_1 +a_2 +...+a_7$ is. [b]p2.[/b] Each element of the set ${2, 3, 4, ..., 100}$ is colored. A number has the same color as any divisor of it. What is the maximum number of colors? [b]p3.[/b] Fuchsia is selecting $24$ balls out of $3$ boxes. One box contains blue balls, one red balls and one yellow balls. They each have a hundred balls. It is required that she takes at least one ball from each box and that the numbers of balls selected from each box are distinct. In how many ways can she select the $24$ balls? [b]p4.[/b] Find the perfect square that can be written in the form $\overline{abcd} - \overline{dcba}$ where $a, b, c, d$ are non zero digits and $b < c$. $\overline{abcd}$ is the number in base $10$ with digits $a, b, c, d$ written in this order. [b]p5.[/b] Steven has $100$ boxes labeled from $ 1$ to $100$. Every box contains at most $10$ balls. The number of balls in boxes labeled with consecutive numbers differ by $ 1$. The boxes labeled $1,4,7,10,...,100$ have a total of $301$ balls. What is the maximum number of balls Steven can have? [b]p6.[/b] In acute $\vartriangle ABC$, $AB=4$. Let $D$ be the point on $BC$ such that $\angle BAD = \angle CAD$. Let $AD$ intersect the circumcircle of $\vartriangle ABC$ at $X$. Let $\Gamma$ be the circle through $D$ and $X$ that is tangent to $AB$ at $P$. If $AP = 6$, compute $AC$. [b]p7.[/b] Consider a $15\times 15$ square decomposed into unit squares. Consider a coloring of the vertices of the unit squares into two colors, red and blue such that there are $133$ red vertices. Out of these $133$, two vertices are vertices of the big square and $32$ of them are located on the sides of the big square. The sides of the unit squares are colored into three colors. If both endpoints of a side are colored red then the side is colored red. If both endpoints of a side are colored blue then the side is colored blue. Otherwise the side is colored green. If we have $196$ green sides, how many blue sides do we have? [b]p8.[/b] Carl has $10$ piles of rocks, each pile with a different number of rocks. He notices that he can redistribute the rocks in any pile to the other $9$ piles to make the other $9$ piles have the same number of rocks. What is the minimum number of rocks in the biggest pile? [b]p9.[/b] Suppose that Tony picks a random integer between $1$ and $6$ inclusive such that the probability that he picks a number is directly proportional to the the number itself. Danny picks a number between $1$ and $7$ inclusive using the same rule as Tony. What is the probability that Tony’s number is greater than Danny’s number? [b]p10.[/b] Mike wrote on the board the numbers $1, 2, ..., n$. At every step, he chooses two of these numbers, deletes them and replaces them with the least prime factor of their sum. He does this until he is left with the number $101$ on the board. What is the minimum value of $n$ for which this is possible? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a function which satisfies the following: [list][*] $f(m)=m$, for all $m\in\mathbb{Z}$;[*] $f(\frac{a+b}{c+d})=\frac{f(\frac{a}{c})+f(\frac{b}{d})}{2}$, for all $a, b, c, d\in\mathbb{Z}$ such that $|ad-bc|=1$, $c>0$ and $d>0$;[*] $f$ is monotonically increasing.[/list] (a) Prove that the function $f$ is unique. (b) Find $f(\frac{\sqrt{5}-1}{2})$.

Let $P(z)=a_nz^n+a_{n-1}z^{n-1}+\ldots+a_mz^m$ be a polynomial with complex coefficients such that $a_m\neq 0, a_n\neq 0$ and $n>m$. Prove that \[\text{max}_{|z|=1}\{|P(z)|\}\ge\sqrt{2|a_ma_n|+\sum_{k=m}^{n} |a_k|^2}\]

A [i]repunit[/i] is a positive integer whose digits in base $ 10$ are all ones. Find all polynomials $ f$ with real coefficients such that if $ n$ is a repunit, then so is $ f(n).$

Consider the set $A = \{0, 1, 2, . . . , 2^{2n} - 1\}$. The function $f : A \rightarrow A$ is given by: $f(x_0 + 2x_1 + 2^2x_2 + ... + 2^{2n-1}x_{2n-1})=$$(1 - x_0) + 2x_1 + 2^2(1 - x_2) + 2^3x_3 + ... + 2^{2n-1}x_{2n-1}$ for every $0-1$ sequence $(x_0, x_1, . . . , x_{2n-1})$. Show that if $a_1, a_2, . . . , a_9$ are consecutive terms of an arithmetic progression, then the sequence $f(a_1), f(a_2), . . . , f(a_9)$ is not increasing.

Define the sequence $a_1 = 2$ and $a_n = 2^{a_{n-1}} + 2$ for all integers $n \ge 2$. Prove that $a_{n-1}$ divides $a_n$ for all integers $n \ge 2$. [i]Proposed by Sam Korsky[/i]

Find the least $k$ for which the number $2010$ can be expressed as the sum of the squares of $k$ integers.

Let $\mathbb{N}=\{1,2,\ldots\}$. Find all functions $f: \mathbb{N}\to\mathbb{N}$ such that for all $m,n\in \mathbb{N}$ the number $f^2(m)+f(n)$ is a divisor of $(m^2+n)^2$.