An upper bound on Jacobsthal’s function

DOI10.1090/S0025-5718-2014-02896-2zbMath1320.11090arXiv1208.5342OpenAlexW2102401836MaRDI QIDQ5179228

Paul Watts, Fintan Costello

Publication date: 19 March 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5342

zbMATH Keywords

upper boundcomputational methodomega functioncoprime integerssquarefree integerrecurrent formulaJacobsthal's function

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Calculation of integer sequences (11Y55)

Related Items (1)

Dirichlet's theorem and Jacobsthal's function

Uses Software

• PARI/GP

Cites Work

• A note on the least prime in an arithmetic progression
• On Jacobsthal's \(g(n)\)-function
• Very large gaps between consecutive primes
• Über eine zahlentheoretische Funktion von Jacobsthal
• Disproof of a conjecture of Jacobsthal
• Computation of Jacobsthal’s function $h(n)$ for $n<50$.
• On a problem of Pillai and its generalizations
• Unusually Large Gaps Between Consecutive Primes
• ON THE PROBLEM OF JACOBSTHAL
• On the Integers Relatively Prime to $n$ and a Number-Theoretic Function Considered by Jacobsthal.

This page was built for publication: An upper bound on Jacobsthal’s function