Proof the Skewes’ number is not an integer using lattice points and tangent line

Skewes’ number was discovered in 1933 by South African mathematician Stanley Skewes as upper bound for the first sign change of the difference π (x) − li(x). Whether a Skewes’ number is an integer is an open problem of Number Theory. Assuming Schanuel’s conjecture, it can be shown that Skewes’ number is transcendental. In our paper we have chosen a different approach to prove Skewes’ number is an integer, using lattice points and tangent line. In the paper we acquaint the reader also with prime numbers and their use in RSA coding, we present the primary algorithms Lehmann test and Rabin-Miller test for determining the prime numbers, we introduce the Prime Number Theorem and define the prime-counting function and logarithmic integral function and show their relation.

Numerical analysis approach to twin primes conjecture

The purpose of this paper is to demonstrate how the modified Sieve of Eratosthenes is used to have an approach to twin prime conjecture. If the Sieve is used in its basic form, it does not produce anything new. If it is used through the numerical analysis method explained in this paper, we obtain a specific counting of twin primes. This counting is based on the false assumption that distribution of primes follows punctually the Logarithmic Integral function denoted as Li(x) (see [5] and [10], pp. 174–176). It may be a starting point for future research based on this numerical analysis method technique that can be used in other mathematical branches.

Definite Integral of Power and Algebraic Functions in terms of the Lerch Function

Bierens de haan (1867) evaluated a definite integral involving the cotangent function and this result was also listed in Gradshteyn and Ryzhik (2007). The objective of this present note is to use this integral along with Cauchy's integral formula to derive a definite logarithmic integral in terms of the Lerch function. We will use this integral formula to produce a table of known and new results in terms of special functions and thereby expanding the list of definite integrals in both text books.

The Elementary Proof of the Riemann's Hypothesis

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.

Operator Subadditivity of the 𝒟-Logarithmic Integral Transform for Positive Operators in Hilbert Spaces

For a continuous and positive function w (λ), λ> 0 and µ a positive measure on [0, ∞) we consider the following 𝒟-logarithmic integral transform 𝒟 ℒ o g ( w , μ ) ( T ) : = ∫ 0 ∞ w ( λ ) 1 n ( λ + T λ ) d μ ( λ ) , \mathcal{D}\mathcal{L}og\left( {w,\mu } \right)\left( T \right): = \int_0^\infty {w\left( \lambda \right)1{\rm{n}}\left( {{{\lambda + T} \over \lambda }} \right)d\mu \left( \lambda \right),} where the integral is assumed to exist for T a positive operator on a complex Hilbert space H. We show among others that, if A, B > 0 with BA + AB ≥ 0, then 𝒟 ℒ o g ( w , μ ) ( A ) + 𝒟 ℒ o g ( w , μ ) ( B ) ≥ 𝒟 ℒ o g ( w , μ ) ( A + B ) . \mathcal{D}\mathcal{L}og\left( {w,\mu } \right)\left( A \right) + \mathcal{D}\mathcal{L}og\left( {w,\mu } \right)\left( B \right) \ge \mathcal{D}\mathcal{L}og\left( {w,\mu } \right)\left( {A + B} \right). In particular we have 1 6 π 2 + di log ( A + B ) ≥ di log ( A ) + di log ( B ) , {1 \over 6}{\pi ^2} + {\rm{di}}\log \left( {A + B} \right) \ge {\rm{di}}\log \left( A \right) + {\rm{di}}\log \left( B \right), where the dilogarithmic function dilog : [0, ∞) → ℝ is defined by di log ( t ) : = ∫ 1 t 1 n s 1 - s d s , t ≥ 0. {\rm{di}}\log \left( t \right): = \int_1^t {{{1ns} \over {1 - s}}ds,} \,\,\,\,t \ge 0. Some examples for integral transform 𝒟Log (·, ·) related to the operator monotone functions are also provided.

The Elementary Proof of the Riemann's Hypothesis

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.

Generalizations and applications of Young’s integral inequality by higher order derivatives

In the paper, the authors generalize Young’s integral inequality via Taylor’s theorems in terms of higher order derivatives and their norms, and apply newly-established integral inequalities to estimate several concrete definite integrals, including a definite integral of a function which plays an indispensable role in differential geometry and has a connection with the Lah numbers in combinatorics, the exponential integral, and the logarithmic integral.