Found problems: 119
If $m,n\in\mathbb N_{\ge2}$, find the best constant $k\in\mathbb R$ for which
$$\sum_{j=2}^m\sum_{i=2}^n\frac1{i^j}<k$$
[i]Proposed by Dorin Mărghidanu[/i]
Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$
Let $k$ be a positive integer. Compute
$$\sum_{n_1=1}^\infty\sum_{n_2=1}^\infty\cdots\sum_{n_k=1}^\infty\frac1{n_1n_2\cdots n_k(n_1+n_2+\ldots+n_k+1)}.$$
Let $a(n)$ be the number of representations of the positive integer $n$ as an ordered sum of $1$'s and $2$'s. Let $b(n)$ be the number of representations of the positive integer $n$ as an ordered sum of integers greater than $1.$ Show that $a(n)=b(n+2)$ for each $n$.
Given that $a_1, a_2, \dots, a_{10}$ are positive real numbers, determine the smallest possible value of \[\sum \limits_{i = 1}^{10} \left\lfloor \frac{7a_i}{a_i+a_{i+1}}\right\rfloor\] where we define $a_{11} = a_1$.
[i]Proposed by Sutanay Bhattacharya[/i]
If $$\Omega_n=\sum \limits_{k=1}^n \left(\int \limits_{-\frac{1}{k}}^{\frac{1}{k}}(2x^{10} + 3x^8 + 1)\cos^{-1}(kx)dx\right)$$Then find $$\Omega=\lim \limits_{n\to \infty}\left(\Omega_n-\pi H_n\right)$$
Let $(b_{n})_{n\in \mathbb{N}}$ be a sequence of positive real numbers such that $b_{0}=1$,
$b_{n}=2+\sqrt{b_{n-1}}-2\sqrt{1+\sqrt{b_{n-1}}}$. Calculate
$$\sum_{n=1}^{\infty}b_{n}2^{n}.$$
Let $k$ be a positive even integer. Show that
$$\sum_{n=0}^{k/2}(-1)^n\binom{k+2}n\binom{2(k-n)+1}{k+1}=\frac{(k+1)(k+2)}2.$$
Given an integer $n\geq2$, let $x_1<x_2<\cdots<x_n$ and $y_1<y_2<\cdots<y_n$ be positive reals. Prove that for every value $C\in (-2,2)$ (by taking $y_{n+1}=y_1$) it holds that
$\hspace{122px}\sum_{i=1}^{n}\sqrt{x_i^2+Cx_iy_i+y_i^2}<\sum_{i=1}^{n}\sqrt{x_i^2+Cx_iy_{i+1}+y_{i+1}^2}$.
[i]Proposed by Mirko Petrusevski[/i]
A given natural number $N$ is being decomposed in a sum of some consecutive integers.
[b]a.)[/b] Find all such decompositions for $N=500.$
[b]b.)[/b] How many such decompositions does the number $N=2^{\alpha }3^{\beta }5^{\gamma }$ (where $\alpha ,$ $\beta $ and $\gamma $ are natural numbers) have? Which of these decompositions contain natural summands only?
[b]c.)[/b] Determine the number of such decompositions (= decompositions in a sum of consecutive integers; these integers are not necessarily natural) for an arbitrary natural $N.$
[b]Note by Darij:[/b] The $0$ is not considered as a natural number.
Let $a_1,a_2,\cdots ,a_n$ be $n$ positive numbers such that $\sum \limits_{i=1}^n\sqrt{a_i}=\sqrt{n}$. Then$$\prod \limits_{i=1}^{n-1}\left(1+\frac{1}{a_i}\right)^{a_{i+1}}\left(1+\frac{1}{a_n}\right)^{a_1}\geq 1+\frac{n}{\sum \limits_{i=1}^na_i}$$
Let $B(n)$ be the number of ones in the base two expression for the positive integer $n.$ Determine whether
$$\exp \left( \sum_{n=1}^{\infty} \frac{ B(n)}{n(n+1)} \right)$$
is a rational number.
Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)
Let $\{x_n\}^\infty_{n=0}$ be the sequence such that $x_0=2$, $x_1=1$ and $x_{n+2}$ is the remainder of the number $x_{n+1}+x_n$ divided by $7$. Prove that $x_n$ is the remainder of the number
$$4^n\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}2\binom n{2k}5^k$$
The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$.
[i]Proposed by Mariusz Skalba, Poland[/i]
Let $x_1,x_2,\ldots,x_{2001}$ be positive numbers such that
$$x_i^2\ge x_1^2+\frac{x_2^2}{2^3}+\frac{x_3^2}{3^3}+\ldots+\frac{x_{i-1}^2}{(i-1)^3}\enspace\text{for }2\le i\le2001.$$Prove that $\sum_{i=2}^{2001}\frac{x_i}{x_1+x_2+\ldots+x_{i-1}}>1.999$.
Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?
Find the greatest integer less than or equal to $\sum_{k=1}^{2^{1983}} k^{\frac{1}{1983} -1}.$
Let $(a_n)$ be defined by $a_1=a_2=1$ and $a_n=a_{n-1}+a_{n-2}$ for $n>2$. Compute the sum $\frac{a_1}2+\frac{a_2}{2^2}+\frac{a_3}{2^3}+\ldots$.
Let $n \in \mathbb{N}$, $n \geq 2$, $a_1, a_2, \cdots , a_n \in \mathbb{R}$ and $a_n = max \{a_1, a_2,\cdots , a_n\}$
[list=1]
[*]If $t_k$, $t'_k \in \mathbb{R}$, $k \in \{1, 2,\cdots , n\}$ , $t_k \leq t'_k$, for any $k \in \{1, 2, \cdots, n - 1\}$ and $$\sum \limits_{k=1}^nt_k=\sum \limits_{k=1}^nt'_k$$Prove that $$\sum \limits_{k=1}^nt_ka_k\geq \sum \limits_{k=1}^nt'_ka_k$$
[*] If $b_k$, $c_k \in \mathbb{R}^*_+$, $k \in \{1, 2,\cdots , n\}$ , $b_k \leq c_k$ for any $k \in \{1, 2,\cdots, k - 1\}$ and $$b_1b_2\cdots b_n=c_1c_2\cdots c_n$$Prove that $$\prod \limits_{k=1}^n b_k^{a_k}\geq \prod \limits_{k=1}^nc_k^{a_k}$$
[/list]
Each of the numbers $x_1, x_2, \ldots, x_{101}$ is $\pm 1$. What is the smallest positive value of $\sum_{1\leq i <
j \leq 101} x_i x_j$ ?
Let $n$ be the product of the first $10$ primes, and let
$$S=\sum_{xy\mid n} \varphi(x) \cdot y,$$
where $\varphi(x)$ denotes the number of positive integers less than or equal to $x$ that are relatively prime to $x$, and the sum is taken over ordered pairs $(x, y)$ of positive integers for which $xy$ divides $n$. Compute $\tfrac{S}{n}.$
Let $a_1,a_2,\ldots,a_n$ be positive real numbers. Denote
$$s=\sum_{k=1}^na_k\text{ and }s'=\sum_{k=1}^na_k^{1-\frac1k}.$$
(a) Let $\lambda>1$ be a real number. Show that $s'<\lambda s+\frac\lambda{\lambda-1}$.
(b) Deduce that $\sqrt{s'}<\sqrt s+1$.
Express
$$\sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{m^2 n +m n^2 +2mn }$$
as a rational number.
Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \]
cannot be divided by $5$.