Evaluate the following : \[ \int_{0}^{\infty}\left(x-\frac{x^3}{2}+\frac{x^5}{2\cdot 4}-\frac{x^7}{2\cdot 4\cdot 6}+\cdots \right)\;\left(1+\frac{x^2}{2^2}+\frac{x^4}{2^2\cdot 4^2}+\frac{x^6}{2^2\cdot 4^2\cdot 6^2}+\cdots \right)\,\mathrm{d}x \]

One hundred pirates played cards. When the game was over, each pirate calculated the amount he won or lost. The pirates have a gold sand as a currency; each has enough to pay his debt. Gold could only change hands in the following way. Either one pirate pays an equal amount to every other pirate, or one pirate receives the same amount from every other pirate. Prove that after several such steps, it is possible for each winner to receive exactly what he has won and for each loser to pay exactly what he has lost. [i](4 points)[/i]

Let $S$ denote the set of rational numbers in the interval $(0,1)$. Determine, with proof, if there exists a subset $T$ of $S$ such that every element in $S$ can be uniquely written as the sum of finitely many distinct elements in $T$.

Freddy the frog is jumping around the coordinate plane searching for a river, which lies on the horizontal line $y = 24$. A fence is located at the horizontal line $y = 0$. On each jump Freddy randomly chooses a direction parallel to one of the coordinate axes and moves one unit in that direction. When he is at a point where $y=0$, with equal likelihoods he chooses one of three directions where he either jumps parallel to the fence or jumps away from the fence, but he never chooses the direction that would have him cross over the fence to where $y < 0$. Freddy starts his search at the point $(0, 21)$ and will stop once he reaches a point on the river. Find the expected number of jumps it will take Freddy to reach the river.

Let $n$ be a positive number. Prove that there exists an integer $N =\overline{m_1m_2...m_n}$ with $m_i \in \{1, 2\}$ which is divisible by $2^n$.

Alice and Bob play a game on a board consisting of one row of 2022 consecutive squares. They take turns placing tiles that cover two adjacent squares, with Alice going first. By rule, a tile must not cover a square that is already covered by another tile. The game ends when no tile can be placed according to this rule. Alice's goal is to maximize the number of uncovered squares when the game ends; Bob's goal is to minimize it. What is the greatest number of uncovered squares that Alice can ensure at the end of the game, no matter how Bob plays?

Find all the functions $ f :\mathbb{R}\mapsto\mathbb{R} $ with the following property: $ \forall x$ $f(x)= f(x/2) + (x/2)f'(x)$

Show that for any positive integer $n > 2$ we can find $n$ distinct positive integers such that the sum of their reciprocals is $1$.

Let $c$ be a fixed positive integer, and $\{x_k\}^{\inf}_{k=1}$ be a sequence such that $x_1=c$ and $x_n=x_{n-1}+\lfloor \frac{2x_{n-1}-2}{n} \rfloor$ for $n \ge 2$. Determine the explicit formula of $x_n$ in terms of $n$ and $c$. (Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.)

On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue. At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet. After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls. Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?

Suppose $\{a(n) \}_{n=1}^{\infty}$ is a sequence that: \[ a(n) =a(a(n-1))+a(n-a(n-1)) \ \ \ \forall \ n \geq 3\] and $a(1)=a(2)=1$. Prove that for each $n \geq 1$ , $a(2n) \leq 2a(n)$.

Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.

Find, with proof, all real numbers $x$ satisfying $x = 2\left( 2 \left( 2\left( 2\left( 2x-1 \right)-1 \right)-1 \right)-1 \right)-1$. [i]Proposed by Evan Chen[/i]

For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Let the $A$ be the set of all nonenagative integers. It is given function such that $f:\mathbb{A}\rightarrow\mathbb{A}$ with $f(1) = 1$ and for every element $n$ od set $A$ following holds: [b]1)[/b] $3 f(n) \cdot f(2n+1) = f(2n) \cdot (1+3 \cdot f(n))$; [b]2)[/b] $f(2n) < 6f(n)$, Find all solutions of $f(k)+f(l) = 293$, $k<l$.