Articles by others on the same topic
A divisor of an integer is an integer satisfying the divisibility relation . Equivalently, for some integer . The word positive matters when listing or counting divisors: unless signs are restricted, both and qualify.
The positive divisors of areTheir negatives are also divisors of , giving twelve integer divisors altogether. The same list of positive divisors works for . One has only the positive divisor , while zero has every integer as a divisor, including zero under our divisibility convention. A nonzero integer never has zero as a divisor.
For a positive integer , the positive divisors come in pairs whose product is . For , the pairs are , and . Each pair contains a divisor at most , so searching through candidate divisors up to the square root suffices to find all pairs. A pair repeats its own member only when is a perfect square; for , the middle pair is . Consequently a positive integer has an odd number of positive divisors exactly when it is a perfect square.
The prime factorization gives another complete description. Since , its positive divisors are precisely with and . These independent choices give positive divisors, the value of the divisor function . A prime factor is one particular kind of divisor; , and show that divisors need not be prime numbers.
Thinking in pairs connects exact grouping with integer factorization: twelve objects can form three groups of four or four groups of three. Thinking in shared divisors gives the greatest common divisor; for and , the positive common divisors are , and the largest is .