A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Let n be a positive integer, and suppose n = n pp' is its prime factorization. Let 0(n) = n pp-', so that n/0(n) is the largest squarefree factor of n. We show that 0 is deterministic polynomial time Turing reducible to cp, the Euler function. We also show that Q is reducible to I, the Carmichael function. We survey other recent work on computing the square part of an integer and give upper and lower bounds on the complexity of solving the problem.doi:10.1016/0890-5401(88)90028-4 fatcat:ucbxvq57pvb6ndywh3unaz366m