Look up coprime in Wiktionary, the free dictionary. 
In number theory, two integers a and b are said to be relatively prime, mutually prime,^{[1]} or coprime (also written coprime) if the only positive integer (factor) that divides both of them is 1. Consequently, any prime number that divides one does not divide the other. This is equivalent to their greatest common divisor (gcd) being 1.^{[2]}
The numerator and denominator of a reduced fraction are coprime. As specific examples, 14 and 15 are coprime, being commonly divisible only by 1, while 14 and 21 are not coprime, because they are both divisible by 7.
Standard notations for relatively prime integers a and b are: gcd(a, b) = 1 and (a, b) = 1. Graham, Knuth and Patashnik have proposed that the notation be used to indicate that a and b are relatively prime and that the term "prime" be used instead of coprime (as in a is prime to b).^{[3]}
A fast way to determine whether two numbers are coprime is given by the Euclidean algorithm and its faster variants such as binary GCD algorithm or Lehmer's GCD algorithm.
The number of integers coprime to a positive integer n, between 1 and n, is given by Euler's totient function (or Euler's phi function) φ(n).
A set of integers can also be called coprime if its elements share no common positive factor except 1. A stronger condition on a set of integers is pairwise coprime, which means that a and b are coprime for every pair (a, b) of different integers in the set. The set {2, 3, 4} is coprime, but it is not pairwise coprime since 2 and 4 are not relatively prime.
YouTube Encyclopedic

1/5Views:34 28610 801137 53671 86712 051

✪ coprime numbers#types of number oe number systems /examples and definition (hindi)

✪ (Abstract Algebra 1) Relatively Prime Integers

✪ Coprime Numbers Tutorial

✪ Co Prime, Twin Prime and Prime Triplets

✪ Coprime numbers
Transcription
Contents
Properties
The numbers 1 and −1 are the only integers coprime to every integer, and they are the only integers that are coprime with 0.
A number of conditions are equivalent to a and b being coprime:
 No prime number divides both a and b.
 There exist integers x and y such that ax + by = 1 (see Bézout's identity).
 The integer b has a multiplicative inverse modulo a, meaning that there exists an integer y such that by ≡ 1 (mod a). In ringtheoretic language, b is a unit in the ring Z/aZ of integers modulo a.
 Every pair of congruence relations for an unknown integer x, of the form x ≡ k (mod a) and x ≡ m (mod b), has a solution (Chinese remainder theorem); in fact the solutions are described by a single congruence relation modulo ab.
 The least common multiple of a and b is equal to their product ab, i.e. lcm(a, b) = ab.^{[4]}
As a consequence of the third point, if a and b are coprime and br ≡ bs (mod a), then r ≡ s (mod a).^{[5]} That is, we may "divide by b" when working modulo a. Furthermore, if b_{1} and b_{2} are both coprime with a, then so is their product b_{1}b_{2} (i.e., modulo a it is a product of invertible elements, and therefore invertible);^{[6]} this also follows from the first point by Euclid's lemma, which states that if a prime number p divides a product bc, then p divides at least one of the factors b, c.
As a consequence of the first point, if a and b are coprime, then so are any powers a^{k} and b^{m}.
If a and b are coprime and a divides the product bc, then a divides c.^{[7]} This can be viewed as a generalization of Euclid's lemma.
The two integers a and b are coprime if and only if the point with coordinates (a, b) in a Cartesian coordinate system is "visible" from the origin (0,0), in the sense that there is no point with integer coordinates on the line segment between the origin and (a, b). (See figure 1.)
In a sense that can be made precise, the probability that two randomly chosen integers are coprime is 6/π^{2} (see pi), which is about 61%. See below.
Two natural numbers a and b are coprime if and only if the numbers 2^{a} − 1 and 2^{b} − 1 are coprime.^{[8]} As a generalization of this, following easily from the Euclidean algorithm in base n > 1:
Coprimality in sets
A set of integers S = {a_{1}, a_{2}, .... a_{n}} can also be called coprime or setwise coprime if the greatest common divisor of all the elements of the set is 1. For example, the integers 6, 10, 15 are coprime because 1 is the only positive integer that divides all of them.
If every pair in a set of integers is coprime, then the set is said to be pairwise coprime (or pairwise relatively prime, mutually coprime or mutually relatively prime). Pairwise coprimality is a stronger condition than setwise coprimality; every pairwise coprime finite set is also setwise coprime, but the reverse is not true. For example, the integers 4, 5, 6 are (setwise) coprime (because the only positive integer dividing all of them is 1), but they are not pairwise coprime (because gcd(4, 6) = 2).
The concept of pairwise coprimality is important as a hypothesis in many results in number theory, such as the Chinese remainder theorem.
It is possible for an infinite set of integers to be pairwise coprime. Notable examples include the set of all prime numbers, the set of elements in Sylvester's sequence, and the set of all Fermat numbers.
Coprimality in ring ideals
Two ideals A and B in the commutative ring R are called coprime (or comaximal) if A + B = R. This generalizes Bézout's identity: with this definition, two principal ideals (a) and (b) in the ring of integers Z are coprime if and only if a and b are coprime. If the ideals A and B of R are coprime, then AB = A∩B; furthermore, if C is a third ideal such that A contains BC, then A contains C. The Chinese remainder theorem can be generalized to any commutative ring, using coprime ideals.
Probability of coprimality
Given two randomly chosen integers a and b, it is reasonable to ask how likely it is that a and b are coprime. In this determination, it is convenient to use the characterization that a and b are coprime if and only if no prime number divides both of them (see Fundamental theorem of arithmetic).
Informally, the probability that any number is divisible by a prime (or in fact any integer) is ; for example, every 7th integer is divisible by 7. Hence the probability that two numbers are both divisible by p is , and the probability that at least one of them is not is . Any finite collection of divisibility events associated to distinct primes is mutually independent. For example, in the case of two events, a number is divisible by primes p and q if and only if it is divisible by pq; the latter event has probability 1/pq. If one makes the heuristic assumption that such reasoning can be extended to infinitely many divisibility events, one is led to guess that the probability that two numbers are coprime is given by a product over all primes,
Here ζ refers to the Riemann zeta function, the identity relating the product over primes to ζ(2) is an example of an Euler product, and the evaluation of ζ(2) as π^{2}/6 is the Basel problem, solved by Leonhard Euler in 1735.
There is no way to choose a positive integer at random so that each positive integer occurs with equal probability, but statements about "randomly chosen integers" such as the ones above can be formalized by using the notion of natural density. For each positive integer N, let P_{N} be the probability that two randomly chosen numbers in are coprime. Although P_{N} will never equal exactly, with work^{[9]} one can show that in the limit as , the probability approaches .
More generally, the probability of k randomly chosen integers being coprime is .
Generating all coprime pairs
All pairs of positive coprime numbers (with ) can be arranged in two disjoint complete ternary trees, one tree starting from (for evenodd and oddeven pairs),^{[10]} and the other tree starting from (for oddodd pairs).^{[11]} The children of each vertex are generated as follows:
 Branch 1:
 Branch 2:
 Branch 3:
This scheme is exhaustive and nonredundant with no invalid members.
See also
Notes
 ^ Eaton, James S. Treatise on Arithmetic. 1872. May be downloaded from: https://archive.org/details/atreatiseonarit05eatogoog
 ^ Hardy & Wright 2008, p. 6
 ^ Graham, R. L.; Knuth, D. E.; Patashnik, O. (1989), Concrete Mathematics / A Foundation for Computer Science, AddisonWesley, p. 115, ISBN 0201142368
 ^ Ore 1988, p. 47
 ^ Niven & Zuckerman 1966, p. 22, Theorem 2.3(b)
 ^ Niven & Zuckerman 1966, p. 6, Theorem 1.8
 ^ Niven & Zuckerman 1966, p.7, Theorem 1.10
 ^ Rosen 1992, p. 140
 ^ This theorem was proved by Ernesto Cesàro in 1881. For a proof, see Hardy & Wright 2008, Theorem 332
 ^ Saunders, Robert & Randall, Trevor (July 1994), "The family tree of the Pythagorean triplets revisited", Mathematical Gazette, 78: 190–193, doi:10.2307/3618576.
 ^ Mitchell, Douglas W. (July 2001), "An alternative characterisation of all primitive Pythagorean triples", Mathematical Gazette, 85: 273–275, doi:10.2307/3622017.
References
 Hardy, G.H.; Wright, E.M. (2008), An Introduction to the Theory of Numbers (6th ed.), Oxford University Press, ISBN 9780199219865
 Niven, Ivan; Zuckerman, Herbert S. (1966), An Introduction to the Theory of Numbers (2nd ed.), John Wiley & Sons
 Ore, Oystein (1988) [1948], Number Theory and Its History, Dover, ISBN 9780486656205
 Rosen, Kenneth H. (1992), Elementary Number Theory and its Applications (3rd ed.), AddisonWesley, ISBN 9780201578898
Further reading
 Lord, Nick (March 2008), "A uniform construction of some infinite coprime sequences", Mathematical Gazette, 92: 66–70.