# Difference between revisions of "Multiple"

m (added modular arithmetic info) |
|||

Line 1: | Line 1: | ||

+ | 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). | 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). | ||

## Latest revision as of 22: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 is a multiple of only if can be written in the form , where and are integers. (In this case, is a multiple of , 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 is a multiple of exactly when is divisble by .

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