Euler-Mascheroni constant
[34/62%]For a positive integer, let denote the partial sum of the harmonic series
Let be an integer. Prove that
where is the natural logarithm of , and is a constant.
Prove that the sequence
converges. Consequently, there is a formula
where is called Euler's constant, and as .
Find
From the inequalities it follows that
From this, prove the equality:
Here is a constant called Euler's constant, and as .
Using the previous result, prove the equality:
Prove Catalan's identity
and, using it, show that .
Prove the equalities:
where is Euler's constant, and and as .
Prove the equalities:
Prove that the sequence
has a limit (it is called Euler's constant).
Prove that
Having proved the convergence of the series , obtain the asymptotic formula , where is Euler's constant as .
Using one of the equalities
where as (see problem 16, prove that
Using the fact that the sum of the series equals , find the sums of the following series, obtained from the given one by rearranging its terms:
;
;
Prove that if the terms of the series are rearranged so that each group of consecutive positive terms is followed by a group of consecutive negative terms, then the sum of the resulting series equals
Let the series be obtained from the series by rearranging its terms so that the terms of like sign are arranged in the new series in decreasing order of their absolute values, and the ratio of the number of positive summands in to the number of negative summands in this sum has, as , a limit equal to . Prove that
Prove that , where is Euler's constant:
Prove that
The number is called Euler's constant.
The results of problems 2.8 and 2.9 play a large role in mathematical analysis. They will be used in the solution of many subsequent problems.
Refine the results of the two previous problems by proving that for all the following inequalities hold:
;
.
The following inequality gives even tighter bounds for !:
.
.
.
.
.
Compute the integral .
The answer is expressed in terms of Euler's constant (see Problem II.2.8).
Compute the integral .
The answer is expressed in terms of Euler's constant (see Problem II.2.8).
Compute the integrals:
;
.
The answer is expressed in terms of Euler's constant (see Problem II.2.8).
Compute the integrals:
;
.
The answer is expressed in terms of Euler's constant (see Problem II.2.8).
Prove that as
The expression
is bounded for increasing ; is Euler's constant [solution 18].
As it is well known [cf. E. T. Whittaker and G. N. Watson, p. 246] Euler's constant can be written as an integral
Show that
Let denote the number of divisors of . Then
is Euler's constant.
We may regard the relation
(Problem 18) as the definition of Euler's constant . Derive hence that
The definition of given in Problem 19.1 is convenient. Yet it would be desirable to approximate by rational numbers, to represent as the sum of a series whose terms are rational. Prove that the following series fulfills this desideratum:
Take the terms in the order as you read a book: from left to right and from top to bottom. This is essential since the series is not absolutely convergent. Its terms are non increasing in absolute value.
Put . Prove that
exists. (The limit, often denoted by , is called Euler's constant. Its numerical value is It is not known whether is rational or not).
Roughly how large must be so that satisfies ?
Take , and , and derive , where is Euler's constant.