Let $\{a_n\}^\infty_{n=0}$ be the sequence of real numbers satisfying $a_0=0$, $a_1=1$ and $$a_{n+2}=a_{n+1}+\frac{a_n}{2^n}$$for every $n\ge0$. Prove that $$\lim_{n\to\infty}a_n=1+\sum_{n=1}^\infty\frac1{2^{\frac{n(n-1)}2}\displaystyle\prod_{k=1}^n(2^k-1)}.$$

Solve the equation for primes $p$ and $q$: $$p^3-q^3=pq^3-1.$$

Two parabolas, $y = ax^2 + bx + c$ and $y = -ax^2- bx - c$, intersect at $x = 2$ and $x = -2$. If the $y$-intercepts of the two parabolas are exactly $2$ units apart from each other, compute $|a+b+c|$.

For every positive integer $n$ show that \[[\sqrt{4n + 1}] = [\sqrt{4n + 2}] = [\sqrt{4n + 3}] = [\sqrt{n} + \sqrt{n + 1}]\] where $[x]$ is the greatest integer less than or equal to $x$ (for example $[2.3] = 2$, $[\pi] = 3$, $[5] = 5$).

Let $m,n$ be positive integers greater than $1$. We define the sets $P_m=\left\{\frac{1}{m},\frac{2}{m},\cdots,\frac{m-1}{m}\right\}$ and $P_n=\left\{\frac{1}{n},\frac{2}{n},\cdots,\frac{n-1}{n}\right\}$. Find the distance between $P_m$ and $P_n$, that is defined as \[\min\{|a-b|:a\in P_m,b\in P_n\}\]

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

Let $S$ be the sum of all real $x$ such that $4^x = x^4$. Find the nearest integer to $S$.

A cunning dragon guards a princess. To overcome the dragon and to win the princess you must solve the following task: The dragon has in some of the fields $i$ the columned hall (see figure) with the numbers $1-8$. Even in the rest of the fields you can place numbers $9-36$. The numbers $1-36$ must be arranged so that any turn that starts with one enters from either the south or the west, and ends up going out towards either the north or east, goes through at least one number from the $5$ table. (On the figure are north, south, east and west indicated by N, S, E and W). Georg wants to win the princess. Is it possible to be done? [img]https://cdn.artofproblemsolving.com/attachments/0/7/2ad1b7f944847ee6d3c614ea6c2656865808e7.png[/img]

We have a set of $343$ closed jars, each containing blue, yellow and red marbles with the number of marbles from each color being at least $1$ and at most $7$. No two jars have exactly the same contents. Initially all jars are with the caps up. To flip a jar will mean to change its position from cap-up to cap-down or vice versa. It is allowed to choose a triple of positive integers $(b; y; r) \in \{1; 2; ...; 7\}^3$ and flip all the jars whose number of blue, yellow and red marbles differ by not more than $1$ from $b, y, r$, respectively. After $n$ moves all the jars turned out to be with the caps down. Find the number of all possible values of $n$, if $n \le 2021$.

Let $S$ be a finite set with n elements and $\mathcal F$ a family of subsets of $S$ with the following property: $$A\in\mathcal F,A\subseteq B\subseteq S\implies B\in\mathcal F.$$Prove that the function $f:[0,1]\to\mathbb R$ given by $$f(t):=\sum_{A\in\mathcal F}t^{|A|}(1-t)^|S\setminus A|$$is nondecreasing ($|A|$ denotes the number of elements of $A$).

Let $n$ be a positive integer and $\mathcal{P}_n$ be the set of integer polynomials of the form $a_0+a_1x+\ldots +a_nx^n$ where $|a_i|\le 2$ for $i=0,1,\ldots ,n$. Find, for each positive integer $k$, the number of elements of the set $A_n(k)=\{f(k)|f\in \mathcal{P}_n \}$. [i]Marian Andronache[/i]

Let $d \geq 3$ and let $A_1 \dots A_{d + 1}$ be a simplex in $\mathbb{R}^d$. (A simplex is the convex hull of $d + 1$ points not lying in a common hyperplane.) For every $i = 1, \dots , d + 1$ let $O_i$ be the circumcentre of the face $A_1 \dots A_{i - 1}A_{i+1}\dots A_{d+1}$, i.e. $O_i$ lies in the hyperplane $A_1 \dots A_{i - 1}A_{i+1}\dots A_{d+1}$ and it has the same distance from all points $A_1, \dots , A_{i-1}, A_{i+1}, \dots , A_{d+1}$. For each $i$ draw a line through $A_i$ perpendicular to the hyperplane $O_1 \dots O_{i-1}O_{i+1} \dots O_{d+1}$. Prove that either these lines are parallel or they have a common point.

a) Let $x$ and $y$ be positive numbers such that $x + y = 2$. Show that $\frac{1}{x}+\frac{1}{y} \le \frac{1}{x^2}+\frac{1}{y^2}$ b) Let $x,y$ and $z$ be positive numbers such that $x + y +z= 2$. Show that $\frac{1}{x}+\frac{1}{y} +\frac{1}{z} +\frac{9}{4} \le \frac{1}{x^2}+\frac{1}{y^2}+\frac{1}{z^2}$ .

Given three equidistant parallel lines. Express by points of the corresponding lines the values of the resistance, voltage and current in a conductor so as to obtain the voltage $V = I \cdot R$ by connecting with a ruler the points denoting the resistance $R$ and the current $I$. (Each point of each scale denotes only one number). [hide=similar wording]Three parallel straight lines are given at equal distances from each other. How to depict by points of the corresponding straight lines the values of resistance, voltage and the current in the conductor, so that, applying a ruler to to points depicting the values of resistance R and values of current I, obtain on the voltage scale a point depicting the value of voltage V = I R (point each scale represents one and only one number).[/hide]

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.

Consider the set $\mathbb A=\{f\in C^1([-1,1]):f(-1)=-1,f(1)=1\}$. Prove that there is no function in this function space that gives us the minimum of $S=\int_{-1}^1x^2f'(x)^2dx$. What is the infimum of $S$ for the functions of this space?