Square-free integer

From testwiki
Jump to navigation Jump to search

A square-free integer is a number which is not divisible by any square numbers other than 1. In other words, each prime number that appears in its prime factorization appears exactly once.

For example, 6=2×3 is square-free. However, 27=33 is not square-free: it is divisible by 9=32, and the power of 3 in the prime factorization is to a power larger than one.

Möbius function

Template:Main The Möbius function is a function which takes in natural numbers and is usually written as μ(n). The value of μ(n) depends on whether or not n is square-free. Specifically,

μ(n)={1,if n is square-free and has an even number of prime factors,1,if n is square-free and has an odd number of prime factors0,if n is not square-free

For example, 6=2×3 is square-free with an 2 prime factors, so μ(6)=1. Since 27=33 is not square-free, then μ(27)=0.

Since 5 is prime, it is its own prime decomposition. That is, the prime factorization of 5 has 1 prime factor, so μ(5)=1.

References

Template:Reflist

Template:Math-stub dummy edit dummy edit 2