Difference between revisions of "Relatively prime"
m (proofreading) |
IntrepidMath (talk | contribs) |
||
| Line 5: | Line 5: | ||
Note that for relatively prime <math>{m}</math> and <math>{n}</math>, <math>\frac{m}{n}</math> will be in lowest terms. | Note that for relatively prime <math>{m}</math> and <math>{n}</math>, <math>\frac{m}{n}</math> will be in lowest terms. | ||
| − | Relatively prime numbers show up frequently in [[number theory]] formulas and derivations. [[Euler's totient function]], for example, determines the number of positive integers less than any given positive integer that are relatively prime to that number. | + | Relatively prime numbers show up frequently in [[number theory]] formulas and derivations. [[Euler's totient function]], for example, determines the number of positive integers less than any given positive integer that are relatively prime to that number. The [[Chicken mcNugget theorem]] also involves reletively prime numbers. |
Revision as of 13:39, 19 June 2006
(Also called coprime.)
Two relatively prime integers 
and 
share no common factors. Alternatively, and must have no prime factors in common. For example, 15 and 14 are relatively prime; as the prime factorization of 15 is 
, the prime factorization of 14 is 
, and no prime factors are shared between the two.
Note that for relatively prime and , 
will be in lowest terms.
Relatively prime numbers show up frequently in number theory formulas and derivations. Euler's totient function, for example, determines the number of positive integers less than any given positive integer that are relatively prime to that number. The Chicken mcNugget theorem also involves reletively prime numbers.
