The radical of any integer n {\displaystyle n} is the largest square-free divisor of n {\displaystyle n} and so also described as the square-free kernel of n {\displaystyle n} .[2] There is no known polynomial-time algorithm for computing the square-free part of an integer.[3]