Found problems: 373
Let $n\ge m\ge 1$ be integers. Prove that
\[\sum_{k=m}^n \left (\frac 1{k^2}+\frac 1{k^3}\right) \ge m\cdot \left(\sum_{k=m}^n \frac 1{k^2}\right)^2.\]
[i]Raymond Feng and Luke Robitaille[/i]
Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$
What is the greatest integer not exceeding the sum $\sum^{1599}_{n=1} \dfrac{1}{\sqrt{n}}$?
The sequence $ (a_n)$ satisfies $ a_1 \equal{} 1$ and $ \displaystyle 5^{(a_{n\plus{}1}\minus{}a_n)} \minus{} 1 \equal{} \frac{1}{n\plus{}\frac{2}{3}}$ for $ n \geq 1$. Let $ k$ be the least integer greater than $ 1$ for which $ a_k$ is an integer. Find $ k$.
Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of
\[
\left|1-\sum_{i \in X} a_{i}\right|
\]
is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that
\[
\sum_{i \in X} b_{i}=1.
\]
$100$ numbers $1$, $1/2$, $1/3$, $...$, $1/100$ are written on the blackboard. One may delete two arbitrary numbers $a$ and $b$ among them and replace them by the number $a + b + ab$. After $99$ such operations only one number is left. What is this final number?
(D. Fomin, Leningrad)
Let $a_1,a_2,\dots,a_n$ be positive real numbers whose product is $1$. Show that the sum \[\textstyle\frac{a_1}{1+a_1}+\frac{a_2}{(1+a_1)(1+a_2)}+\frac{a_3}{(1+a_1)(1+a_2)(1+a_3)}+\cdots+\frac{a_n}{(1+a_1)(1+a_2)\cdots(1+a_n)}\] is greater than or equal to $\frac{2^n-1}{2^n}$.
Prove that for all natural numbers $n$, \[ \sum_{k=1}^{n^2} \left\{ \sqrt{k} \right\} \le \frac{n^2-1}{2}. \] Here, $\{x\}$ denotes the fractional part of $x$.
Let $x_1,x_2,\ldots,x_n$ be arbitrary real numbers. Prove the inequality
\[
\frac{x_1}{1+x_1^2} + \frac{x_2}{1+x_1^2 + x_2^2} + \cdots +
\frac{x_n}{1 + x_1^2 + \cdots + x_n^2} < \sqrt{n}.
\]
Choose positive integers $b_1, b_2, \dotsc$ satisfying
\[1=\frac{b_1}{1^2} > \frac{b_2}{2^2} > \frac{b_3}{3^2} > \frac{b_4}{4^2} > \dotsb\]
and let $r$ denote the largest real number satisfying $\tfrac{b_n}{n^2} \geq r$ for all positive integers $n$. What are the possible values of $r$ across all possible choices of the sequence $(b_n)$?
[i]Carl Schildkraut and Milan Haiman[/i]
Let $a_1,a_2,\ldots$ be an infinite sequence of real numbers, for which there exists a real number $c$ with $0\leq a_i\leq c$ for all $i$, such that \[\left\lvert a_i-a_j \right\rvert\geq \frac{1}{i+j} \quad \text{for all }i,\ j \text{ with } i \neq j. \] Prove that $c\geq1$.
For any nonempty set $\,S\,$ of numbers, let $\,\sigma(S)\,$ and $\,\pi(S)\,$ denote the sum and product, respectively, of the elements of $\,S\,$. Prove that
\[ \sum \frac{\sigma(S)}{\pi(S)} = (n^2 + 2n) - \left(1 + \frac{1}{2} + \frac{1}{3} + \cdots + \frac{1}{n} \right) (n+1), \]
where ``$\Sigma$'' denotes a sum involving all nonempty subsets $S$ of $\{1,2,3, \ldots,n\}$.
Prove that for every natural number $n$, and for every real number $x \neq \frac{k\pi}{2^t}$ ($t=0,1, \dots, n$; $k$ any integer) \[ \frac{1}{\sin{2x}}+\frac{1}{\sin{4x}}+\dots+\frac{1}{\sin{2^nx}}=\cot{x}-\cot{2^nx} \]
Evaluate the double series
$$\sum_{j=0}^{\infty} \sum_{k=0}^{\infty} 2^{-3k -j -(k+j)^{2}}.$$
Let $x>1$ ,$n$ be positive integer. Prove that$$\sum_{k=1}^{n}\frac{\{kx \}}{[kx]}<\sum_{k=1}^{n}\frac{1}{2k-1}$$
Where $[kx ]$ be the integer part of $kx$ ,$\{kx \}$ be the decimal part of $kx$.
There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < \dots < a_k$ such that \[\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + \dots + 2^{a_k}.\] What is $k?$
$\textbf{(A) } 117 \qquad \textbf{(B) } 136 \qquad \textbf{(C) } 137 \qquad \textbf{(D) } 273 \qquad \textbf{(E) } 306$
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
Let $ f(n)$ be defined for $ n \in \mathbb{N}$ by $ f(1)\equal{}2$ and $ f(n\plus{}1)\equal{}f(n)^2\minus{}f(n)\plus{}1$ for $ n \ge 1$. Prove that for all $ n >1:$
$ 1\minus{}\frac{1}{2^{2^{n\minus{}1}}}<\frac{1}{f(1)}\plus{}\frac{1}{f(2)}\plus{}...\plus{}\frac{1}{f(n)}<1\minus{}\frac{1}{2^{2^n}}$
Let $A_1A_2A_3\ldots A_n$ be a regular $n$-gon. Let $B_1$ and $B_{n-1}$ be the midpoints of its sides $A_1A_2$ and $A_{n-1}A_n$. Also, for every $i\in\left\{2,3,4,\ldots ,n-2\right\}$. Let $S$ be the point of intersection of the lines $A_1A_{i+1}$ and $A_nA_i$, and let $B_i$ be the point of intersection of the angle bisector bisector of the angle $\measuredangle A_iSA_{i+1}$ with the segment $A_iA_{i+1}$.
Prove that $\sum_{i=1}^{n-1} \measuredangle A_1B_iA_n=180^{\circ}$.
[i]Proposed by Dusan Dukic, Serbia and Montenegro[/i]
Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.
Suppose $f$ is a degree 42 polynomial such that for all integers $0\le i\le 42$,
$$f(i)+f(43+i)+f(2\cdot43+i)+\cdots+f(46\cdot43+i)=(-2)^i$$
Find $f(2021)-f(0)$.
[i]Proposed by Adam Bertelli[/i]
Let $p(x)$ be the monic cubic polynomial with roots $\sin^2(1^{\circ})$, $\sin^2(3^{\circ})$, and $\sin^2(9^{\circ})$. Suppose that $p\left(\frac{1}{4}\right)=\frac{\sin(a^{\circ})}{n\sin(b^{\circ})}$, where $0 <a,b \le 90$ and $a,b,n$ are positive integers. What is $a+b+n$?
[i]Proposed by Andrew Yuan[/i]
Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$
Prove that there are positive integers $a_1, a_2,\dots, a_{2020}$ such that
$$\dfrac{1}{a_1}+\dfrac{1}{2a_2}+\dfrac{1}{3a_3}+\dots+\dfrac{1}{2020a_{2020}}=1.$$
Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$