Found problems: 373
For $k\ge 1$, define $a_k=2^k$. Let $$S=\sum_{k=1}^{\infty}\cos^{-1}\left(\frac{2a_k^2-6a_k+5}{\sqrt{(a_k^2-4a_k+5)(4a_k^2-8a_k+5)}}\right).$$ Compute $\lfloor 100S\rfloor$.
Determine, with proof, the rational number $\dfrac{m}{n}$ that equals
\[\tfrac{1}{1\sqrt2+2\sqrt1}+\tfrac{1}{2\sqrt3+3\sqrt2}+\tfrac{1}{3\sqrt4+4\sqrt3}+\ldots+\tfrac{1}{4012008\sqrt{4012009}+4012009\sqrt{4012008}}\]
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$.
Prove that
$$\sum\limits_{n = 1}^{\infty}\frac{1}{\sqrt{n}\left(n+1\right)} < 2.$$
Proposed by Ivan Krijan, University of Zagreb
Express
$$\sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{m^2 n +m n^2 +2mn }$$
as a rational number.
What is the value of the product$$\left(1+\frac{1}{1}\right)\cdot\left(1+\frac{1}{2}\right)\cdot\left(1+\frac{1}{3}\right)\cdot\left(1+\frac{1}{4}\right)\cdot\left(1+\frac{1}{5}\right)\cdot\left(1+\frac{1}{6}\right)?$$
$\textbf{(A) }\frac{7}{6}\qquad\textbf{(B) }\frac{4}{3}\qquad\textbf{(C) }\frac{7}{2}\qquad\textbf{(D) }7\qquad\textbf{(E) }8$
Evaluate
\[\frac{1/2}{1+\sqrt2}+\frac{1/4}{1+\sqrt[4]2}+\frac{1/8}{1+\sqrt[8]2}+\frac{1/16}{1+\sqrt[16]2}+\cdots\]
[i]Proposed by Ethan Tan[/i]
Princess Pear has $100$ jesters with heights $1, 2, \dots, 100$ inches. On day $n$ with $1 \leq n \leq 100$, Princess Pear holds a court with all her jesters with height at most $n$ inches, and she receives two candied cherries from every group of $6$ jesters with a median height of $n - 50$ inches. A jester can be part of multiple groups.
On day $101$, Princess Pear summons all $100$ jesters to court one final time. Every group of $6$ jesters with a median height of 50.5 inches presents one more candied cherry to the Princess. How many candied cherries does Princess Pear receive in total?
Please provide a numerical answer (with justification).
The numbers $\frac{1}{1}, \frac{1}{2}, \cdots , \frac{1}{2012}$ are written on the blackboard. Aïcha chooses any two numbers from the blackboard, say $x$ and $y$, erases them and she writes instead the number $x + y + xy$. She continues to do this until only one number is left on the board. What are the possible values of the final number?
If $n$ is an integer such that $2 \leq n \leq 2017$, for how many values of $n$ is $\left(1 + \frac{1}{2}\right)\left(1 + \frac{1}{3}\right)\cdots\left(1 + \frac{1}{n}\right)$ equal to a positive integer?
$\mathrm{(A) \ } 0 \qquad \mathrm{(B) \ } 1 \qquad \mathrm {(C) \ } 1007 \qquad \mathrm{(D) \ } 1008 \qquad \mathrm{(E) \ } 2016$
For an integer $n > 0$, denote by $\mathcal F(n)$ the set of integers $m > 0$ for which the polynomial $p(x) = x^2 + mx + n$ has an integer root. [list=a] [*] Let $S$ denote the set of integers $n > 0$ for which $\mathcal F(n)$ contains two consecutive integers. Show that $S$ is infinite but \[ \sum_{n \in S} \frac 1n \le 1. \] [*] Prove that there are infinitely many positive integers $n$ such that $\mathcal F(n)$ contains three consecutive integers. [/list]
[i]Ivan Borsenco[/i]
For $0<x<1,$ express $$\sum_{n=0}^{\infty} \frac{x^{2^n}}{1-x^{2^{n+1}}}$$ as a rational function of $x.$
Find all integers $n \geq 3$ such that among any $n$ positive real numbers $a_1, a_2, \hdots, a_n$ with $\text{max}(a_1,a_2,\hdots,a_n) \leq n \cdot \text{min}(a_1,a_2,\hdots,a_n)$, there exist three that are the side lengths of an acute triangle.
The sum
\[ \sum_{k=0}^{\infty} \frac{2^{k}}{5^{2^{k}}+1}\]
can be written in the form $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
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.\]
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\geq2$ be a positive integer, with divisors $1=d_1<d_2<\,\ldots<d_k=n$. Prove that $d_1d_2+d_2d_3+\,\ldots\,+d_{k-1}d_k$ is always less than $n^2$, and determine when it is a divisor of $n^2$.
Show that $ \frac{\frac{1}{1\cdot 2} +\frac{1}{3\cdot 4}+\cdots +\frac1{1997\cdot 1998}}{\frac{2}{1000\cdot 1998} +\frac{1}{1001\cdot 1997}} $ is an integer number.
[i]Bogdan Enescu[/i]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Real numbers $x_1, x_2, x_3, \cdots , x_n$ satisfy $x_1^2 + x_2^2 + x_3^2 + \cdots + x_n^2 = 1$. Show that \[ \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 + x_2^2 + x_3^2 + \cdots + x_n^2} < \sqrt{\frac n2} . \]
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$ and $B$ the series: $$A=\sum \limits_{n=1}^{\infty}\frac{C_{2n}^1}{C_{2n}^0+C_{2n}^1+\cdots +C_{2n}^{2n}},\ B=\sum \limits_{n=1}^{\infty}\frac{\Gamma \left(n+\frac{1}{2}\right) }{\Gamma \left(n+\frac{5}{2}\right)}$$Study if $\frac{A}{B}$ is irrational number.
Evaluate the infinite product
\[
\prod_{k = 2}^{\infty} \left( 1 - 4 \sin^2 \frac{\pi}{3\cdot 2^{k}} \right) .
\]
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}.
\]
We say a finite set $S$ of points in the plane is [i]very[/i] if for every point $X$ in $S$, there exists an inversion with center $X$ mapping every point in $S$ other than $X$ to another point in $S$ (possibly the same point).
(a) Fix an integer $n$. Prove that if $n \ge 2$, then any line segment $\overline{AB}$ contains a unique very set $S$ of size $n$ such that $A, B \in S$.
(b) Find the largest possible size of a very set not contained in any line.
(Here, an [i]inversion[/i] with center $O$ and radius $r$ sends every point $P$ other than $O$ to the point $P'$ along ray $OP$ such that $OP\cdot OP' = r^2$.)
[i]Proposed by Sammy Luo[/i]