On Jacobsthal's \(g(n)\)-function (Q1224129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3505095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Jacobsthal's \(g(n)\)-function |
scientific article; zbMATH DE number 3505095 |
Statements
On Jacobsthal's \(g(n)\)-function (English)
0 references
1977
0 references
The arithmetic function \(g(n)\) of Jacobsthal is defined as the least positive integer such that every sequence of \(g(n)\) consecutive integers contains at least one member which is prime to \(n\). It is proved for all \(k\geq 1\) that \[ g(n)\leq 2k^{2+2e\log k}, \] where \(k\) is the number of distinct primes dividing \(n\).
0 references
0.8163241147994995
0 references
0.813036322593689
0 references
0.8116984367370605
0 references
0.8033291697502136
0 references
