Some analytical and computational aspects of prime numbers, prime number theorems and distribution of primes with applications (Q2339711): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s40819-014-0014-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977732666 / rank | |||
Normal rank |
Revision as of 23:31, 19 March 2024
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
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