Bertrand's postulate for number fields
From MaRDI portal
Abstract: Consider an algebraic number field, , and its ring of integers, . There exists a smallest such that for any we can find a prime ideal, , in with norm in the interval . This is a generalization of Bertrand's postulate to number fields, and in this paper we produce bounds on in terms of the invariants of from an effective prime ideal theorem due to Lagarias and Odlyzko. We also show that a bound on can be obtained from an asymptotic estimate for the number of ideals in less than .
Recommendations
Cited in
(8)- On the finiteness of solutions for polynomial-factorial Diophantine equations
- On fractionally dense sets
- Explicit interval estimates for prime numbers
- Bertrand's postulate over the Gaussian integers
- Finiteness of trivial solutions of factorial products yielding a factorial over number fields
- Explicit counting of ideals and a Brun-Titchmarsh inequality for the Chebotarev density theorem
- Existence of the solutions to the Brocard–Ramanujan problem for norm forms
- EXPLICIT MERTENS’ THEOREMS FOR NUMBER FIELDS
This page was built for publication: Bertrand's postulate for number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970281)