Algorithmic Number Theory
From MaRDI portal
(Redirected from Publication:5899248)
Algorithmic Number Theory (scientific article; zbMATH DE number 5148578)
Algorithmic Number Theory (scientific article; zbMATH DE number 5148578)
Recommendations
Cited in
(34)- Symmetric matrices related to the Mertens function
- Eine empirische Untersuchung zur Mertensschen Funktion
- A note on Merris' conjectures
- Summatory function of the Möbius function. III: Strong effective asymptotic upper bounds
- Constant components of the Mertens function and its connections with Tschebyschef's theory for counting prime numbers
- Summing \(\mu(n)\): a faster elementary algorithm
- Improved results on the Mertens conjecture
- On the first sign change in Mertens' theorem
- Disproof of the Mertens conjecture.
- scientific article; zbMATH DE number 5607393 (Why is no real title available?)
- scientific article; zbMATH DE number 3952843 (Why is no real title available?)
- scientific article; zbMATH DE number 3968689 (Why is no real title available?)
- scientific article; zbMATH DE number 4010615 (Why is no real title available?)
- scientific article; zbMATH DE number 41518 (Why is no real title available?)
- Computations of the Mertens function and improved bounds on the Mertens conjecture
- On estimates of the Mertens function
- On the Order of the Mertens Function
- On a version of Mertens’s theorem
- LLL: a tool for effective Diophantine approximation
- Selected applications of LLL in number theory
- Biased behavior of weighted Mertens sums
- Linear relations of zeroes of the zeta-function
- On the Mertens conjecture for elliptic curves over finite fields
- On the Mertens conjecture for function fields
- Improved sphere packing lower bounds from Hurwitz lattices
- scientific article; zbMATH DE number 6665042 (Why is no real title available?)
- scientific article; zbMATH DE number 3048714 (Why is no real title available?)
- MENAS’S CONJECTURE REVISITED
- Constant components of the Mertens function and its connections with Tschebyschef's theory for counting prime numbers. II
- On counterexamples to the Mertens conjecture
- On a Mertens-type conjecture for number fields
- An annotated bibliography for comparative prime number theory
- A New Upper Bound on the Smallest Counterexample to the Mertens Conjecture
- The strength of Menger's conjecture
This page was built for publication: Algorithmic Number Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899248)