Volume 18 | Number 1 | Year 2015 | Article Id. IJMTT-V18P508 | DOI : https://doi.org/10.14445/22315373/IJMTT-V18P508
In this paper we will present some inequality on some subsequence of the sequence of prime numbers such that ≡ 1(mod2k+1), where k is positive integer. We prove that for every positive integer k there exists a positive constant real number Kk, such that for every real number λ>Kk, there exists a natural number nλ, such that for every natural number n>nλ, it is true the inequality Π Pki/Pki-2k<λPkn/2k.n, where Pkn is the n-th prime number≡ 1(mod 2k-1) . The constant Kk is equal with e2k.M(2k+1,1)+22k.σk, where M(2k+1,1)is the Merten’s constant and σk is the sum of the convergent series ΣpΞ1(mod2k+1) 1/p(p-2k). We find approximate values of constant k1 and k2.
[1] Adili A, Milo E, “An inequality with the sequence of prime numbers”, International Journal of Mathematics Trends and Technology, Volume 15 Number 1, November 2014, pp 45-48.
[2] Tom M. Apostol, “An asymptotic formula for the partial sums Σp≤x(1/p)”, Introduction to Analytic Number Theory, pp 156, Springer-Verlag, New York Heidelberg Berlin 1976.
[3] A. Languasco, A. Zaccagnini, A note of Merten’s formula for arithmetic progressions, Jurnal of Number Theory, Volume 127, Issue 1, November 2007, pp 37-46.
[4] Tom M. Apostol, “Distribution of prime numbers in arithmetic progressions”, Introduction to Analytic Number Theory, pp 154, Springer-Verlag, New York Heidelberg Berlin 1976.
[5] A. Languasco, A. Zaccagnini, Computation of the Mertens constant for the sum, March 2009, pp 3, 7.
Arto Adili, Artur Baxhaku, "Some Inequality on Some Subsequence of the Sequence of Prime Numbers," International Journal of Mathematics Trends and Technology (IJMTT), vol. 18, no. 1, pp. 44-47, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V18P508