Art of Problem Solving

Multiple: Difference between revisions

1=2 (talk | contribs)
No edit summary
Aditya404 (talk | contribs)
No edit summary
 
(4 intermediate revisions by 4 users not shown)
Line 1: Line 1:
A '''multiple''' of a given [[integer]] is the product of that integer with some other integer. Thus <math>k</math> is a multiple of <math>m</math> exactly when <math>k</math> can be written in the form <math>nm</math> where <math>n</math> and <math>m</math> are integers. (In this case, <math>k</math> is a multiple of <math>n</math>, as well).  Every integer has an [[infinite]] number of multiples. As an example, a few of the multiples of 15 are 15, 30, 45, 60, and 75.  A few of the multiples of 3 are 3, 6, 9, 12, and 15.
What are multiples and diVisors: https://youtu.be/ij5_vWBxZoU
 
A '''multiple''' of a given [[integer]] is the product of that integer with some other integer. Thus <math>k</math> is a multiple of <math>m</math> only if <math>k</math> can be written in the form <math>mn</math>, where <math>m</math> and <math>n</math> are integers. (In this case, <math>k</math> is a multiple of <math>n</math>, 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 <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 ==
*[[Common multiple]]
*[[Common multiple]]
*[[Least common multiple]]
*[[Least common multiple]]
[[Category:Number Theory]]
 
[[Category:Number theory]]

Latest revision as of 21:51, 26 January 2021

What are multiples and diVisors: https://youtu.be/ij5_vWBxZoU

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