Definition:Divisor/Integers

From ProofWiki
Jump to: navigation, search

Definition

Let $\left({\Z, +, \times}\right)$ be the integral domain of integers.

Let $x, y \in \Z$.


Then $x$ divides $y$ is defined as:

$x \mathop \backslash y \iff \exists t \in \Z: y = t \times x$


The conventional notation for this is "$x \mid y$", but there is a growing trend to follow the notation above, as espoused by Knuth etc. [1]


If $x \mathop \backslash y$, then:

  • $x$ is a divisor (or factor) of $y$
  • $y$ is a multiple of $x$
  • $y$ is divisible by $x$.


To indicate that $x$ does not divide $y$, we write $x \nmid y$.


References

  1. Ronald L. Graham Donald E. Knuth and Oren Patashnik: Concrete Mathematics: A Foundation for Computer Science (1989).
"The notation '$m \mid n$' is actually much more common than '$m \mathop \backslash n$' in current mathematics literature. But vertical lines are overused - for absolute values, set delimiters, conditional probabilities, etc. - and backward slashes are underused. Moreover, '$m \mathop \backslash n$' gives an impression that $m$ is the denominator of an implied ratio. So we shall boldly let our divisibility symbol lean leftward."


Sources

Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense