Let P(n) denote the largest prime factor of an integer n (2), and let N (x) denote the number of natural numbers n such that 2 n x, and n does not divide P(n)!. We prove that where (u) is the Dickman-de Bruijn function. In terms of elementary functions we have thereby sharpening and correcting recent results of K. Ford and J.-M. De Koninck and N. Doyon.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados