Inequality Of The Sum Of A Series

In summary, the inequality of the sum of a series is a mathematical concept that states the sum of a series of numbers cannot exceed the sum of the same series with its terms rearranged. It is important because it helps us understand the behavior of series and has many real-world applications. The inequality can be proven using mathematical induction and applies to all types of series. It is closely related to the concepts of convergence and divergence.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Prove \(\displaystyle \frac{10}{\sqrt{11^{11}}}+\frac{11}{\sqrt{12^{12}}}+\cdots+\frac{2015}{\sqrt{2016^{2016}}}\gt \frac{1}{10!}-\frac{1}{2016!}\)
 
Mathematics news on Phys.org
  • #2
Hi anemone,

Here is my solution.

Let $n\in \{11,\ldots, 2016\}$. Then $n!^2$ is the product of $k(n+1-k)$ as $k$ ranges from $1$ to $n$. Consider the inequality $$xy\ge x + y - 1 \qquad (x,y\in \Bbb N)$$ which follows from the inequality $(x - 1)(y - 1) \ge 0$. Since equality holds above if and only if $x = 1$ or $y = 1$, we find that $k(n+1-k) > k + (n+1-k) - 1 = n$ for $1 < k < n$. Therefore $n!^2 > n^n$, or $\sqrt{n^n} < n!$. I now estimate

$$\frac{10}{\sqrt{11^{11}}} + \frac{11}{\sqrt{12^{12}}} + \cdots + \frac{2015}{\sqrt{2016^{2016}}}$$
$$=\sum_{n = 11}^{2016} \frac{n-1}{\sqrt{n^n}} > \sum_{n = 11}^{2016} \frac{n-1}{n!} = \sum_{n = 1}^{2016} \left(\frac{1}{(n-1)!} - \frac{1}{n!}\right),$$

which telescopes to $$\frac{1}{10!} - \frac{1}{2016!}.$$
 
  • #3
Euge said:
Hi anemone,

Here is my solution.

Let $n\in \{11,\ldots, 2016\}$. Then $n!^2$ is the product of $k(n+1-k)$ as $k$ ranges from $1$ to $n$. Consider the inequality $$xy\ge x + y - 1 \qquad (x,y\in \Bbb N)$$ which follows from the inequality $(x - 1)(y - 1) \ge 0$. Since the above equality holds if and only if $x = 1$ or $y = 1$, we find that $k(n+1-k) > k + (n+1-k) - 1 = n$ for $1 < k < n$. Therefore $n!^2 > n^n$, or $\sqrt{n^n} < n!$. I now estimate

$$\frac{10}{\sqrt{11^{11}}} + \frac{11}{\sqrt{12^{12}}} + \cdots + \frac{2015}{\sqrt{2016^{2016}}}$$
$$=\sum_{n = 11}^{2016} \frac{n-1}{\sqrt{n^n}} > \sum_{n = 11}^{2016} \frac{n-1}{n!} = \sum_{n = 1}^{2016} \left(\frac{1}{(n-1)!} - \frac{1}{n!}\right),$$

which telescopes to $$\frac{1}{10!} - \frac{1}{2016!}.$$

Spectacular, Euge! And thanks for participating!(Cool)
 
  • #4
Euge said:
Hi anemone,

Here is my solution.

Let $n\in \{11,\ldots, 2016\}$. Then $n!^2$ is the product of $k(n+1-k)$ as $k$ ranges from $1$ to $n$. Consider the inequality $$xy\ge x + y - 1 \qquad (x,y\in \Bbb N)$$ which follows from the inequality $(x - 1)(y - 1) \ge 0$. Since the above equality holds if and only if $x = 1$ or $y = 1$, we find that $k(n+1-k) > k + (n+1-k) - 1 = n$ for $1 < k < n$. Therefore $n!^2 > n^n$, or $\sqrt{n^n} < n!$. I now estimate

$$\frac{10}{\sqrt{11^{11}}} + \frac{11}{\sqrt{12^{12}}} + \cdots + \frac{2015}{\sqrt{2016^{2016}}}$$
$$=\sum_{n = 11}^{2016} \frac{n-1}{\sqrt{n^n}} > \sum_{n = 11}^{2016} \frac{n-1}{n!} = \sum_{n = 1}^{2016} \left(\frac{1}{(n-1)!} - \frac{1}{n!}\right),$$

which telescopes to $$\frac{1}{10!} - \frac{1}{2016!}.$$
marvelous !
 

FAQ: Inequality Of The Sum Of A Series

What is the "inequality of the sum of a series"?

The inequality of the sum of a series is a mathematical concept that states that the sum of a series of numbers cannot exceed the sum of the same series with its terms rearranged. In other words, the order in which the terms are added affects the overall sum.

Why is the inequality of the sum of a series important?

This inequality is important because it helps us understand the behavior of series. It allows us to determine the maximum and minimum possible values of a series, which can be useful in a variety of real-world applications such as financial calculations and data analysis.

How is the inequality of the sum of a series proven?

The inequality of the sum of a series can be proven using mathematical induction. This method involves showing that the inequality holds for the first few terms of the series and then proving that if it holds for a particular term, it also holds for the next term. This process is repeated until it can be shown that the inequality holds for all terms in the series.

Can the inequality of the sum of a series be applied to all types of series?

Yes, the inequality of the sum of a series can be applied to all types of series, including finite and infinite series, as long as the terms in the series are real numbers. It is a fundamental concept in mathematics and has many applications in various fields.

How does the inequality of the sum of a series relate to convergence and divergence?

The inequality of the sum of a series is closely related to the concepts of convergence and divergence. A series that satisfies this inequality is said to be absolutely convergent, meaning that its sum is independent of the order of the terms. On the other hand, if a series does not satisfy this inequality, it may be conditionally convergent or divergent.

Similar threads

Replies
2
Views
1K
Replies
3
Views
1K
Replies
2
Views
1K
Replies
3
Views
1K
Replies
7
Views
2K
Replies
13
Views
2K
Replies
2
Views
2K
Back
Top