0
votes
1answer
148 views

upper bound on infinite series by exponentials

I'm interested in upper bounding the following infinite series by exponential functions for x>1 (I would be fine with x>2 as well). \begin{eqnarray*} \sum_{n=1}^{\infty}e^{-\frac{x^2n^2}{2}}\\ ...
2
votes
0answers
184 views

Proving that an increasing iterative sequence increases at a decreasing rate

In this question Proving a sequence of integrals increases (iterated minimax distributions) Pietro Majer proved that $$\int_0^1F_n(x) dx \leq \int_0^1F_{n+1}(x) dx$$ when $$F_n(x) = ...
2
votes
2answers
703 views

Ratio of Sequences Sum Inequality

I have two real sequences $a_1,a_2,\dots,a_n$ and $b_1, b_2, \dots, b_n$, with $a_i > 0$ and $1 \leq b_i < n$, and I'm looking for a lower bound of $\sum_i \frac{a_i}{b_i}$ in terms of $\sum_i ...
4
votes
2answers
593 views

Proving a sequence of integrals increases (iterated minimax distributions)

I am trying to show that $$\int_0^1F_n(x) dx \leq \int_0^1F_{n+1}(x) dx$$ when $$F_n(x) = (1-(1-F_{n-1}(x))^c)^c$$ and $F_0(x) = x$ and $n$ and $c$ are integers, $n\geq 1$ and $c \geq 2$ Note that ...
4
votes
2answers
587 views

Asymptotics for the number of ways to sum primes such that the sum is <= n

Hello! Given $n$ I would like to find a lower bound (or a tight asymptotics) for the number $s(n)$ of solutions to $$ p_1 + \ldots + p_k \leq n \quad (1) $$ where $k$ is arbitrary and $p_1 \leq ...
0
votes
0answers
202 views

Square variation norm and non-negative, non-increasing sequences

I am trying to understand the properties of square variation, namely, the possibility of preserving it under certain operations. I am following Albiac & Kalton's book: Let $J$ stand for the usual ...
11
votes
5answers
2k views

Upper bounds for the sum of primes <= n

Let $s(n)$ denote the sum of primes less than or equal to n. Clearly, $s(n)$ is bounded from above by the sum of the first $n/2$ odd integers $+1$. $s(n)$ is also bounded by the sum of the first $n$ ...
1
vote
1answer
389 views

Coefficient bounds of an inequality

Hello, Given positive integers $k$ and $n$. Are there upper bounds on coefficients $A$ and $B$ such that they depends only on $k$ (eg., $2 k^k$) and for all non-negative integer sequences ...