Difference between revisions of "Multiple"

m (added modular arithmetic info)
(One intermediate revision by one other user not shown)
Line 4: Line 4:
  
 
An equivalent phrasing is that <math>k</math> is a multiple of <math>m</math> exactly when <math>k</math> is [[divisibility | divisble by]] <math>m</math>.
 
An equivalent phrasing is that <math>k</math> is a multiple of <math>m</math> exactly when <math>k</math> is [[divisibility | divisble by]] <math>m</math>.
 +
 +
In Modular Arithmetic, multiples of the modulus, are congruent to 0
  
 
== See also ==
 
== See also ==
Line 9: Line 11:
 
*[[Least common multiple]]
 
*[[Least common multiple]]
  
[[Category:Number Theory]]
+
[[Category:Number theory]]

Revision as of 18:21, 26 February 2020

A multiple of a given integer is the product of that integer with some other integer. Thus $k$ is a multiple of $m$ only if $k$ can be written in the form $mn$, where $m$ and $n$ are integers. (In this case, $k$ is a multiple of $n$, as well).

Every nonzero integer has an infinite number of multiples. As an example, some of the multiples of 15 are 15, 30, 45, 60, and 75.

An equivalent phrasing is that $k$ is a multiple of $m$ exactly when $k$ is divisble by $m$.

In Modular Arithmetic, multiples of the modulus, are congruent to 0

See also