Let $a\geq 1$ be a real number. Put $x_{1}=a,x_{n+1}=1+\ln{(\frac{x_{n}^{2}}{1+\ln{x_{n}}})}(n=1,2,...)$. Prove that the sequence $\{x_{n}\}$ converges and find its limit.

Consider a sequence $1^{0.01},\ 2^{0.02},\ 2^{0.02},\ 3^{0.03},\ 3^{0.03},\ 3^{0.03},\ 4^{0.04},\ 4^{0.04},\ 4^{0.04},\ 4^{0.04},\ \cdots$. (1) Find the 36th term. (2) Find $\int x^2\ln x\ dx$. (3) Let $A$ be the product of from the first term to the 36th term. How many digits does $A$ have integer part? If necessary, you may use the fact $2.0<\ln 8<2.1,\ 2.1<\ln 9<2.2,\ 2.30<\ln 10<2.31$. [i]2010 National Defense Medical College Entrance Exam, Problem 4[/i]

Let $N$ be a positive integer. A non-decreasing sequence $a_1 \le a_2 \le \dots$ of positive integers is said to be $N$-rioplatense if there exists an index $i$ such that $N = \frac{i}{a_i}$. Show that every sequence $2024$-rioplatense is $k$-rioplatense for $k=1, 2, 3, \dots, 2023$.

Equilateral triangle $ABC$ has side length $6$. Circles with centers at $A$, $B$, and $C$ are drawn such that their respective radii $r_A$, $r_B$, and $r_C$ form an arithmetic sequence with $r_A<r_B<r_C$. If the shortest distance between circles $A$ and $B$ is $3.5$, and the shortest distance between circles $A$ and $C$ is $3$, then what is the area of the shaded region? Express your answer in terms of pi. [asy] size(8cm); draw((0,0)--(6,0)--6*dir(60)--cycle); draw(circle((0,0),1)); draw(circle(6*dir(60),1.5)); draw(circle((6,0),2)); filldraw((0,0)--arc((0,0),1,0,60)--cycle, grey); filldraw(6*dir(60)--arc(6*dir(60),1.5,240,300)--cycle, grey); filldraw((6,0)--arc((6,0),2,120,180)--cycle, grey); label("$A$",(0,0),SW); label("$B$",6*dir(60),N); label("$C$",(6,0),SE); [/asy]

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

Let $(x_i)$ be a decreasing sequence of positive reals, then show that: (a) for every positive integer $n$ we have $\sqrt{\sum^n_{i=1}{x_i^2}} \leq \sum^n_{i=1}\frac{x_i}{\sqrt{i}}$. (b) there is a constant C for which we have $\sum^{\infty}_{k=1}\frac{1}{\sqrt{k}}\sqrt{\sum^{\infty}_{i=k}x_i^2} \le C\sum^{\infty}_{i=1}x_i$.

For two rational numbers $r,s$ we say:$$r\mid s$$whenever there exists $k\in\mathbb{Z}$ such that:$$s=kr$$ ${(a_n)}_{n\in\mathbb{N}}$ is an increasing sequence of pairwise coprime natural numbers and ${(b_n)}_{n\in\mathbb{N}}$ is a sequence of distinct natural numbers. Assume that for all $n\in\mathbb{N}$ we have: $$\sum_{i=1}^{n}\frac{1}{a_i}\mid\sum_{i=1}^{n}\frac{1}{b_i}$$ Prove that [b]for all[/b] $n\in\mathbb{N}$ we have: $a_n=b_n$.

Let $a_1=0$, $a_2=1$, and $a_{n+2}=a_{n+1}+a_n$ for all positive integers $n$. Show that there exists an increasing infinite arithmetic progression of integers, which has no number in common in the sequence $\{a_n\}_{n \ge 0}$.

Let $k\geqslant 2$ be an integer. Consider the sequence $(x_n)_{n\geqslant 1}$ defined by $x_1=a>0$ and $x_{n+1}=x_n+\lfloor k/x_n\rfloor$ for $n\geqslant 1.$ Prove that the sequence is convergent and determine its limit.

Given is a number $a$ with 0 $\le \alpha \le \pi$. A sequence $c_0,c_1, c_2,...$ is defined as $$c_0=\cos \alpha$$ $$C_{n+1}=\sqrt{\frac{1+c_n}{2}} \,\, for \,\,\, n=0,1,2,...$$ Calculate $\lim_{n\to \infty}2^{2n+1}(1-c_n)$

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

A four-term sequence is formed by adding each term of a four-term arithmetic sequence of positive integers to the corresponding term of a four-term geometric sequence of positive integers. The first three terms of the resulting four-term sequence are 57, 60, and 91. What is the fourth term of this sequence? $\textbf{(A) }190\qquad\textbf{(B) }194\qquad\textbf{(C) }198\qquad\textbf{(D) }202\qquad\textbf{(E) }206$

Let $f(x)$ be a real-valued function, defined for $-1<x<1$ for which $f'(0)$ exists. Let $(a_n) , (b_n)$ be two sequences such that $-1 <a_n <0 <b_n <1$ for all $n$ and $\lim_{n \to \infty } a_n = 0 =\lim_{n \to \infty} b_n.$ Prove that $$ \lim_{n \to \infty} \frac{ f(b_n )- f(a_n ) }{b_n -a_n} =f'(0).$$

A positive integer $n$ is called [i]naughty[/i] if it can be written in the form $n=a^b+b$ with integers $a,b \geq 2$. Is there a sequence of $102$ consecutive positive integers such that exactly $100$ of those numbers are naughty?

Welcome to the [b]USAYNO[/b], where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer $n$ problems and get them [b]all[/b] correct, you will receive $\max(0, (n-1)(n-2))$ points. If any of them are wrong (or you leave them all blank), you will receive $0$ points. Your answer should be a six-character string containing 'Y' (for yes), 'N' (for no), or 'B' (for blank). For instance if you think 1, 2, and 6 are 'yes' and 3 and 4 are 'no', you should answer YYNNBY (and receive $12$ points if all five answers are correct, 0 points if any are wrong). (a) $a,b,c,d,A,B,C,$ and $D$ are positive real numbers such that $\frac{a}{b} > \frac{A}{B}$ and $\frac{c}{d} > \frac{C}{D}$. Is it necessarily true that $\frac{a+c}{b+d} > \frac{A+C}{B+D}$? (b) Do there exist irrational numbers $\alpha$ and $\beta$ such that the sequence $\lfloor\alpha\rfloor+\lfloor\beta\rfloor, \lfloor2\alpha\rfloor+\lfloor2\beta\rfloor, \lfloor3\alpha\rfloor+\lfloor3\beta\rfloor, \dots$ is arithmetic? (c) For any set of primes $\mathbb{P}$, let $S_\mathbb{P}$ denote the set of integers whose prime divisors all lie in $\mathbb{P}$. For instance $S_{\{2,3\}}=\{2^a3^b \; | \; a,b\ge 0\}=\{1,2,3,4,6,8,9,12,\dots\}$. Does there exist a finite set of primes $\mathbb{P}$ and integer polynomials $P$ and $Q$ such that $\gcd(P(x), Q(y))\in S_\mathbb{P}$ for all $x,y$? (d) A function $f$ is called [b]P-recursive[/b] if there exists a positive integer $m$ and real polynomials $p_0(n), p_1(n), \dots, p_m(n)$[color = red], not all zero,[/color] satisfying \[p_m(n)f(n+m)=p_{m-1}(n)f(n+m-1)+\dots+p_0(n)f(n)\] for all $n$. Does there exist a P-recursive function $f$ satisfying $\lim_{n\to\infty} \frac{f(n)}{n^{\sqrt{2}}}=1$? (e) Does there exist a [b]nonpolynomial[/b] function $f: \mathbb{Z}\to\mathbb{Z}$ such that $a-b$ divides $f(a)-f(b)$ for all integers $a\neq b$? (f) Do there exist periodic functions $f, g:\mathbb{R}\to\mathbb{R}$ such that $f(x)+g(x)=x$ for all $x$? [color = red]A clarification was issued for problem 33(d) during the test. I have included it above.[/color]