Letf be a multiplicative function and letΨ f (x, y) denote the incomplete multiplicative sum Σn≤x,P(n)≤y f(n), whereP(n) denotes the greatest prime factor ofn. A Buchstab- and a Hildebrand equation forΨ f (x, y) are derived.
KeywordsNumber Theory Prime Factor Arithmetical Progression Diophantine Equation Multiplicative Function
Unable to display preview. Download preview PDF.
- Buchstab, A.A.: On those numbers in arithmetical progression all of whose prime factors are small in order of magnitude (Russian), Dokl. Akad. Nauk. SSSR67, 5–8 (1949).Google Scholar
- Moree, P.: Psixyology and Diophantine equations, PhD thesis, Leiden, 1993.Google Scholar
- Moree, P.: On a result of Levin and Fainleib involving multiplicative functions, MPI-preprint 46, Bonn, 1996.Google Scholar
- Norton, K.K.: Numbers with small prime factors and the leastkth power non-residue, Mem. Amer. Math. Soc.106, AMS, Providence, Rhode Island, 1971.Google Scholar