2004
DOI: 10.1016/s0960-0779(03)00433-8
|View full text |Cite
|
Sign up to set email alerts
|

Toward a dynamical model for prime numbers

Abstract: We show one possible dynamical approach to the study of the distribution of prime numbers. Our approach is based on two complexity methods, the Computable Information Content and the Entropy Information Gain, looking for analogies between the prime numbers and intermittency.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
4
1
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…Littlewood gives the number of pairs of primes not necessarily successive and we would like to stress that in (2) τ d (x) denotes number of pairs of consecutive primes p n , p n+1 with difference p n+1 − p n = d. The pairs of primes separated by d = 2 and d = 4 are special as they always have to be consecutive primes (with the exception of the pair (3,7) containing 5 in the middle): in the triple of integers 2k+1, 2k+3, 2k+5 the middle 2k+3 has to be divisible by 3 if 2k + 1, 2k + 5 are prime (in particular not divisible by 3). For d = 6 (and larger d) we have π 6 (x) > τ 6 (x), for example (5,7,11), (7,11,13), (11,13,17), . .…”
Section: Nnsd For Prime Numbersmentioning
confidence: 99%
See 1 more Smart Citation
“…Littlewood gives the number of pairs of primes not necessarily successive and we would like to stress that in (2) τ d (x) denotes number of pairs of consecutive primes p n , p n+1 with difference p n+1 − p n = d. The pairs of primes separated by d = 2 and d = 4 are special as they always have to be consecutive primes (with the exception of the pair (3,7) containing 5 in the middle): in the triple of integers 2k+1, 2k+3, 2k+5 the middle 2k+3 has to be divisible by 3 if 2k + 1, 2k + 5 are prime (in particular not divisible by 3). For d = 6 (and larger d) we have π 6 (x) > τ 6 (x), for example (5,7,11), (7,11,13), (11,13,17), . .…”
Section: Nnsd For Prime Numbersmentioning
confidence: 99%
“…The expression (7) for τ d (x) was proved (in slightly different form required by the precision of the formulation of the theorem) under the assumption of the conjecture B of Hardy-Littlewood by D. A. Goldston and A. H. Ledoan [29] in 2012. During over a seven months long run of the computer program we have collected the values of τ d (x) up to x = 2 48 ≈ 2.8147 × 10 14 .…”
Section: 1])mentioning
confidence: 99%
“…With the proper values of m and τ embedding parameters, a smooth discrete-time process is defined, which reconstructs the underlying dynamics. [2] The choice of these two parameters is crucial for the proper characterization of the structure of the time series [30, 31, 32]. The mathematical concepts for defining the state vector dimension m have been reviewed in details in Refs.…”
Section: Algorithm Design Using Symbolic Analysismentioning
confidence: 99%
“…However, their global distribution exhibits an amazing regularity [10]. Certainly, this intriguing property contrasting local randomness and global evenness has caused the distribution of primes to be, since ancient times, a fascinating open problem for mathematicians [11] and more recently for physicists as well (see for instance [5,9,[12][13][14][15]). The Prime Number Theorem, which establishes the global smoothness of the counting function π(n) by providing the number of primes less or equal to the integer n, was the first indication of such regularity [16].…”
Section: A Statistical Pattern In the Prime Number Sequencementioning
confidence: 99%
“…12 Characteristic time τ as defined in the text versus N, for different pool sizes, from left to right: M = 2 10 , 2 11 , 2 12 , 2 13 , 214 . Every simulation is averaged over 2 × 10 4 realizations.…”
mentioning
confidence: 99%