2 citations · 5 across the 12 of their papers we have counts for
Showing 2012 · math.NTShow all
2 papers · 2 filters
math.NT2012
Jacobsthal's function and a generalisation of Euler's totient
Fintan Costello, Paul Watts
Jacobsthal's function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to P_k, the product of the first k primes…
math.NT2012★ 2 cited
A computational upper bound on Jacobsthal's function
Fintan Costello, Paul Watts
The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational…