Some analytical and computational aspects of prime numbers, prime number theorems and distribution of primes with applications (Q2339711)

From MaRDI portal
Revision as of 07:43, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Some analytical and computational aspects of prime numbers, prime number theorems and distribution of primes with applications
scientific article

    Statements

    Some analytical and computational aspects of prime numbers, prime number theorems and distribution of primes with applications (English)
    0 references
    0 references
    0 references
    2 April 2015
    0 references
    This paper (expository, at the undergraduate level) is filled with errors, both historical and mathematical. The names of mathematicians are often rendered incorrectly -- ``Kroneker'', ``Applolonius'', both ``Neil Abel'' and ``Neils Abel'', ``Goldback'', and several others. Similarly, the Great Internet Mersenne Prime Search gets transmuted into ``the Great Internet Prime Secret (GIPS) project''. In discussing Fermat numbers, the authors erroneously state that ``\(2^m+1\) would be a prime provided \(m\) is a power of 2'' (it is the converse that holds). They also write, ``if \(n=9\), then \(\phi(n)=6\) because integers less than 9 and co prime [sic] to 9 are 1, 2, 3, 4, 5, 7 and 8''. The above represents just a sampling of the many mistakes. In short, this paper would be a quite unreliable source of information for its apparent audience of students.
    0 references
    prime numbers
    0 references
    history of number theory
    0 references

    Identifiers