- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Advances in Mathematical Physics

Volume 2011 (2011), Article ID 519178, 8 pages

http://dx.doi.org/10.1155/2011/519178

## Hidden Periodicity and Chaos in the Sequence of Prime Numbers

Physics Department, ICAR, P.O. Box 31155, Jerusalem 91000, Israel

Received 3 March 2011; Revised 2 May 2011; Accepted 3 May 2011

Academic Editor: Giorgio Kaniadakis

Copyright © 2011 A. Bershadskii. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). It is shown that multiplicative nature of the noise is the main reason for the successful application of the logarithmic gaps transforming the multiplicative noise into an additive one. A relation of this phenomenon to spontaneous neuron activity and to chaotic brain computations has been discussed.

#### 1. Introduction

The prime number distribution is apparently random. The apparent randomness can be stochastic or chaotic (deterministic). It is well known that the Riemann zeros obey the chaotic GUE statistics (if the primes are interpreted as the classical periodic orbits of a chaotic system, see for a recent review [1]), whereas the primes themselves are believed to be stochastically distributed (Poissonian-like, etc., [2]). However, recent investigations suggest that primes themselves “could be eigenvalues of a quantum system whose classical counterpart is chaotic at low energies but increasingly regular at higher energies.” [3]. Therefore, the problem of chaotic (deterministic) behavior of the moderate and small prime numbers is still open. Moreover, there is also an indication of periodic patterns in the prime numbers distribution [3–7]. These patterns, however, have been observed in * probability* distribution of the gaps between neighboring primes and not in the prime numbers sequence itself (see also [8]). The intrinsic randomness (stochastic or chaotic) of the primes distribution makes the problem of finding the periodic patterns in the prime numbers themselves (if they exist after all) a very difficult one.

A physicists may ask: why should one be interested in finding these patterns? The answer is: comparison. If one can recognize patterns in an apparently random system, then one can compare these patterns with the patterns known for some other system of interest. We have already mentioned the comparison with certain quantum systems. Another intrinsic comparison can be made with the computational properties of brains, where the natural numbers certainly should play a crucial role. The neuron signals are also apparently random. Can one compare patterns observed in these signals with the patterns in the prime numbers sequence in a constructive way, in order to shed a light on the computational apparatus of the brains?

#### 2. Logarithmic Gaps

It is believed that properties of the gaps between consecutive primes can provide a lot of information about the primes distribution in the natural sequence. The so-called prime number theorem states that the “average length” of the gap between a prime and the next prime number is proportional (asymptotically) to (see, e.g., [2]). This implies, in particular, statistical nonstationarity of the prime numbers sequence. That is a serious obstacle for practical applications of the statistical methods to this sequence. For relatively large prime numbers one can try to overcome this obstacle by using relatively short intervals [2]. Another (additional) way to overcome this obstacle is to use logarithmic gaps (logarithms of the gaps). The nonstationarity in the sequence of the logarithmic gaps is considerably “slower” than that in the original sequence of the gaps themselves. The logarithmic gaps have also another crucial advantage. If the noise corrupting the gaps sequence has a multiplicative nature, then for the logarithmic gaps this noise will be transformed into an additive one. It is well known that the additive noises can be much readily separated from the signal than the multiplicative ones (see below).

Before starting the analysis let us recall two rather trivial properties of the gaps, which will be used below. The sequence can be restored from the gaps by taking cumulative sum. Pure periodicity in a sequence corresponds to a constant value of the gaps (the period).

Let us take, as a first step, logarithms of the gaps for the sequence of prime numbers. Then, let us compute cumulative sum of these logarithms as a second step. Then, we will multiply each value in the cumulative sum by 10 and will replace each of the obtained values by a natural number which is nearest to it. As a result we will obtain a sequence of natural numbers: which will be called ln-sequence.

Let us now define a binary function of natural numbers , which takes two values +1 or −1 and changes its sign passing any number from the ln-sequence. This function contains full information about the ln-sequence numbers distribution in the sequence of natural numbers.

Let us consider a relatively short interval: . For this interval the autocorrelation function computed for the function of the ln-sequence will be approximately independent on . Figure 1 shows the autocorrelation function (circles) computed for the function of the ln-sequence for the “short interval”: . Figure 2 shows an autocorrelation function (circles) computed for the function of the ln-sequence for interval of much smaller natural numbers: (here we rely on the much slower nonstationarity in the logarithmic gaps sequence in comparison with the original gaps sequence).

#### 3. Models

In order to understand origin of the oscillating autocorrelation function shown in Figures 1 and 2 let us consider a very simple telegraph signal, which allows analytic calculation of its autocorrelation function. The telegraph signal takes two values +1 or −1, and it changes its sign at discrete moments: where is a uniformly distributed over the interval random variable, , and is a fixed period. If is a probability of a sign change at a current moment (), then the autocorrelation function of such telegraph signal is in the interval . Figure 3 shows the autocorrelation function (3.2) calculated for , as an example (cf. with Figures 1 and 2). In model (3.1) was taken as a pure stochastic variable. This variable, however, can be also a chaotic (deterministic) one. Let us consider a chaotic solution of the Rössler system [9] where , and are parameters (a reason for this system relevance will be given in Section 4). Figure 4 shows the -component fluctuations of a chaotic solution of the Rössler system.

Let us consider a telegraph signal generated by the variable crossing certain threshold from below (Figure 4). This telegraph signal takes values +1 or −1 and changes its sign at the threshold-crossing points. Then, the fundamental period of the Rössler chaotic attractor provides the period in (3.1), whereas the chaotic fluctuations of the variable of the attractor provide chaotic variable in (3.1) for the considered telegraph signal. Autocorrelation function computed for this telegraph signal has been shown in Figures 1 and 2 as the solid line. In order to make the autocorrelation functions comparable a rescaling has been made for the Rössler telegraph signal's autocorrelation function: the scaling coefficient is equal to 0.36 for Figure 1 and to 0.30 for Figure 2.

#### 4. Prime Numbers and Spontaneous Neuron Activity

All types of information, which is received by sensory system, are encoded by nerve cells into sequences of pulses of similar shape (spikes) before they are transmitted to the brain. Brain neurons use such sequences as main instrument for intercells connection. The information is reflected in the time intervals between successive firings (interspike intervals of the action potential train, see Figure 5(b)). There need be no loss of information in principle when converting from dynamical amplitude information to spike trains, and the irregular spike sequences are the foundation of neural information processing. Although understanding of the origin of interspike intervals irregularity has important implications for elucidating the temporal components of the neuronal code the problem is still very far from its solution.

In a recent paper [10] a membrane threshold-crossing model of spontaneous (without external stimulus) neuron firing based on the chaotic Rössler attractor was suggested. Good agreement between the model and the spiking time series, obtained in vitro from a spontaneous activity of hippocampal (CA3) singular neurons (rats brain slice culture), was reported in this paper. The spiking time series were mapped into a telegraph signal as it is shown in Figure 5. The comparison between the experimental data and the signal generated by the Rössler attractor fluctuations overcoming a threshold (cf. Section 3) is shown in Figure 6.

The hippocampus is a significant part of a brain system responsible, in particular, for spatial memory, body orientation, and navigation. These functions of brain are related to the very sophisticated real-time computations, which the brains make with astonishing effectiveness. One should distinguish between the inner brain computations and our conscious arithmetic calculations, which are performed in the more specialized brain's departments such as the intraparietal sulcus. Therefore, if one wants to investigate how the inner brain computational abilities are related to neuron activity the hippocampal pyramidal cells are an appropriate subject for this investigation. Spontaneous activity in brain slice preparations purely reflects the intrinsic properties of local circuits and individual neurons. The comparison of the spontaneous activity of the hippocampal singular neurons with the random properties of the sequence of prime numbers can shed certain light on the long-standing problem: whether mathematics belongs completely to the outer world or it is a production of our brain activity (at least in the form of the natural numbers). For instance, in order to work together the brain neurons have to make an adjustment of their rhythms. The main problem for this adjustment is the very noisy environment of the brain neurons. For pure periodic inner clocks this adjustment would be impossible due to the noise. Nature, however, has another option. This option is a chaotic clock (see [10] and references therein). In chaotic attractors certain characteristic frequencies can be embedded by broad-band spectra, that makes them much more stable to the noise perturbations. The Riemann's hypothesis, for instance, which states that the apparent randomness in the distribution of prime numbers only comes from a noise (otherwise the prime numbers are as regularly distributed as possible), can reflect an optimization of such mechanism.

On the other hand, the compatibility of the statistical properties of the neuron spontaneous activity with the statistics of the prime numbers (see Figures 7 and 8) could be a key for understanding of the inner computational methods of the brains. If brains use chaotic dynamics (Figure 6) also for computational processing, then such compatibility should play a crucial role in the inner brain computations. The reduction to the additive random processes by means of the logarithmic gaps (see Section 3) could be a part of these inner brain computations. If the gaps can be considered as a result of a multiplicative random process, that is, each gap between consecutive primes can be represented as a product of independent random variables (the random variables could take their values from the prime numbers set, including 1), then logarithmic gap represents the sum of random variables (i.e., an additive random process). It is known that unlike the additive random processes the multiplicative random processes are much more complex and difficult for analysis.

#### Acknowledgment

The author thanks Y. Ikegaya for sharing the neuron data and discussions.

#### References

- E. Bogomolny, “Riemann zeta function and quantum chaos,”
*Progress of Theoretical Physics*, no. 166, pp. 19–44, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. Soundararajan, “The distribution of prime numbers,” in
*Equidistribution in Number Theory, An Introduction*, vol. 237 of*NATO Science Series II: Mathematics, Physics and Chemistry*, pp. 59–83, Springer, Dordrecht, 2007. View at Zentralblatt MATH - T. Timberlake and J. Tucker, “Is there quantum chaos in the prime numbers?”
*Bulletin of the American Physical Society*, vol. 52, p. 35, 2007. - C. E. Porter,
*Statistical Theories of Spectra: Fluctuations*, Academic Press, New York, NY, USA, 1965. - M. Wolf, “Applications of statistical mechanics in number theory,”
*Physica A*, vol. 274, no. 1–2, pp. 149–157, 1999. View at Publisher · View at Google Scholar · View at MathSciNet - P. Kumar, P. C. Ivanov, and H. E. Stanley, “Information entropy and correlations in prime numbers”. View at Publisher · View at Google Scholar · View at MathSciNet
- S. Ares and M. Castro, “Hidden structure in the randomness of the prime number sequence?”
*Physica A*, vol. 360, no. 2, pp. 285–296, 2006. View at Publisher · View at Google Scholar - S. R. Dahmen, S. D. Prado, and T. Stuermer-Daitx, “Similarity in the statistics of prime numbers,”
*Physica A*, vol. 296, no. 3–4, pp. 523–528, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - O. E. Rössler, “An equation for continuous chaos,”
*Physics Letters A*, vol. 57, no. 5, pp. 397–398, 1976. View at Publisher · View at Google Scholar - A. Bershadskii and Y. Ikegaya, “Chaotic neuron clock,”
*Chaos, Solitons and Fractals*, vol. 44, no. 4–5, pp. 342–347, 2011. View at Publisher · View at Google Scholar