This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 837

For every pair of reals $0 < a < b < 1$, we define sequences $\{x_n\}_{n \ge 0}$ and $\{y_n\}_{n \ge 0}$ by $x_0 = 0$, $y_0 = 1$, and for each integer $n \ge 1$: \begin{align*} x_n & = (1 - a) x_{n - 1} + a y_{n - 1}, \\ y_n & = (1 - b) x_{n - 1} + b y_{n - 1}. \end{align*} The [i]supermean[/i] of $a$ and $b$ is the limit of $\{x_n\}$ as $n$ approaches infinity. Over all pairs of real numbers $(p, q)$ satisfying $\left (p - \textstyle\frac{1}{2} \right)^2 + \left (q - \textstyle\frac{1}{2} \right)^2 \le \left(\textstyle\frac{1}{10}\right)^2$, the minimum possible value of the supermean of $p$ and $q$ can be expressed as $\textstyle\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $100m + n$. [i]Proposed by Lewis Chen[/i]
Let $t(n)$ be the sum of the digits in the binary representation of a positive integer $n,$ and let $k \geq 2$ be an integer. [b]a.[/b] Show that there exists a sequence $(a_i)_{i=1}^{\infty}$ of integers such that $a_m \geq 3$ is an odd integer and $t(a_1a_2 \cdots a_m)=k$ for all $m \geq 1.$ [b]b.[/b] Show that there is an integer $N$ such that $t(3 \cdot 5 \cdots (2m+1))>k$ for all integers $m \geq N.$
Given a sequence $(x_n )$ such that $\lim_{n\to \infty} x_n - x_{n-2}=0,$ prove that $$\lim_{n\to \infty} \frac{x_n -x_{n-1}}{n}=0.$$
Let $C: y=\ln x$. For each positive integer $n$, denote by $A_n$ the area of the part enclosed by the line passing through two points $(n,\ \ln n),\ (n+1,\ \ln (n+1))$ and denote by $B_n$ that of the part enclosed by the tangent line at the point $(n,\ \ln n)$, $C$ and the line $x=n+1$. Let $g(x)=\ln (x+1)-\ln x$. (1) Express $A_n,\ B_n$ in terms of $n,\ g(n)$ respectively. (2) Find $\lim_{n\to\infty} n\{1-ng(n)\}$.
The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.
The function $f_n (x)\ (n=1,2,\cdots)$ is defined as follows. \[f_1 (x)=x,\ f_{n+1}(x)=2x^{n+1}-x^n+\frac{1}{2}\int_0^1 f_n(t)\ dt\ \ (n=1,2,\cdots)\] Evaluate \[\lim_{n\to\infty} f_n \left(1+\frac{1}{2n}\right)\]
Show that there exists the maximum value of the function $f(x,\ y)=(3xy+1)e^{-(x^2+y^2)}$ on $\mathbb{R}^2$, then find the value.
Let $ f:[0,1]\longrightarrow\mathbb{R}_+^* $ be a Riemann-integrable function. Calculate $ \lim_{n\to\infty}\left(-n+\sum_{i=1}^ne^{\frac{1}{n}\cdot f\left(\frac{i}{n}\right)}\right) . $
Find all real $\alpha,\beta$ such that the following limit exists and is finite: \[\lim_{x,y\rightarrow 0^{+}}\frac{x^{2\alpha}y^{2\beta}}{x^{2\alpha}+y^{3\beta}}\]
A function $f:[0,\infty)\to\mathbb R\setminus\{0\}$ is called [i]slowly changing[/i] if for any $t>1$ the limit $\lim_{x\to\infty}\frac{f(tx)}{f(x)}$ exists and is equal to $1$. Is it true that every slowly changing function has for sufficiently large $x$ a constant sign (i.e., is it true that for every slowly changing $f$ there exists an $N$ such that for every $x,y>N$ we have $f(x)f(y)>0$?)
Let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a continuous function having a primitive $ F $ having the property that $ f-F $ is positive globally. Calculate $ \lim_{x\to\infty } f(x) . $ [i]Florian Dumitrel[/i]
Consider a curve $C$ on the $x$-$y$ plane expressed by $x=\tan \theta ,\ y=\frac{1}{\cos \theta}\left (0\leq \theta <\frac{\pi}{2}\right)$. For a constant $t>0$, let the line $l$ pass through the point $P(t,\ 0)$ and is perpendicular to the $x$-axis,intersects with the curve $C$ at $Q$. Denote by $S_1$ the area of the figure bounded by the curve $C$, the $x$-axis, the $y$-axis and the line $l$, and denote by $S_2$ the area of $\triangle{OPQ}$. Find $\lim_{t\to\infty} \frac{S_1-S_2}{\ln t}.$
A sequence of polynomial $f_n(x)\ (n=0,1,2,\cdots)$ satisfies $f_0(x)=2,f_1(x)=x$, \[f_n(x)=xf_{n-1}(x)-f_{n-2}(x),\ (n=2,3,4,\cdots)\] Let $x_n\ (n\geqq 2)$ be the maximum real root of the equation $f_n(x)=0\ (|x|\leqq 2)$ Evaluate \[\lim_{n\to\infty} n^2 \int_{x_n}^2 f_n(x)dx\]
Let $x$, $y$, $z$ be positive reals satisfying $\left(x+y+z\right)^{3}=32xyz$ Find the minimum and the maximum of $P=\frac{x^{4}+y^{4}+z^{4}}{\left(x+y+z\right)^{4}}$
Let $f$ be a function such that \[f(x)=\frac{(x^2-2x+1) \sin \frac{1}{x-1}}{\sin \pi x}.\] Find the limit of $f$ in the point $x_0=1.$
How many integers $n$, satisfy $|n|<2020$ and the equation $11^3|n^3+3n^2-107n+1$ (A)$0$ (B)$101$ (C)$367$ (D)$368$
For every natural number $n$ let: $a_n=ln(1+2e+4e^4+\dots+2ne^{n^2})$. Find: \[ \displaystyle{\lim_{n \to \infty}\frac{a_n}{n^2}} \].
$a)$ Let $n$ a positive integer. Prove that $gcd(n, \lfloor n\sqrt{2} \rfloor)<\sqrt[4]{8}\sqrt{n}$. $b)$ Prove that there are infinitely many positive integers $n$ such that $gcd(n, \lfloor n\sqrt{2} \rfloor)>\sqrt[4]{7.99}\sqrt{n}$.
Find $ \lim_{n\to\infty}a_n$ where $ (a_n)_{n\ge1}$ is defined by $ a_n\equal{}\frac1{\sqrt{n^2\plus{}8n\minus{}1}}\plus{}\frac1{\sqrt{n^2\plus{}16n\minus{}1}}\plus{}\frac1{\sqrt{n^2\plus{}24n\minus{}1}}\plus{}\ldots\plus{}\frac1{\sqrt{9n^2\minus{}1}}$.
Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?
Original in Hungarian; translated with Google translate; polished by myself. Let $f: [0, \infty) \to [0, \infty)$ be a function that is linear between adjacent integers, and for $n = 0, 1, \dots$ satisfies $$f(n) = \begin{cases} 0, & \textrm{if }2\mid n,\\4^l + 1, & \textrm{if }2 \nmid n, 4^{l - 1} \leq n < 4^l(l = 1, 2, \dots).\end{cases}$$ Let $f^1(x) = f(x)$, and $f^k(x) = f(f^{k - 1}(x))$ for all integers $k \geq 2$. Determine the values of $\liminf\nolimits_{k\to\infty}f^k(x)$ and $\limsup\nolimits_{k\to\infty}f^k(x)$ for almost all $x \in [0, \infty)$ under Lebesgue measure. (Not sure whether the last sentence translates correctly; the original: Határozzuk meg Lebesgue majdnem minden $x\in [0, \infty)$-re a $\liminf\nolimits_{k\to\infty}f^k(x)$ és $\limsup\nolimits_{k\to\infty}f^k(x)$ értékét.)
Let be a sequence $ \left( x_n \right)_{n\ge 0} $ with $ x_0\in (0,1) $ and defined as $$ 2x_n=x_{n-1}+\sqrt{3-3x_{n-1}^2} . $$ Prove that this sequence is bounded and periodic. Moreover, find $ x_0 $ for which this sequence is convergent. [i]Ovidiu Țâțan[/i]
Find all functions $f$ from the set of real numbers to itself satisfying \[ f(x(1+y)) = f(x)(1 + f(y)) \] for all real numbers $x, y$.
Prove that for every $ \vartheta$, $ 0<\vartheta<1$, there exist a sequence $ \lambda_n$ of positive integers and a series $ \sum_{n=1}^{\infty} a_n$ such that (i)$ \lambda_{n+1}-\lambda_n > (\lambda_n)^{\vartheta}$, (ii) $ \lim_{r\rightarrow 1^-} \sum_{n=1}^{\infty} a_nr^{\lambda_n}$ exists, (iii) $ \sum _{n=1}^{\infty} a_n$ is divergent. [i]P. Turan[/i]
Let $(a_i)_{i\in \mathbb N}$ be a strictly increasing sequence of positive real numbers such that $\lim_{i \to \infty} a_i = +\infty$ and $a_{i+1}/a_i \leq 10$ for each $i$. Prove that for every positive integer $k$ there are infinitely many pairs $(i, j)$ with $10^k \leq a_i/a_j \leq 10^{k+1}.$