On Jacobsthal's \(g(n)\)-function (Q1224129): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:35, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Jacobsthal's \(g(n)\)-function |
scientific article |
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
