Search results
Results from the WOW.Com Content Network
An integer is square-free if and only if it is equal to its radical. Every positive integer 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.
A perfect totient number is an integer that is equal to the sum of its iterated totients. That is, we apply the totient function to a number n, apply it again to the resulting totient, and so on, until the number 1 is reached, and add together the resulting sequence of numbers; if the sum equals n, then n is a perfect totient number.
The square root of any integer is a quadratic integer, as every integer can be written n = m 2 D, where D is a square-free integer, and its square root is a root of x 2 − m 2 D = 0. The fundamental theorem of arithmetic is not true in many rings of quadratic integers.
The radical of any integer is the largest square-free divisor of and so also described as the square-free kernel of . [2] There is no known polynomial-time algorithm for computing the square-free part of an integer.
A non-negative integer is a square number when its square root is again an integer. For example, =, so 9 is a square number. A positive integer that has no square divisors except 1 is called square-free. For a non-negative integer n, the n th square number is n 2, with 0 2 = 0 being the zeroth one. The concept of square can be extended to some ...
In algebraic number theory, a quadratic field is an algebraic number field of degree two over , the rational numbers. Every such quadratic field is some Q ( d ) {\displaystyle \mathbf {Q} ({\sqrt {d}})} where d {\displaystyle d} is a (uniquely defined) square-free integer different from 0 {\displaystyle 0} and 1 {\displaystyle 1} .
In mathematics, a square-free element is an element r of a unique factorization domain R that is not divisible by a non-trivial square. This means that every s such that s 2 ∣ r {\displaystyle s^{2}\mid r} is a unit of R .
An integer that occurs as the discriminant of a quadratic number field is called a fundamental discriminant. [3] Cyclotomic fields: let n > 2 be an integer, let ζ n be a primitive nth root of unity, and let K n = Q(ζ n) be the nth cyclotomic field. The discriminant of K n is given by [2] [4]