The greatest prime divisor of an arithmetic sequence (Q923615): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Antal Balog / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Antal Balog / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The greatest prime divisor of an arithmetic sequence |
scientific article |
Statements
The greatest prime divisor of an arithmetic sequence (English)
0 references
1989
0 references
Let \(1<c<3/2\) be fixed. It is shown that there are numbers with a large prime factor in the sequence \([n^ c]\). When c is close to 1 there are, in fact, primes in this sequence. [For the best result of this type see \textit{G. Kolesnik}, Pac. J. Math. 118, 437-447 (1985; Zbl 0571.10037)]. The proof is straightforward and improvements seem quite possible.
0 references
prime like numbers
0 references
large prime factors
0 references
