Radical of an integer

From Wikipedia, the free encyclopedia

Template:Short description

File:Radical of an Integer Plot.svg
The first thousand values of rad(n). rad(n) = n when n is square-free.

In number theory, the radical of a positive integer n is defined as the product of the distinct prime numbers dividing n. Each prime factor of n occurs exactly once as a factor of this product:

rad(n)=pnp primep

The radical plays a central role in the statement of the abc conjecture.[1]

Examples

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, 504=23327

and therefore rad(504)=237=42

Properties

The function rad is multiplicative (but not completely multiplicative).

The radical of any integer n is the largest square-free divisor of n and so also described as the square-free kernel of 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 t-free divisor of n, radt, which are multiplicative functions which act on prime powers as

radt(pe)=pmin(e,t1)

The cases t=3 and t=4 are tabulated in OEISA007948 and OEISA058035.

The notion of the radical occurs in the abc conjecture, which states that, for any ε>0, there exists a finite Kε such that, for all triples of coprime positive integers a, b, and c satisfying a+b=c,[1]

c<Kεrad(abc)1+ε

For any integer n, the nilpotent elements of the finite ring /n are all of the multiples of rad(n).

The Dirichlet series is

p(1+p1s1ps)=n=1rad(n)ns

References

Page Template:Reflist/styles.css has no content.

  1. ^ a b Page Module:Citation/CS1/styles.css has no content.Gowers, Timothy (2008). "V.1 The ABC Conjecture". The Princeton Companion to Mathematics. Princeton University Press. p. 681.
  2. ^ Page Module:Citation/CS1/styles.css has no content.Sloane, N. J. A. (ed.). "Sequence A007947". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ Page Module:Citation/CS1/styles.css has no content.Adleman, Leonard M.; McCurley, Kevin S. (1994). "Open Problems in Number Theoretic Complexity, II". Algorithmic Number Theory: First International Symposium, ANTS-I Ithaca, NY, USA, May 6–9, 1994, Proceedings. Lecture Notes in Computer Science. Vol. 877. Springer. pp. 291–322. CiteSeerX 10.1.1.48.4877. doi:10.1007/3-540-58691-1_70. ISBN 978-3-540-58691-3. MR 1322733.