Almost primes between all squares
From MaRDI portal
Let \(\Omega(a)\) denote the number of prime factors of \(a\) counting multiplicity. The authors of the present paper prove the following interesting assertion.\N\NFor all \(n\geqslant 1\), there exists \(a\in\big(n^2,(n+1)^2\big)\) with \(\Omega(a)\leqslant 4\).
Cites work
- An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\)
- An explicit result for primes between cubes
- An explicit version of Chen's theorem and the linear sieve
- Approximate formulas for some functions of prime numbers
- Explicit zero-free regions for the Riemann zeta-function
- From explicit estimates for primes to explicit estimates for the Möbius function
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 3592113 (Why is no real title available?)
- scientific article; zbMATH DE number 7069627 (Why is no real title available?)
- scientific article; zbMATH DE number 3093505 (Why is no real title available?)
- Landau's problems on primes
- Le crible d'Eratosthène et le théorème de Goldbach.
- Most permutations power to a cycle of small prime length
- On Chen's theorem. II.
- On the difference between consecutive primes.
- Primes between consecutive powers
- The difference between consecutive primes. II
Cited in
(2)
This page was built for publication: Almost primes between all squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950332)