An infinite sequence $(x_{n})$ is defined by its first term $x_{1}>1$, which is a rational number, and the relation $x_{n+1}=x_{n}+\frac{1}{\lfloor x_{n}\rfloor}$ for all positive integers $n$. Prove that this sequence contains an integer. [i]A. Golovanov[/i]

Let $n$ be an odd positive integer. Prove that $\sigma(n)^3 <n^4$.

Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.

When Pablo turns $15$, he throws a party inviting $43$ friends. He presents them with a cake n the form of a regular $15$-sided polygon and on it $15$ candles. The candles are arranged so that between candles and vertices there are never three aligned (any three candles are not aligned, nor are any two candles with a vertex of the polygon, nor are any two vertices of the polygon with a candle). Then Pablo divides the cake into triangular pieces, by means of cuts that join candles to each other or candles and vertices, but also do not intersect with others already made. Why, by doing this, Paul was able to distribute a piece to each of his guests but he was left without eating?

Find all integers $x,y$ that satisfy the equation $x+y=x^2-xy+y^2$

Let $ X $ be the power set of set of $ \{ 0\}\cup\mathbb{N} , $ and let be a function $ d:X^2\longrightarrow\mathbb{R} $ defined as $$ d(U,V)=\sum_{n\in\mathbb{N}}\frac{\chi_U (n) +\chi_V (n) -2\chi_{U\cap V} (n)}{2} , $$ where $ \chi_W (n)=\left\{ \begin{matrix} 1,& n\in W\\ 0,& n\not\in W \end{matrix} \right. ,\quad\forall W\in X,\forall n\in\mathbb{N} . $ [b]a)[/b] Prove that there exists an unique $ V' $ such that $ \lim_{k\to\infty} d\left( \{ k+i|i\in\mathbb{N}\} , V'\right) =0. $ [b]b)[/b] Demonstrate that for all $ V\in X $ there exists a $ v\in\mathbb{N} $ with $ d\left( \left\{ \frac{3}{2} -\frac{1}{2}(-1)^{v} \right\} , V \right) >\frac{1}{k} . $ [b]c)[/b] Let $ f: X\longrightarrow X,\quad f(X)=\left\{ 1+x|x\in X\right\} . $ Calculate $ d\left( f(A),f(B) \right) $ in terms of $ d(A,B) $ and prove that $ f $ admits an unique fixed point.

To a sheet of paper, we glue $2011$ “handles” that do not intersect, that is, strips of paper glued to the sheet in your ends. No handle can be twisted. Prove that the surface boundary thus formed has at least two cycles (closed curves). That is, an ant that only walks along the edge of the paper never runs through the entire surface boundary. For example, the configuration represented in the figure has three cycles: one in dashed lines, one in lines dotted lines and another in a continuous line (this cycle passes under a tab twice). [img]https://cdn.artofproblemsolving.com/attachments/f/e/121146a240215f241278b3aabde13a67544e7a.png[/img]

Let $ABC$ be a triangle such that \[ \left( \cot \dfrac{A}{2} \right)^2 + \left( 2\cot \dfrac{B}{2} \right)^2 + \left( 3\cot \dfrac{C}{2} \right)^2 = \left( \dfrac{6s}{7r} \right)^2, \] where $s$ and $r$ denote its semiperimeter and its inradius, respectively. Prove that triangle $ABC$ is similar to a triangle $T$ whose side lengths are all positive integers with no common divisors and determine these integers.

A spider is walking on the boundary of equilateral triangle $\triangle{ABC}$ (vertices labelled in counterclockwise order), starting at vertex $A$. Each second, she moves to one of her two adjacent vertices with equal probability. The windiness of a path that starts and ends at $A$ is the net number of counterclockwise revolutions made. For example, the windiness of the path $ABCA$ is $1,$ and the windiness of the path $ABCACBACBA$ is $-1$. What is the remainder modulo $1000$ of the sum of the squares of the windiness values taken over all possible paths that end back at vertex $A$ after $2025$ seconds?

A palindrome between $ 1000$ and $ 10,000$ is chosen at random. What is the probability that it is divisible by $ 7?$ $ \textbf{(A)}\ \dfrac{1}{10} \qquad \textbf{(B)}\ \dfrac{1}{9} \qquad \textbf{(C)}\ \dfrac{1}{7} \qquad \textbf{(D)}\ \dfrac{1}{6}\qquad \textbf{(E)}\ \dfrac{1}{5}$