
n.
The quantity by which another quantity, the dividend, is to be divided.
On this page
American Heritage Dictionary:
di·vi·sor |

|
Featured Videos:
|
Random House Word Menu:
categories related to 'divisor' |

Rhymes:
divisor |
Wikipedia on Answers.com:
Divisor |
In mathematics, a divisor of an integer n, also called a factor of n, is an integer which divides n without leaving a remainder.
|
Contents
|
The name "divisor" comes from the arithmetic operation of division: if a / b = c then a is the dividend, b the divisor, and c the quotient.
In general, for non-zero integers m and n, m divides n, written:

if there exists an integer k such that n = km. Thus, divisors can be negative as well as positive, although sometimes the term is restricted to positive divisors. (For example, there are six divisors of four, 1, 2, 4, −1, −2, −4, but only the positive ones would usually be mentioned, i.e. 1, 2, and 4.)
1 and −1 divide (are divisors of) every integer, every integer (and its negation) is a divisor of itself, and every integer is a divisor of 0, except by convention 0 itself (see also division by zero). Numbers divisible by 2 are called even and numbers not divisible by 2 are called odd.
1, −1, n and −n are known as the trivial divisors of n. A divisor of n that is not a trivial divisor is known as a non-trivial divisor. A number with at least one non-trivial divisor is known as a composite number, while the units -1 and 1 and prime numbers have no non-trivial divisors.
There are divisibility rules which allow one to recognize certain divisors of a number from the number's digits.
The generalization can be said to be the concept of divisibility in any integral domain.
. It can also be said that 42 is divisible by 7, 42 is a multiple of 7, 7 divides 42, or 7 is a factor of 42.There are some elementary rules:
and
, then
. This is the transitive relation.
and
, then a = b or a = − b.
and
, then it is NOT always true that
(e.g.
and
but 5 does not divide 6). However, when
and
, then
is true, as is
.[1]The vertical bar used is a Unicode "Divides" character, code point U+2223 and written in TeX as \mid:
. Its negated symbol is ∤, or written in TeX as \nmid:
. In an ASCII-only environment, the standard vertical bar "|", which is slightly shorter, is often used.
If
, and gcd(a,b) = 1, then
. This is called Euclid's lemma.
If p is a prime number and
then
or
(or both).
A positive divisor of n which is different from n is called a proper divisor or an aliquot part of n. A number that 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. Equivalently, a prime number is a positive integer which has exactly two positive factors: 1 and itself.
Any positive divisor of n is a product of prime divisors of n raised to some power. This is a consequence of the fundamental theorem of arithmetic.
If a number equals the sum of its proper divisors, it is said to be a perfect number. Numbers less than the sum of their proper divisors are said to be abundant, while numbers greater than that sum are said to be deficient.
The total number of positive divisors of n is a multiplicative function d(n), meaning that when two numbers m and n are relatively prime, then
. For instance,
; the eight divisors of 42 are 1, 2, 3, 6, 7, 14, 21 and 42). However the number of positive divisors is not a totally multiplicative function: if the two numbers m and n share a common divisor, then it might not be true that
. The sum of the positive divisors of n is another multiplicative function σ(n) (e.g.
). Both of these functions are examples of divisor functions.
If the prime factorization of n is given by

then the number of positive divisors of n is

and each of the divisors has the form

where
for each 
It can be shown that for any natural n the inequality
holds.
Also it can be shown [2] that

One interpretation of this result is that a randomly chosen positive integer n has an expected number of divisors of about ln n.
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 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.
Similarly, 
|
||||||||||||||||||||||
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
Translations:
Divisor |
Dansk (Danish)
n. - divisor, tal der går op
Français (French)
n. - (Math) diviseur
Deutsch (German)
n. - Teiler, Divisor
Ελληνική (Greek)
n. - (μαθημ.) διαιρέτης
Português (Portuguese)
n. - divisor (m)
Español (Spanish)
n. - divisor
Svenska (Swedish)
n. - matem. divisor
中文(简体)(Chinese (Simplified))
除数, 约数, 公约数
中文(繁體)(Chinese (Traditional))
n. - 除數, 約數, 公約數
العربيه (Arabic)
(الاسم) القاسم, المقسوم عليه
If you are unable to view some languages clearly, click here.
To select your translation preferences click here.
| common factor (mathematics) | |
| gcd (abbreviation) | |
| exact divisor (mathematics) |
| What are the divisors of 24? Read answer... | |
| What are the divisors of 48? Read answer... | |
| What is the the largest four-digit divisor that has exactly three divisors? Read answer... |
| What is the Rule for estimating divisor if 2nd digit of divisor is 0-4? | |
| Divisors of 400? | |
| What are the divisor of 21? |
Copyrights:
![]() |
![]() | American Heritage Dictionary. The American Heritage® Dictionary of the English Language, Fourth Edition Copyright © 2007, 2000 by Houghton Mifflin Company. Updated in 2009. Published by Houghton Mifflin Company. All rights reserved. Read more |
![]() |
![]() | Random House Word Menu. © 2010 Write Brothers Inc. Word Menu is a registered trademark of the Estate of Stephen Glazier. Write Brothers Inc. All rights reserved. Read more |
| Rhymes. Oxford University Press. © 2006, 2007 All rights reserved. Read more | ||
![]() |
![]() | Bradford's Crossword Solver's Dictionary. Collins Bradford's Crossword Solver's Dictionary © Anne Bradford, 1986, 1993, 1997, 2000, 2003, 2005, 2008 HarperCollins Publishers All rights reserved. Read more |
![]() |
![]() | Wikipedia on Answers.com. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article Divisor. Read more |
![]() | Translations. Copyright © 2007, WizCom Technologies Ltd. All rights reserved. Read more |
Mentioned in