Algorithmic concepts for the computation of Jacobsthal's function

2016/11/02 by Mario Ziller, Ziller, Mario, John F. Morack +1 · 3 citations
Physics and Astronomy · Mathematics · Biochemistry, Genetics and Molecular Biology · #Advanced Mathematical Theories and Applications #Mathematical Dynamics and Fractals #Fractal and DNA sequence analysis

paper · pdf · doi:10.48550/arxiv.1611.03310

Abstract

The Jacobsthal function has aroused interest in various contexts in the past decades. We review several algorithmic ideas for the computation of Jacobsthal's function for primorial numbers and discuss their practicability regarding computational effort. The respective function values were computed for primes up to 251. In addition to the results including previously unknown data, we provide exhaustive lists of all sequences of the appropriate maximum lengths in ancillary files.

Citations

• A short note on Jacobsthal's function

Cited by

• Dirichlet's Theorem and Jacobsthal's Function
• A short note on the computation of the generalised Jacobsthal function\n for paired progressions
• New computational results on a conjecture of Jacobsthal

Related

• A computational upper bound on Jacobsthal's function
• A short note on the computation of the generalised Jacobsthal function\n for paired progressions
• New computational results on a conjecture of Jacobsthal
• Jacobsthal's function and a generalisation of Euler's totient
• Dirichlet's Theorem and Jacobsthal's Function