Square-free integer

Every positive integer n can be factored in a unique way as n=\prod_{i=1}^k q_i^i, where the q_i different from one are square-free integers that are pairwise coprime. This is called the square-free factorization of . To construct the square-free factorization, let n=\prod_{j=1}^h p_j^{e_j} be the prime factorization of n, where the p_j are distinct prime numbers. Then the factors of the square-free factorization are defined as q_i=\prod_{j: e_j=i}p_j. An integer is square-free if and only if q_i=1 for all i > 1. An integer greater than one is the kth power of another integer if and only if k is a divisor of all i such that q_i\neq 1. The use of the square-free factorization of integers is limited by the fact that its computation is as difficult as the computation of the prime factorization. More precisely every known algorithm for computing a square-free factorization computes also the prime factorization. This is a notable difference with the case of polynomials for which the same definitions can be given, but, in this case, the square-free factorization is not only easier to compute than the complete factorization, but it is the first step of all standard factorization algorithms. ==Square-free factors of integers==

The radical of an integer is its largest square-free factor, that is \textstyle \prod_{i=1}^k q_i with notation of the preceding section. An integer is square-free if and only if it is equal to its radical. Every positive integer n can be represented in a unique way as the product of a powerful number (that is an integer such that is divisible by the square of every prime factor) and a square-free integer, which are coprime. In this factorization, the square-free factor is q_1, and the powerful number is \textstyle \prod_{i=2}^k q_i^i. The square-free part of n is q_1, which is the largest square-free divisor k of n that is coprime with n/k. The square-free part of an integer may be smaller than the largest square-free divisor, which is \textstyle \prod_{i=1}^k q_i. Any arbitrary positive integer n can be represented in a unique way as the product of a square and a square-free integer: n=m^2 k In this factorization, m is the largest divisor of n such that m^2 is a divisor of n. In summary, there are three square-free factors that are naturally associated to every integer: the square-free part, the above factor k, and the largest square-free factor. Each is a factor of the next one. All are easily deduced from the prime factorization or the square-free factorization: if n=\prod_{i=1}^h p_i^{e_i}=\prod_{i=1}^k q_i^i are the prime factorization and the square-free factorization of n, where p_1, \ldots, p_h are distinct prime numbers, then the square-free part is \prod_{e_i=1} p_i =q_1, The square-free factor such the quotient is a square is \prod_{e_i \text{ odd}} p_i=\prod_{i \text{ odd}} q_i, and the largest square-free factor is \prod_{i=1}^h p_i=\prod_{i=1}^k q_i. For example, if n=75600=2^4\cdot 3^3\cdot 5^2\cdot 7, one has q_1=7,\; q_2=5,\;q_3=3,\;q_4=2. The square-free part is , the square-free factor such that the quotient is a square is , and the largest square-free factor is . No algorithm is known for computing any of these square-free factors which is faster than computing the complete prime factorization. In particular, there is no known polynomial-time algorithm for computing the square-free part of an integer, or even for determining whether an integer is square-free. In contrast, polynomial-time algorithms are known for primality testing. This is a major difference between the arithmetic of the integers, and the arithmetic of the univariate polynomials, as polynomial-time algorithms are known for square-free factorization of polynomials (in short, the largest square-free factor of a polynomial is its quotient by the greatest common divisor of the polynomial and its formal derivative). ==Equivalent characterizations==

A positive integer n is square-free if and only if in the prime factorization of n, no prime factor occurs with an exponent larger than one. Another way of stating the same is that for every prime factor p of n, the prime p does not evenly divide n/p. Also n is square-free if and only if in every factorization n=ab, the factors a and b are coprime. An immediate result of this definition is that all prime numbers are square-free. A positive integer n is square-free if and only if all abelian groups of order n are isomorphic, which is the case if and only if any such group is cyclic. This follows from the classification of finitely generated abelian groups. A integer n is square-free if and only if the factor ring \mathbb{Z}/n\mathbb{Z} (see modular arithmetic) is a product of fields. This follows from the Chinese remainder theorem and the fact that a ring of the form \mathbb{Z}/k\mathbb{Z} is a field if and only if k is prime. For every positive integer n, the set of all positive divisors of n becomes a partially ordered set if we use divisibility as the order relation. This partially ordered set is always a distributive lattice. It is a Boolean algebra if and only if n is square-free. A positive integer n is square-free if and only if \mu(n)\ne 0, where \mu denotes the Möbius function. ==Dirichlet series==

The absolute value of the Möbius function is the indicator function for the square-free integers – that is, is equal to 1 if is square-free, and 0 if it is not. The Dirichlet series of this indicator function is :\sum_{n=1}^{\infty}\frac{n^{s}} = \frac{\zeta(s)}{\zeta(2s)}, where is the Riemann zeta function. This follows from the Euler product : \frac{\zeta(s)}{\zeta(2s) } =\prod_p \frac{(1-p^{-2s})}{(1-p^{-s})}=\prod_p (1+p^{-s}), where the products are taken over the prime numbers. ==Distribution==

Let Q(x) denote the number of square-free integers between 1 and x ( shifting index by 1). For large n, 3/4 of the positive integers less than n are not divisible by 4, 8/9 of these numbers are not divisible by 9, and so on. Because these ratios satisfy the multiplicative property (this follows from Chinese remainder theorem), we obtain the approximation: :\begin{align}Q(x) &\approx x\prod_{p\ \text{prime}} \left(1-\frac{1}{p^2}\right) = x\prod_{p\ \text{prime}} \frac{1}{(1-\frac{1}{p^2})^{-1}}\\ &=x\prod_{p\ \text{prime}} \frac{1}{1+\frac{1}{p^2}+\frac{1}{p^4}+\cdots} = \frac{x}{\sum_{k=1}^\infty \frac{1}{k^2}} = \frac{x}{\zeta(2)} = \frac{6x}{\pi^2}.\end{align} This argument can be made rigorous for getting the estimate (using big O notation) :Q(x) = \frac{6x}{\pi^2} + O\left(\sqrt{x}\right). Sketch of a proof: the above characterization gives :Q(x)=\sum_{n\leq x} \sum_{d^2\mid n} \mu(d)=\sum_{d\leq x} \mu(d)\sum_{n\leq x, d^2\mid n}1=\sum_{d\leq x} \mu(d)\left\lfloor\frac{x}{d^2}\right\rfloor; observing that the last summand is zero for d>\sqrt{x}, it follows that {{NumBlk|:|Q(x) = \sum_{d\leq\sqrt{x}} \mu(d)\left\lfloor\frac{x}{d^2}\right\rfloor|}} :\begin{align} \phantom{Q(x)} &= \sum_{d\leq\sqrt{x}} \frac{x\mu(d)}{d^2}+O\left(\sum_{d\leq\sqrt{x}} 1\right) =x\sum_{d\leq\sqrt{x}} \frac{\mu(d)}{d^2}+O(\sqrt{x})\\ &=x\sum_{d} \frac{\mu(d)}{d^2}+O\left(x\sum_{d>\sqrt{x}}\frac{1}{d^2}+\sqrt{x}\right) =\frac{x}{\zeta(2)}+O(\sqrt{x}). \end{align} By exploiting the largest known zero-free region of the Riemann zeta function Arnold Walfisz improved the approximation to :Q(x) = \frac{6x}{\pi^2} + O\left(x^{1/2}\exp\left(-c\frac{(\log x)^{3/5}}{(\log\log x)^{1/5}}\right)\right), for some positive constant . Under the Riemann hypothesis, the error term can be reduced to :Q(x) = \frac{x}{\zeta(2)} + O\left(x^{17/54+\varepsilon}\right) = \frac{6}{\pi^2}x + O\left(x^{17/54+\varepsilon}\right). In 2015 the error term was further reduced (assuming also Riemann hypothesis) to :Q(x) = \frac{6}{\pi^2}x + O\left(x^{11/35+\varepsilon}\right). The asymptotic/natural density of square-free numbers is therefore :\lim_{x\to\infty} \frac{Q(x)}{x} = \frac{6}{\pi^2}\approx 0.6079 Therefore over 3/5 of the integers are square-free. Likewise, if Q(x,n) denotes the number of n-free integers (e.g. 3-free integers being cube-free integers) between 1 and x, one can show :Q(x,n) = \frac{x}{\sum_{k=1}^\infty \frac{1}{k^n}} + O\left(\sqrt[n]{x}\right) = \frac{x}{\zeta(n)} + O\left(\sqrt[n]{x}\right). Since a multiple of 4 must have a square factor 4=22, it cannot occur that four consecutive integers are all square-free. On the other hand, there exist infinitely many integers n for which 4n +1, 4n +2, 4n +3 are all square-free. Otherwise, observing that 4n and at least one of 4n +1, 4n +2, 4n +3 among four could be non-square-free for sufficiently large n, half of all positive integers minus finitely many must be non-square-free and therefore :Q(x) \leq \frac{x}{2}+C for some constant C, contrary to the above asymptotic estimate for Q(x). There exist sequences of consecutive non-square-free integers of arbitrary length. Indeed, for every tuple of distinct primes, the Chinese remainder theorem guarantees the existence of an that satisfies the simultaneous congruence :n\equiv -i\pmod{p_i^2} \qquad (i=1, 2, \ldots, l). Each is then divisible by . On the other hand, the above-mentioned estimate Q(x) = 6x/\pi^2 + O\left(\sqrt{x}\right) implies that, for some constant c, there always exists a square-free integer between x and x+c\sqrt{x} for positive x. Moreover, an elementary argument allows us to replace x+c\sqrt{x} by x+cx^{1/5}\log x. The abc conjecture would allow x+x^{o(1)}. Computation of The squarefree integers can be identified and counted in time by using a modified Sieve of Eratosthenes. If only is desired, and not a list of the numbers that it counts, then () can be used to compute in time. The largest known value of , for , was computed by Jakub Pawlewicz in 2011 using an algorithm that achieves time, and an algorithm taking time has been outlined but not implemented. Table of Q(x), x, and R(x) The table shows how Q(x) and \frac{6}{\pi^2}x (with the latter rounded to one decimal place) compare at powers of 10. R(x) = Q(x) -\frac{6}{\pi^2}x , also denoted as \Delta(x) . : R(x) changes its sign infinitely often as x tends to infinity. The absolute value of R(x) is astonishingly small compared with x . ==Encoding as binary numbers==

If we represent a square-free number as the infinite product :\prod_{n=0}^\infty (p_{n+1})^{a_n}, a_n \in \lbrace 0, 1 \rbrace,\text{ and }p_n\text{ is the }n\text{th prime}, then we may take those a_n and use them as bits in a binary number with the encoding :\sum_{n=0}^\infty {a_n}\cdot 2^n . The square-free number 42 has factorization , or as an infinite product Thus the number 42 may be encoded as the binary sequence ...001011 or 11 decimal. (The binary digits are reversed from the ordering in the infinite product.) Since the prime factorization of every number is unique, so also is every binary encoding of the square-free integers. The converse is also true. Since every positive integer has a unique binary representation it is possible to reverse this encoding so that they may be decoded into a unique square-free integer. Again, for example, if we begin with the number 42, this time as simply a positive integer, we have its binary representation 101010. This decodes to Thus binary encoding of squarefree numbers describes a bijection between the nonnegative integers and the set of positive squarefree integers. (See sequences A019565, A048672 and A064273 in the OEIS.) ==Erdős squarefree conjecture==

The central binomial coefficient : {2n \choose n} is never squarefree for n > 4. This was proven in 1985 for all sufficiently large integers by András Sárközy, and for all integers > 4 in 1996 by Olivier Ramaré and Andrew Granville.{{cite journal ==Squarefree core==

Let us call "t-free" a positive integer that has no t-th power in its divisors. In particular, the 2-free integers are the square-free integers. The multiplicative function \mathrm{core}_t(n) maps every positive integer n to the quotient of n by its largest divisor that is a t-th power. That is, : \mathrm{core}_t(p^e) = p^{e\bmod t}. The integer \mathrm{core}_t(n) is t-free, and every t-free integer is mapped to itself by the function \mathrm{core}_t. The Dirichlet generating function of the sequence \left(\mathrm{core}_t(n) \right)_{n\in \N} is : \sum_{n\ge 1}\frac{\mathrm{core}_t(n)}{n^s} = \frac{\zeta(ts)\zeta(s-1)}{\zeta(ts-t)}. See also (t=2), (t=3) and (t=4). == Notes ==