- For divisors in algebraic geometry, see divisor (algebraic geometry).
For example, 7 is a divisor of 42 because 42/7 = 6. We also say 42 is divisible by 7 or 42 is a multiple of 7 or 7 divides 42 and we usually write 7 | 42. For example, the positive divisors of 42 are 1, 2, 3, 6, 7, 14, 21, 42.
In general, we say m|n (read: m divides n) for any integers m and n iff there exists an integer k such that n = km. Thus, divisors can be negative as well as positive. 1 and -1 are divisors of every integer, every integer is a divisor of itself, and every integer is a divisor of 0, while 0 is a divisor only of 0 (see also division by zero). Numbers divisible by 2 are called even and those that are not are called odd.
There are some rules which allow to recognize small divisors of a number from the number's decimal digits.
Further notions and facts
Some elementary rules:
- If a | b and a | c, then a | (b + c), in fact, a | (b m + c n) for all integers m, n.
- If a | b and b | c, then a | c. (transitive relation)
- If a | b and b | a, then a = b or a = -b.
The following property is important:
- If a | b c, and gcd(a,b) = 1, then a | c. (Euclid's lemma)
A positive divisor of n which is different from n is called a proper divisor (or aliquot part) of n. (A number which does not evenly divide n, but leaves a remainder, is called an aliquant part of n.)
An integer n > 1 whose only proper divisor is 1 is called a prime number.
If a number equals the sum of its proper divisors, it is said to be a perfect number. Numbers less than that sum are said to be deficient, while numbers greater than that sum are said to be abundant.
The total number of positive divisors of n is a multiplicative function d(n) (e.g. d(42) = 8 = 2×2×2 = d(2)×d(3)×d(7)). The sum of the positive divisors of n is another multiplicative function σ(n) (e.g. σ(42) = 96 = 3×4×8 = σ(2)×σ(3)×σ(7)).
If the prime factorization of n is given by
then the number of positive divisors of n is
- d(n) = (ν1 + 1)(ν2 + 1)...(νn + 1),
and each of the divisors has the form
Divisibility of numbers
The relation | of divisibility turns the set N of non-negative integers into a partially ordered set, in fact into a complete distributive lattice. The largest element of this lattice is 0 and the smallest one is 1. The meet operation ^ is given by the greatest common divisor and the join operation v by the least common multiple. This lattice is isomorphic to the dual of the lattice of subgroups of the infinite cyclic group Z.
If an integer n is written in base b, and d is an integer with b ≡ 1 (mod d), then n is divisible by d if and only if the sum of its digits is divisible by d. The rules for d=3 and d=9 given above are special cases of this result (b=10).
We can generalize this method even further to find how to check divisibility of any integer in any base by any other (smaller integer). Let us say that we want to determine if d | a in base b. Then we first find a pair of integers (n, k) that solves the congruence bn ≡ k (mod d). Now rather than summing the digits, we take a (which has m digits) and multiply the first m-n digits by k and add the product to the last (or more precisely, smallest) k digits and repeat if necessary. If the result is a multiple of d then the original number is divisible by d. A few examples will help demonstrate this. Since 103 ≡ 1 (mod 37) then the number 1523836638 gives 1+523+836+638 = 1998 which gives 999 which we know is divisible by 37 due to the above congruence. Again, 102 ≡ 2 (mod 7) so 43106 gives 431×2 + 06 = 868 which gives 8×2+68 = 84 which is easily noted as being a multiple of 7. Note that there is no unique triple (n, k, d) since for example 10 ≡ 3 (mod 7) so we could also have done 4310×3 + 6 = 12936 and 1293×3 + 6 = 3885 and 388×3 + 5 = 1169 and 116×3 + 9 = 357 and 35×3 + 7 = 112 and 11×3 + 2 = 35 and 3×3 + 5 = 14 and 1×3 + 4 = 7. Clearly this is not always efficient but note that each number in this series, 43106, 12936, 3885, 1169, 357, 112, 35, 14, 7 is a multiple of 7 and many series could contain trivially identifiable multiples. This method is not necessarily useful for some numbers (for example 104 ≡ 4 (mod 17) is the first n where k < 10) but lends itself to fast calculations in other cases where n and k are relatively small.
One can talk about the concept of divisibility in any integral domain. Please see that article for the definitions in that setting.
- Table of prime factors — A table of prime factors for 1-1000
- Table of divisors — A table of prime and non-prime divisors for 1-1000
- Euler's totient function
- Divisibility rule
- Factoring Calculator -- Factoring calculator that displays the prime factors and the prime and non-prime divisors of a given number.
- webpage that has program for factoring up to 18 digit numberscs:Dělitelnost