Let $(a_n)_{n \geq 1}$ be a sequence of real numbers. We define a sequence of real functions $(f_n)_{n \geq 0}$ such that for all $x \in \mathbb{R}$, the following holds: \[ f_0(x) = 1 \quad \text{and} \quad f_n(x) = \int_{a_n}^{x} f_{n-1}(t) \, dt \quad \text{for } n \geq 1. \] Find all possible sequences $(a_n)_{n \geq 1}$ such that $f_n(0) = 0$ for all $n \geq 2$.\\ [b]Note:[/b] It is not necessarily true that $f_1(0) = 0$.

Find all functions $f: R \to R$ and $g:R \to R$ such that $f(x-f(y))=xf(y)-yf(x)+g(x)$ for all real numbers $x,y$. I.Voronovich

$a,b$ are two skew lines, the angle they form is $\theta$. Length of their common perpendicular $AA'$ is $d$($A'\in a,A\in b)$. $E\in a,F\in b,|A'E|=m,|AF|=n$. Calculate $|EF|$.

Let $x$ and $y$ be positive real numbers that satisfy $(\log x)^2+(\log y)^2=\log(x^2)+\log(y^2)$. Compute the maximum possible value of $(\log(xy))^2$.

Three $ \Delta $'s and a $ \diamondsuit $ will balance nine $ \bullet $'s. One $ \Delta $ will balance a $ \diamondsuit $ and a $ \bullet $. [asy] unitsize(5.5); fill((0,0)--(-4,-2)--(4,-2)--cycle,black); draw((-12,2)--(-12,0)--(12,0)--(12,2)); draw(ellipse((-12,5),8,3)); draw(ellipse((12,5),8,3)); label("$\Delta \hspace{2 mm}\Delta \hspace{2 mm}\Delta \hspace{2 mm}\diamondsuit $",(-12,6.5),S); label("$\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet \hspace{2 mm} \bullet $",(12,5.2),N); label("$\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet $",(12,5.2),S); fill((44,0)--(40,-2)--(48,-2)--cycle,black); draw((34,2)--(34,0)--(54,0)--(54,2)); draw(ellipse((34,5),6,3)); draw(ellipse((54,5),6,3)); label("$\Delta $",(34,6.5),S); label("$\bullet \hspace{2 mm}\diamondsuit $",(54,6.5),S);[/asy] How many $ \bullet $'s will balance the two $ \diamondsuit $'s in this balance? [asy] unitsize(5.5); fill((0,0)--(-4,-2)--(4,-2)--cycle,black); draw((-12,4)--(-12,2)--(12,-2)--(12,0)); draw(ellipse((-12,7),6.5,3)); draw(ellipse((12,3),6.5,3)); label("$?$",(-12,8.5),S); label("$\diamondsuit \hspace{2 mm}\diamondsuit $",(12,4.5),S);[/asy] $ \text{(A)}\ 1\qquad\text{(B)}\ 2\qquad\text{(C)}\ 3\qquad\text{(D)}\ 4\qquad\text{(E)}\ 5 $

Let $ABC$ be a triangle with $AB < AC$, incenter $I$, and $A$ excenter $I_{A}$. The incircle meets $BC$ at $D$. Define $E = AD\cap BI_{A}$, $F = AD\cap CI_{A}$. Show that the circumcircle of $\triangle AID$ and $\triangle I_{A}EF$ are tangent to each other

A homogeneous solid body is made by joining a base of a circular cylinder of height $h$ and radius $r,$ and the base of a hemisphere of radius $r.$ This body is placed with the hemispherical end on a horizontal table, with the axis of the cylinder in a vertical position, and then slightly oscillated. It is intuitively evident that if $r$ is large as compared to $h$, the equilibrium will be stable; but if $r$ is small compared to $h$, the equilibrium will be unstable. What is the critical value of the ratio $r\slash h$ which enables the body to rest in neutral equilibrium in any position?

Let the [i]square decomposition[/i] of a number be defined as the sequence of numbers given by the following algorithm. Given a positive integer $n$, add the largest possible perfect square that is less than or equal to $n$ to a sequence, and then subtract that number from $n$. Repeat as many times as necessary until your current $n$ is $0$. So for example, the square decomposition of $60$ would be $49, 9, 1, 1$. Define the size of a square decomposition to be the number of numbers in the sequence. Say that the maximal size of a square decomposition of a number in the range $[1, 2020]$ is $m$. Find the largest number in the range $[1, 2020]$ that has a square decomposition of size $m$. [i]Proposed by Timothy Qian[/i]

Joe has a triangle with area $\sqrt{3}.$ What's the smallest perimeter it could have?

The floor of a rectangular room is covered with square tiles. The room is 10 tiles long and 5 tiles wide. The number of tiles that touch the walls of the room is $\textbf{(A)}\ 26 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 34 \qquad \textbf{(D)}\ 46 \qquad \textbf{(E)}\ 50$

Let $ABCD$ be a parallelogram. A circle with diameter $AC$ intersects line $BD$ at points $P$ and $Q$. The perpendicular on $AC$ passing through point $C$, intersects lines $AB$ and $AD$ at points $X$ and $Y$, respectively. Prove that the points $P, Q, X$ and $Y$ lie on the same circle.

In a triangle one side is $3$ times shorter than the sum of the other two. Prove that the angle opposite said side is the smallest of the triangle’s angles.

How many $3$-digit numbers contain the digit $7$ exactly once?

When the sum of the first ten terms of an arithmetic progression is four times the sum of the first five terms, the ratio of the first term to the common difference is: $ \textbf{(A)}\ 1: 2 \qquad\textbf{(B)}\ 2: 1 \qquad\textbf{(C)}\ 1: 4 \qquad\textbf{(D)}\ 4: 1 \qquad\textbf{(E)}\ 1: 1$

10.6 Let the insphere of a pyramid $SABC$ touch the faces $SAB, SBC, SCA$ at $D, E, F$ respectively. Find all the possible values of the sum of the angles $SDA, SEB, SFC$.

Two circles $\omega_A$ and $\omega_B$ have centers at points $A$ and $B$ respectively and intersect at points $P$ and $Q$ in such a way that $A$, $B$, $P$, and $Q$ all lie on a common circle $\omega$. The tangent to $\omega$ at $P$ intersects $\omega_A$ and $\omega_B$ again at points $X$ and $Y$ respectively. Suppose $AB = 17$ and $XY = 20$. Compute the sum of the radii of $\omega_A$ and $\omega_B$.

Find the least possible value of $(x + y)(y + z)$ for positive reals satisfying $(x + y + z) xyz = 1$.

Find all natural $ x $ for which $ 3x+1 $ and $ 6x-2 $ are perfect squares, and the number $ 6x^2-1 $ is prime.

Let $ABCDEF$ be a regular hexagon of side length $3$. Let $X, Y,$ and $Z$ be points on segments $AB, CD,$ and $EF$ such that $AX=CY=EZ=1$. The area of triangle $XYZ$ can be expressed in the form $\dfrac{a\sqrt b}{c}$ where $a,b,c$ are positive integers such that $b$ is not divisible by the square of any prime and $\gcd(a,c)=1$. Find $100a+10b+c$. [i] Proposed by James Lin [/i]

A hexagon is inscribed in a circle of radius $r$. Two of the sides of the hexagon have length $1$, two have length $2$ and two have length $3$. Show that $r$ satisfies the equation $2r^3 - 7r - 3 = 0$.

What is the total number of natural numbes divisible by 9 the number of digits of which does not exceed 2008 and at least two of the digits are 9s?

Teams $T_1$, $T_2$, $T_3$, and $T_4$ are in the playoffs. In the semifinal matches, $T_1$ plays $T_4$ and $T_2$ plays $T_3$. The winners of those two matches will play each other in the final match to determine the champion. When $T_i$ plays $T_j$, the probability that $T_i$ wins is $\frac{i}{i+j}$, and the outcomes of all the matches are independent. The probability that $T_4$ will be the champion is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

The period of a given pendulum on a planet of radius $R$ is constant (unchanged) as we go from the surface of the planet down to radius $a$, where $R > a$. The planet has mass density evenly distributed at any radius $ r < a $. This density is $\rho_0$. Find the total mass of the planet. Express your answer in terms of $\rho_0$, $a$, $R$, the period of the pendulum, $T$, the length of the pendulum string, $L$, and other constants, as necessary. [b]Warning[/b]: Your answer may contain some math. So be sure to input this correctly! [i]Problem proposed by Trung Phan[/i]

[b]p1.[/b] A bus leaves San Mateo with $n$ fairies on board. When it stops in San Francisco, each fairy gets off, but for each fairy that gets off, $n$ fairies get on. Next it stops in Oakland where $6$ times as many fairies get off as there were in San Mateo. Finally the bus arrives at Berkeley, where the remaining $391$ fairies get off. How many fairies were on the bus in San Mateo? [b]p2.[/b] Let $a$ and $b$ be two real solutions to the equation $x^2 + 8x - 209 = 0$. Find $\frac{ab}{a+b}$ . Express your answer as a decimal or a fraction in lowest terms. [b]p3.[/b] Let $a$, $b$, and $c$ be positive integers such that the least common multiple of $a$ and $b$ is $25$ and the least common multiple of $b$ and $c$ is $27$. Find $abc$. [b]p4.[/b] It takes Justin $15$ minutes to finish the Speed Test alone, and it takes James $30$ minutes to finish the Speed Test alone. If Justin works alone on the Speed Test for $3$ minutes, then how many minutes will it take Justin and James to finish the rest of the test working together? Assume each problem on the Speed Test takes the same amount of time. [b]p5.[/b] Angela has $128$ coins. $127$ of them have the same weight, but the one remaining coin is heavier than the others. Angela has a balance that she can use to compare the weight of two collections of coins against each other (that is, the balance will not tell Angela the weight of a collection of coins, but it will say which of two collections is heavier). What is the minumum number of weighings Angela must perform to guarantee she can determine which coin is heavier? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\omega$ be an incircle of triangle $ABC$. Let $D$ be a point on segment $BC$, which is tangent to $\omega$. Let $X$ be an intersection of $AD$ and $\omega$ against $D$. If $AX : XD : BC = 1 : 3 : 10$, a radius of $\omega$ is $1$, find the length of segment $XD$. Note that $YZ$ expresses the length of segment $YZ$.