The greatest prime divisor of an arithmetic sequence (Q923615)

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.