Radical of an integer

Radical numbers for the first few positive integers are

1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, ... (sequence A007947 in the OEIS).

For example, $${\displaystyle 504=2^{3}\cdot 3^{2}\cdot 7}$$ 

and therefore $${\displaystyle \operatorname {rad} (504)=2\cdot 3\cdot 7=42}$$ 

The function ${\displaystyle \mathrm {rad} }$  is multiplicative (but not completely multiplicative).

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

The definition is generalized to the largest ${\displaystyle t}$ -free divisor of ${\displaystyle n}$ , ${\displaystyle \mathrm {rad} _{t}}$ , which are multiplicative functions which act on prime powers as

$${\displaystyle \mathrm {rad} _{t}(p^{e})=p^{\mathrm {min} (e,t-1)}}$$ 

The cases ${\displaystyle t=3}$  and ${\displaystyle t=4}$  are tabulated in OEIS: A007948 and OEIS: A058035.

The notion of the radical occurs in the abc conjecture, which states that, for any ${\displaystyle \varepsilon >0}$ , there exists a finite ${\displaystyle K_{\varepsilon }}$  such that, for all triples of coprime positive integers ${\displaystyle a}$ , ${\displaystyle b}$ , and ${\displaystyle c}$  satisfying ${\displaystyle a+b=c}$ ,^[1]

$${\displaystyle c<K_{\varepsilon }\,\operatorname {rad} (abc)^{1+\varepsilon }}$$ 

For any integer ${\displaystyle n}$ , the nilpotent elements of the finite ring ${\displaystyle \mathbb {Z} /n\mathbb {Z} }$  are all of the multiples of ${\displaystyle \operatorname {rad} (n)}$ .

The Dirichlet series is

${\displaystyle \prod _{p}\left(1+{\frac {p^{1-s}}{1-p^{-s}}}\right)=\sum _{n=1}^{\infty }{\frac {\operatorname {rad} (n)}{n^{s}}}}$