A sequence of polynomials $\{f_n\}_{n=0}^{\infty}$ is defined recursively by $f_0(x)=1$, $f_1(x)=1+x$, and \[(k+1)f_{k+1}(x)-(x+1)f_k(x)+(x-k)f_{k-1}(x)=0, \quad k=1,2,\ldots\] Prove that $f_k(k)=2^k$ for all $k\geq 0$.

Four sequences of real numbers $(a_n), (b_n), (c_n), (d_n)$ satisfy for all $n$, $$a_{n+1} = a_n +b_n, b_{n+1} = b_n +c_n,$$ $$c_{n+1} = c_n +d_n, d_{n+1} = d_n +a_n.$$ Prove that if $a_{k+m} = a_m, b_{k+m} = b_m, c_{k+m} = c_m, d_{k+m} = d_m$ for some $k\ge 1,n \ge 1$, then $a_2 = b_2 = c_2 = d_2 = 0$.

Let $a_1,a_2,...,a_{2020}$ be positive real numbers. Prove that: $$\max{(a^2_1-a_2,a^2_2-a_3,...,a^2_{2020}-a_1)}\ge\max{(a^2_1-a_1,a^2_2-a_2,...,a^2_{2020}-a_{2020})}$$

Let $ABC$ be an acute-angled triangle inscribed in the circle $(O)$. Let $AD$ be the diameter of $(O)$. The points $M,N$ are chosen on $BC$ such that $OM\parallel AB, ON\parallel AC$. The lines $DM,DN$ cut $(O)$ again at $P,Q$. Prove that $BC=DP=DQ$. Tran Quang Hung, Vietnam

Let $x,y$ and $z$ be non-negative real numbers satisfying the equation $x+y+z=xyz$. Prove that $2(x^2+y^2+z^2)\geq3(x+y+z)$.

A right triangle has all its sides rational numbers and the area $S $. Prove that there exists a right triangle, different from the original one, such that all its sides are rational numbers and its area is $S $. Tuymaada 2017 Q4 Juniors

Steve says to Jon, "I am thinking of a polynomial whose roots are all positive integers. The polynomial has the form $P(x)=2x^3-2ax^2+(a^2-81)x-c$ for some positive integers $a$ and $c$. Can you tell me the values of $a$ and $c$?" After some calculations, Jon says, "There is more than one such polynomial." Steve says, "You’re right. Here is the value of $a$." He writes down a positive integer and asks, "Can you tell me the value of $c$?" Jon says, "There are still two possible values of $c$." Find the sum of the two possible values of $c$.

A circle is tangential to sides $AB$ and $AD$ of convex quadrilateral $ABCD$ at $G$ and $H$ respectively, and cuts diagonal $AC$ at $E$ and $F$. What are the necessary and sufficient conditions such that there exists another circle which passes through $E$ and $F$, and is tangential to $DA$ and $DC$ extended?

On a $n \times n$ grid, each edge are written with $=$ or $\neq$. We need to filled every cells with color black or white. Find the largest constant $k$, such that for every $n>777771449$ and any layout of $=$ and $\neq$, we can always find a way to colored every cells, such that at least $k \cdot 2n(n-1)$ neighboring cells, there colors conform to the symbols on the edge. (Namely, two cells are filled with the same color if $=$ was written on their edge; two cells are filled with different colors if $\neq$ was written on their edge) [i]Proposed by chengbilly & sn6dh[/i]

Georg has a board displaying the numbers from $1$ to $50$. Georg may strike out a number if it can be formed by starting with the number $2$ and doing one or more calculations where he either multiplies by $10$ or subtracts $3$. Which of the board’s numbers may Georg strike out?[img]https://cdn.artofproblemsolving.com/attachments/c/e/1bea13b691d3591d782e698bedee3235f8512f.png[/img] Example: Georg may strike out $26$ because it may, for example, be formed by starting with $2$, multiplying by $10$, subtracting $3$ three times, multiplying by $10$ and subtracting $3$ twenty-eight times.

Let $x_0,x_1,\dots, x_{n-1}$ be real numbers such that $0<|x_0|<|x_1|<\dots<|x_{n-1}|$. We will write the sum of the elements of each one of the $2^n$ subsets of $\{x_0,x_1,\dots,x_{n-1}\}$ in a paper. Prove that the $2^n$ written numbers are consecutive elements of a arithmetic progression if and only if the ratios $$|\frac{x_i}{x_j}|, 0\leq j<i\leq n-1$$ are equal(s) to the ratio(s) obtained with the numbers $2^0,2^1,\dots,2^{n-1}$. Note: The sum of the elements of the empty set is $0$.

Starting with a list of three numbers, the “[i]Make-My-Day[/i]” procedure creates a new list by replacing each number by the sum of the other two. For example, from $\{1, 3, 8\}$ “[i]Make-My-Day[/i]” gives $\{11, 9, 4\}$ and a new “[i]MakeMy-Day[/i]” leads to $\{13, 15, 20\}$. If we begin with $\{20, 1, 8\}$, what is the maximum difference between two numbers on the list after $2018$ consecutive “[i]Make-My-Day[/i]”s?

Prove that for all positive integers $m$ and $n$, $$\frac1m\cdot\binom{2n}0-\frac1{m+1}\cdot\binom{2n}1+\frac1{m+2}\cdot\binom{2n}2-\ldots+\frac1{m+2n}\cdot\binom{2n}{n2}>0$$

Some circles of radius 2 are drawn on the plane. Prove that the numerical value of the total area covered by these circles is at least as big as the total length of arcs bounding the area.

Real numbers $a, b, c$ are such that $$a^2+c-bc = b^2+a-ca = c^2+b-ab$$ Does it follow that $a=b=c$? [i]Proposed by Mykhailo Shtandenko[/i]

Chameleons of five colors live on the island. When one chameleon bites another, the color of bitten chameleon changes to one of these five colors according to some rule, and the new color depends only on the color of the bitten and the color of the bitting. It is known that $2023$ red chameleons can agree on a sequence of bites between themselves, after which they will all turn blue. What is the smallest $k$ that can guarantee that $k$ red chameleons, biting only each other, can turn blue? (For example, the rules might be: if a red chameleon bites a green one, the bitten one changes color to blue; if a green one bites a red one, the bitten one remains red, that is, "changes color to red"; if red bites red, the bitten one changes color to yellow, etc. The rules for changing colors may be different.)

Andy flips a strange coin for which the probability of flipping heads is $\frac{1}{2^k+1}$, where $k$ is the number of heads that appeared previously. If Andy flips the coin repeatedly until he gets heads 10 times, what is the expected number of total flips he performs? [i]Proposed by Harry Kim[/i]

A prime number $p$ and a positive integer $n$ are given. Prove that one can colour every one of the numbers $1,2,\ldots,p-1$ using one of the $2n$ colours so that for any $i=2,3,\ldots,n$ the sum of any $i$ numbers of the same colour is not divisible by $p$.

Two circles with centers $O_{1}$ and $O_{2}$ meet at two points $A$ and $B$ such that the centers of the circles are on opposite sides of the line $AB$. The lines $BO_{1}$ and $BO_{2}$ meet their respective circles again at $B_{1}$ and $B_{2}$. Let $M$ be the midpoint of $B_{1}B_{2}$. Let $M_{1}$, $M_{2}$ be points on the circles of centers $O_{1}$ and $O_{2}$ respectively, such that $\angle AO_{1}M_{1}= \angle AO_{2}M_{2}$, and $B_{1}$ lies on the minor arc $AM_{1}$ while $B$ lies on the minor arc $AM_{2}$. Show that $\angle MM_{1}B = \angle MM_{2}B$. [i]Ciprus[/i]

Prove that there exist $0 < \alpha< \beta<1$ numbers have the following properties. (i) for any sufficiently large n, n points can be specified in $\Bbb R^3$ , so that each point is equidistant from at least $n^\alpha$ other points. (ii) the above statement is no longer true with $n^\beta$ instead of $n^\alpha$

Let $P$ be a point inside a triangle $ABC$ such that $$ \frac{AP + BP}{AB} = \frac{BP + CP}{BC} = \frac{CP + AP}{CA} .$$ Lines $AP$, $BP$, $CP$ intersect the circumcircle of triangle $ABC$ again in $A'$, $B'$, $C'$. Prove that the triangles $ABC$ and $A'B'C'$ have a common incircle.

4. Given is an acute-angled triangle $A B C, H$ is its orthocenter. Let $P$ be an arbitrary point inside (and not on the sides) of the triangle $A B C$ that belongs to the circumcircle of the triangle $A B H$. Let $A^{\prime}, B^{\prime}$, $C^{\prime}$ be projections of point $P$ to the lines $B C, C A, A B$. Prove that the circumcircle of the triangle $A^{\prime} B^{\prime} C^{\prime}$ passes through the midpoint of segment $C P$. Alexey Zaslavsky

Consider the numbers from $1$ to $16$. The "solitar" game consists in the arbitrary grouping of the numbers in pairs and replacing each pair with the great prime divisor of the sum of the two numbers (i.e from $(1,2); (3,4); (5,6);...;(15,16)$ the numbers which result are $3,7,11,5,19,23,3,31$). The next step follows from the same procedure and the games continues untill we obtain only one number. Which is the maximum numbers with which the game ends.

Let a sequence $(a_n)$ satisfy: $a_1=5,a_2=13$ and $a_{n+1}=5a_n-6a_{n-1},\forall n\ge2$ a) Prove that $(a_n, a_{n+1})=1,\forall n\ge1$ b) Prove that: $2^{k+1}|p-1\forall k\in\mathbb{N}$, if p is a prime factor of $a_{2^k}$

Which of the following is equivalent to $$(2+3)(2^2+3^2)(2^4+3^4)(2^8+3^8)(2^{16}+3^{16})(2^{32}+3^{32})(2^{64}+3^{64})?$$ $\textbf{(A) }3^{127}+2^{127} \qquad \textbf{(B) }3^{127}+2^{127}+2\cdot 3^{63}+3\cdot 2^{63} \qquad \textbf{(C) }3^{128}-2^{128} \qquad \textbf{(D) }3^{128}+2^{128} \qquad \textbf{(E) }5^{127}$