Number theory -- probabilistic, heuristic, and computational approaches

DOI10.1016/S0898-1221(02)80012-8MaRDI QIDQ1876476zbMATH OpenFDO

Publication date 20 August 2004

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(02)80012-8

additive functions Asymptotic results on arithmetical functions computational number theory convergence to the normal distribution measure and integration on the set of positive integers Probabilistic Number Theory spaces of arithmetical functions Stone-Čech compactification tables of prime twins uniformly summable functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to number theory (11-02) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11Kxx) Asymptotic results on arithmetic functions (11N37) Computational number theory (11Yxx)

Review text

In this paper (with more than 100 bibliographical items) the author surveys some areas of number theory, to which the author has given important contributions, and he gives some numerical results about large twin primes. The author deals with -- the beginnings of probabilistic number theory (Theorem of Erdős and Kac, Kubilius model) -- ``Approximation of independence, convergence to the normal distribution: \[ {1\over x} \cdot \# \left\{ n\leq x; f(n) - \sum_{p\leq x} {{f(p)}\over p} \leq z \cdot \left( \sum_{p\leq x} {{f^2(p)}\over p} \right)^{{1\over 2}} \right\} \Longrightarrow {1\over{\sqrt{2\pi}}} \cdot \int_{-\infty}^z e^{ - {1\over 2} w^2} dw, \] under suitable assumptions on the real-valued additive function \(f\). -- Uniform integrability: spaces of arithmetical functions, generalization of Delange's, Elliott's and Halász' mean-value theorems. -- Polyadic numbers, a first attempt of an integration theory for arithmetical functions (E. V. Novoselov, Schwarz and Spilker). -- Pseudomeasures on \(\mathbb N\) and the Stone-Čech compactification. In this section the author explains his theory of integration based on an application of the Stone-Čech compactification, and shows its wide usability. -- Primes play a game of chance: here a table of the counting function for primes and twin primes is given in short intervals up to \(10^{15}\). -- The last section (Computational Results, together with Járai) gives again numerical results on large twin primes and Sophie-Germain primes. The author, expert in the topics mentioned, gives many results, hints to the bibliography and valuable explanations.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: Number theory -- probabilistic, heuristic, and computational approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876476)