Difference between revisions of "Mutually-prime numbers"
From Encyclopedia of Mathematics
(Importing text file) |
(TeX) |
||
| Line 1: | Line 1: | ||
| + | {{TEX|done}} | ||
''coprimes, relatively-prime numbers'' | ''coprimes, relatively-prime numbers'' | ||
| − | Integers without common (prime) divisors. The [[Greatest common divisor|greatest common divisor]] of two coprimes | + | Integers without common (prime) divisors. The [[Greatest common divisor|greatest common divisor]] of two coprimes $a$ and $b$ is 1, which is usually written as $(a,b)=1$. If $a$ and $b$ are coprime, there exist numbers $u$ and $v$, $|u|<|b|$, $|v|<|a|$, such that $au+bv=1$. |
The concept of being coprime may also be applied to polynomials and, more generally, to elements of a [[Euclidean ring|Euclidean ring]]. | The concept of being coprime may also be applied to polynomials and, more generally, to elements of a [[Euclidean ring|Euclidean ring]]. | ||
Revision as of 14:48, 15 April 2014
coprimes, relatively-prime numbers
Integers without common (prime) divisors. The greatest common divisor of two coprimes $a$ and $b$ is 1, which is usually written as $(a,b)=1$. If $a$ and $b$ are coprime, there exist numbers $u$ and $v$, $|u|<|b|$, $|v|<|a|$, such that $au+bv=1$.
The concept of being coprime may also be applied to polynomials and, more generally, to elements of a Euclidean ring.
Comments
References
| [a1] | I.M. Vinogradov, "Elements of number theory" , Dover, reprint (1954) (Translated from Russian) |
How to Cite This Entry:
Mutually-prime numbers. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Mutually-prime_numbers&oldid=12368
Mutually-prime numbers. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Mutually-prime_numbers&oldid=12368