A Numerical Study on the Regularity of d -Primes via Informational Entropy and Visibility Algorithms

B. L. Mayer and L. H. A. Monteiro

Complexity, 2020, vol. 2020, 1-5

Abstract:

Let a - prime be a positive integer number with divisors. From this definition, the usual prime numbers correspond to the particular case . Here, the seemingly random sequence of gaps between consecutive - primes is numerically investigated. First, the variability of the gap sequences for is evaluated by calculating the informational entropy. Then, these sequences are mapped into graphs by employing two visibility algorithms. Computer simulations reveal that the degree distribution of most of these graphs follows a power law. Conjectures on how some topological features of these graphs depend on are proposed.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/1480890.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/1480890.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:1480890

DOI: 10.1155/2020/1480890

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().