No label defined (Q4025980)

[For the entire collection see Zbl 0745.00060.] Let \(a\), \(d\), \(k\) be positive integers. The authors consider the product \(a(a+d)\cdots(a+(k-1)d)\), in particular its greatest prime factor \(P\) and its number of distinct prime factors \(\omega\). Suppose further \(gcd(a,d)=1\), \(k>2\) and put \(\chi=a+(k-1)d\) and \(\chi_ 0=\chi/(k- 1)\). In this paper the authors discuss some of their recent results on lower bounds for \(P\) and \(\omega\) in terms of \(k\), most of which have been (or will be) published elsewhere. For example: -- if \(d>1\) and \((a,d,k)\neq (2,7,3)\), then \(P>k\). In: A tribute to Paul Erdős, 385-389 (1990; Zbl 0709.11004), -- \(\omega\geq \pi(k)\) for all \(a\), \(d\), \(k\). In J. Sichuan, Univ., Nat. Sci. Ed. 26, Spec. Issue, 72-74 (1989; Zbl 0705.11052), -- \(\omega\geq\lfloor k(\log(\chi/k)/\log\chi)\rfloor\). In: \textit{P. Moree} and the authors, On the number of prime factors of an arithmetic progression. II (to appear). Also a proof is given of the unconditional \(P\gg k \min(\log\log\chi, \log\chi_ 0)\), which refines a result of the authors in Acta Arith. 53, 499-504 (1990; Zbl 0657.10044).