Preprint Article Version 1 This version is not peer-reviewed

An Algorithmic Random Integer Generator based on Prime Numbers Distribution

Version 1 : Received: 1 May 2019 / Approved: 6 May 2019 / Online: 6 May 2019 (08:34:22 CEST)
Version 3 : Received: 3 June 2019 / Approved: 4 June 2019 / Online: 4 June 2019 (11:12:53 CEST)

A peer-reviewed article of this Preprint also exists.

Bertrand Teguia Tabuguia. An Algorithmic Random-Integer Generator based on the Distribution of Prime Numbers. Research Journal of Mathematics and Computer Science, 2019; 3:16. DOI: 10.28933/rjmcs-2019-06-1705 Bertrand Teguia Tabuguia. An Algorithmic Random-Integer Generator based on the Distribution of Prime Numbers. Research Journal of Mathematics and Computer Science, 2019; 3:16. DOI: 10.28933/rjmcs-2019-06-1705

Journal reference: Research Journal of Mathematics and Computer Science 2019
DOI: 10.28933/rjmcs-2019-06-1705

Abstract

More than a philosophic thinking, we combine two researchers wishes on randomness reproduction and prime numbers distribution. Indeed, up to now we cannot rigorously answer the question on randomness of primes [6, page 1]. We then propose an example of algorithms that can be deduced by that connection. For this purpose, our main procedure uses prime gap sequence variation. An evaluation on randomness reproduction is made at the end for a conclusion about prime numbers distribution and its implications.

Subject Areas

prime numbers; random

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.