Andere Kunden interessierten sich auch für
![Integer Lattice]( "Integer Lattice")
Integer Lattice22,99 €![The Square Root of Two to One Million Digits]( "The Square Root of Two to One Million Digits")
The Square Root of Two to One Million Digits16,99 €![Math Mammoth Square Roots & the Pythagorean Theorem]( "Math Mammoth Square Roots & the Pythagorean Theorem")
Math Mammoth Square Roots & the Pythagorean Theorem18,99 €![The Complete Guide to the Sagrada Familia Magic Square]( "The Complete Guide to the Sagrada Familia Magic Square")
The Complete Guide to the Sagrada Familia Magic Square11,99 €![Optimization of Integer/Fractional Order Chaotic Systems by Metaheuristics and their Electronic Realization]( "Optimization of Integer/Fractional Order Chaotic Systems by Metaheuristics and their Electronic Realization")
Optimization of Integer/Fractional Order Chaotic Systems by Metaheuristics and their Electronic Realization205,99 €![Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control]( "Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control")
Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control106,99 €![Square Matrices of Order 2]( "Square Matrices of Order 2")
Square Matrices of Order 248,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, a square-free, or quadratfrei, integer is one divisible by no perfect square, except 1. For example, 10 is square-free but 18 is not, as it is divisible by 9 = 32. The smallest square-free numbers are: 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, ... Ring theory generalizes the concept of being square-free. The positive integer n is square-free if and only if in the prime factorization of n, no prime number occurs more than once. Another way of stating the same is that for every prime factor p of n, the prime p does not divide n / p. Yet another formulation: 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.