Difference between revisions of "Divisibility"
Etmetalakret (talk | contribs) (I want to overhaul this stub into a ginormous handout on divisibility.) |
Etmetalakret (talk | contribs) |
||
Line 12: | Line 12: | ||
* [[Diophantine equations]] | * [[Diophantine equations]] | ||
− | [[Category:Number | + | [[Category:Number theory]] |
[[Category:Definition]] | [[Category:Definition]] |
Revision as of 15:11, 29 April 2023
In number theory, divisibility is the ability of a number to evenly divide another number. The study of divisibility resides at the heart of number theory, constituting the backbone to countless fields of mathematics. Within number theory, the study of arithmetic functions, modular arithmetic, and Diophantine equations all depend on divisibility for rigorous foundation.
A divisor of an integer is an integer that can be multiplied by some integer to produce . We may equivalently state that is a multiple of , and that is divisible or evenly divisible by .
Definition
An integer is divisible by a nonzero integer if there exists some integer such that . We may write this relation as An alternative definition of divisibility is that the fraction is an integer — or using modular arithmetic, that . If does not divide , we write that .