Computation of Jacobsthal’s function $h(n)$ for $n<50$.
From MaRDI portal
Publication:3055131
DOI10.1090/S0025-5718-08-02166-2zbMath1215.11128OpenAlexW1514653080MaRDI QIDQ3055131
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-08-02166-2
Distribution of integers with specified multiplicative constraints (11N25) Values of arithmetic functions; tables (11Y70)
Related Items (6)
On a problem of Recaman and its generalization ⋮ Proof of the \(P\)-integer conjecture of Pomerance ⋮ On generalizations of problems of Recaman and Pomerance ⋮ An upper bound on Jacobsthal’s function ⋮ Dirichlet's theorem and Jacobsthal's function ⋮ Disproof of a conjecture of Jacobsthal
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On Jacobsthal's \(g(n)\)-function
- Neuere Untersuchungen über die Jacobsthal-Funktion g(n)
- Very large gaps between consecutive primes
- Über eine zahlentheoretische Funktion von Jacobsthal
- Unusually Large Gaps Between Consecutive Primes
- ON THE PROBLEM OF JACOBSTHAL
- The On-Line Encyclopedia of Integer Sequences
- On the Integers Relatively Prime to $n$ and a Number-Theoretic Function Considered by Jacobsthal.
- On the error term in the linear sieve
- The Difference between Consecutive Prime Numbers V
This page was built for publication: Computation of Jacobsthal’s function $h(n)$ for $n<50$.