Proof the Skewes’ number is not an integer using lattice points and tangent line-Reference-Cited by-同舟云学术

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

Published:2021-12-01 Issue:2 Volume:17 Page:5-18
ISSN:1339-0015
Container-title:Journal of Applied Mathematics, Statistics and Informatics
language:en
Short-container-title:

Author:

Ďuriš V.¹,Šumný T.²,Lengyelfalusy T.³

Affiliation:

1. Constantine The Philosopher University in Nitra , Tr. A. Hlinku 1, 94901 Nitra , Slovakia

2. Štefan Moyses Primary School , Školská 608, Tesárske Mlyňany , Slovakia

3. DTI University , Sládkovičova 533/20, 018 41 Dubnica nad Váhom , Slovakia

Abstract

Abstract 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.

Publisher

Walter de Gruyter GmbH

Subject

General Medicine

Link

https://www.sciendo.com/pdf/10.2478/jamsi-2021-0006

Reference27 articles.

1. [1] Garey M. R., Johnson D. S. (1990). Computers and Intractability – A Guide to the Theory of NP-Completeness. NY, USA: W. H. Freeman & Co., ISBN 0716710455.

2. [2] Riesel H. (2012). Prime Numbers and Computer Methods for Factorization. Springer: New York, 2nd ed., 482 p., ISBN 978-0-8176-8298-9, DOI 10.1007/978-0-8176-8298-9.10.1007/978-0-8176-8298-9

3. [3] Coutinho S. C. (1999). The Mathematics of Ciphers: Number Theory and RSA Cryptography. 1st ed., 198 p., Brazil: A. K. Peters, ISBN: 9781568810829.10.1201/9781439863893

4. [4] Kleinjung T. et al. (2010). Factorization of a 768-Bit RSA Modulus. In: Advances in Cryptology – CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg, DOI: 10.1007/978-3-642-14623-7_18.10.1007/978-3-642-14623-7_18

5. [5] Sittinger, B. D. (2010). The probability that random algebraic integers are relatively r-prime. In. Journal of Number Theory, Vol. 130, No. 1, pp. 164-171., DOI 10.1016/j.jnt.2009.06.008.10.1016/j.jnt.2009.06.008