Related Research Articles
The de Bruijn–Newman constant, denoted by Λ and named after Nicolaas Govert de Bruijn and Charles Michael Newman, is a mathematical constant defined via the zeros of a certain function H(λ,z), where λ is a real parameter and z is a complex variable. More precisely,
The Liouville lambda function, denoted by λ(n) and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if n is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes.
In number theory, Goldbach's weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, states that
In number theory, Skewes's number is any of several large numbers used by the South African mathematician Stanley Skewes as upper bounds for the smallest natural number for which
In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by π(x) (unrelated to the number π).
In mathematics, the Mertens conjecture is the statement that the Mertens function is bounded by . Although now disproven, it had been shown to imply the Riemann hypothesis. It was conjectured by Thomas Joannes Stieltjes, in an 1885 letter to Charles Hermite, and again in print by Franz Mertens, and disproved by Andrew Odlyzko and Herman te Riele . It is a striking example of a mathematical conjecture proven false despite a large amount of computational evidence in its favor.
In number theory, the Mertens function is defined for all positive integers n as
In mathematics, the Gauss class number problem, as usually understood, is to provide for each n ≥ 1 a complete list of imaginary quadratic fields having class number n. It is named after Carl Friedrich Gauss. It can also be stated in terms of discriminants. There are related questions for real quadratic fields and for the behavior as .
Richard Peirce Brent is an Australian mathematician and computer scientist. He is an emeritus professor at the Australian National University. From March 2005 to March 2010 he was a Federation Fellow at the Australian National University. His research interests include number theory, random number generators, computer architecture, and analysis of algorithms.
John Lewis Selfridge, was an American mathematician who contributed to the fields of analytic number theory, computational number theory, and combinatorics.
In mathematics, the Lindelöf hypothesis is a conjecture by Finnish mathematician Ernst Leonard Lindelöf about the rate of growth of the Riemann zeta function on the critical line. This hypothesis is implied by the Riemann hypothesis. It says that for any ε > 0,
Andrew Michael Odlyzko is a Polish-American mathematician and a former head of the University of Minnesota's Digital Technology Center and of the Minnesota Supercomputing Institute. He began his career in 1975 at Bell Telephone Laboratories, where he stayed for 26 years before joining the University of Minnesota in 2001.
In mathematics, the Kummer–Vandiver conjecture, or Vandiver conjecture, states that a prime p does not divide the class number hK of the maximal real subfield of the p-th cyclotomic field. The conjecture was first made by Ernst Kummer on 28 December 1849 and 24 April 1853 in letters to Leopold Kronecker, reprinted in, and independently rediscovered around 1920 by Philipp Furtwängler and Harry Vandiver,
In number theory, the Pólya conjecture stated that "most" of the natural numbers less than any given number have an odd number of prime factors. The conjecture was set forth by the Hungarian mathematician George Pólya in 1919, and proved false in 1958 by C. Brian Haselgrove. Though mathematicians typically refer to this statement as the Pólya conjecture, Pólya never actually conjectured that the statement was true; rather, he showed that the truth of the statement would imply the Riemann hypothesis. For this reason, it is more accurately called "Pólya's problem".
Daniel Charles Shanks was an American mathematician who worked primarily in numerical analysis and number theory. He was the first person to compute π to 100,000 decimal places.
In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann, after whom it is named.
In number theory, Gillies' conjecture is a conjecture about the distribution of prime divisors of Mersenne numbers and was made by Donald B. Gillies in a 1964 paper in which he also announced the discovery of three new Mersenne primes. The conjecture is a specialization of the prime number theorem and is a refinement of conjectures due to I. J. Good and Daniel Shanks. The conjecture remains an open problem: several papers give empirical support, but it disagrees with the widely accepted Lenstra–Pomerance–Wagstaff conjecture.
In number theory, the Erdős–Moser equation is
Andrew Victor Sutherland is an American mathematician and Principal Research Scientist at the Massachusetts Institute of Technology. His research focuses on computational aspects of number theory and arithmetic geometry. He is known for his contributions to several projects involving large scale computations, including the Polymath project on bounded gaps between primes, the L-functions and Modular Forms Database, the sums of three cubes project, and the computation and classification of Sato-Tate distributions.
References
- "Disproof of the Mertens conjecture". Journal für die reine und angewandte Mathematik (Crelle's Journal). 1985 (357). Walter de Gruyter GmbH: 138–160. 1 March 1985. doi:10.1515/crll.1985.357.138. ISSN 0075-4102. S2CID 13016831.
- Brent, R. P.; van de Lune, J.; te Riele, H. J. J.; Winter, D. T. (1982). "On the zeros of the Riemann zeta function in the critical strip. II". Mathematics of Computation. 39 (160). American Mathematical Society (AMS): 681–688. doi: 10.1090/s0025-5718-1982-0669660-1 . ISSN 0025-5718.
- te Riele, Herman J. J. (1987). "On the sign of the difference 𝜋(𝑥)-𝑙𝑖(𝑥)". Mathematics of Computation. 48 (177). American Mathematical Society (AMS): 323–328. doi: 10.1090/s0025-5718-1987-0866118-6 . ISSN 0025-5718.
- Kleinjung, Thorsten; Aoki, Kazumaro; Franke, Jens; Lenstra, Arjen K.; Thomé, Emmanuel; Bos, Joppe W.; Gaudry, Pierrick; Kruppa, Alexander; Montgomery, Peter L.; Osvik, Dag Arne; te Riele, Herman; Timofeev, Andrey; Zimmermann, Paul (2010). "Factorization of a 768-Bit RSA Modulus". Advances in Cryptology – CRYPTO 2010. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-14623-7_18. ISBN 978-3-642-14622-0. ISSN 0302-9743. S2CID 11556080.
