On the order of magnitude of Jacobsthal's function
1977 ◽
Vol 20
(4)
◽
pp. 329-331
◽
Let n be an integer with n > 1. Jacobsthal (3) defines g(n) to be the least integer so that amongst any g(n) consecutive integers a + 1, a + 2, … a + g(n) there is at least one coprime with n. In other words, ifthenIt is probably true thatwhere ω(n) denotes the number of different prime divisors of n, and Erdos (1) has pointed out that by the small sieve it is possible to show that there is a constant C such that
1985 ◽
Vol 27
◽
pp. 143-159
◽
Keyword(s):
1990 ◽
Vol 42
(2)
◽
pp. 315-341
◽
1966 ◽
Vol 9
(4)
◽
pp. 427-431
◽
1990 ◽
Vol 32
(3)
◽
pp. 317-327
◽
Keyword(s):
Keyword(s):
1983 ◽
Vol 94
(1)
◽
pp. 149-166
Keyword(s):
1977 ◽
Vol 9
(3)
◽
pp. 338-341
◽
Keyword(s):
1995 ◽
Vol 41
(138)
◽
pp. 232-240
◽
Keyword(s):