Disproof of a conjecture of Jacobsthal

DOI10.1090/S0025-5718-2012-02581-6zbMath1290.11132OpenAlexW2022632371WikidataQ123020003 ScholiaQ123020003MaRDI QIDQ2840026

N. Saradha, Lajos Hajdu

Publication date: 17 July 2013

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-2012-02581-6

zbMATH Keywords

Jacobsthal functioncoverings by primes

Mathematics Subject Classification ID

Other results on the distribution of values or the characterization of arithmetic functions (11N64) Calculation of integer sequences (11Y55)

Related Items (4)

Proof of the \(P\)-integer conjecture of Pomerance ⋮ Domination in direct products of complete graphs ⋮ An upper bound on Jacobsthal’s function ⋮ Strongly obtuse rational lattice triangles

Cites Work

• Unnamed Item
• On a problem of Recaman and its generalization
• 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
• Computation of Jacobsthal’s function $h(n)$ for $n<50$.
• On a problem of Pillai and its generalizations
• 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

This page was built for publication: Disproof of a conjecture of Jacobsthal