User interface language: English | Español

6.2

Path: 

Description

[N/A]

Directly related questions


Sub sections and their related questions

\(\left. a \right|b \Rightarrow b = na\) for some \(n \in \mathbb{Z}\) .

The theorem \(\left. a \right|b\) and \(\left. a \right|c \Rightarrow \left. a \right|(bx \pm cy)\) where \(x,y \in \mathbb{Z}\) .

Division and Euclidean algorithms.

The greatest common divisor, gcd(\(a\),\(b\)), and the least common multiple, lcm(\(a\),\(b\)), of integers \(a\) and \(b\).

Prime numbers; relatively prime numbers and the fundamental theorem of arithmetic.