We are given two numbers x and y. We know that a number p divides their product. Can we say for sure that p also divides one of them?
The answer is no. For example, consider x = 15, y = 6 and p = 9. p divides the product 15*6, but doesn’t divide any of them.
What if p is prime?
Euclid’s lemma states that if a prime p divides the product of two numbers (x*y), it must divide at least one of those numbers.
For example x = 15, y = 6 and p = 5. p divides the product 15*6, it also divides 15.
The idea is simple, since p is prime, it cannot be factorized. So it must either be completely present in x or in y.
Generalization of Euclid’s lemma:
If p divides x*y and p is relatively prime to x, then p must divide y. In the above example, 5 is relatively prime to 6, therefore it must divide 15.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- Count of pairs satisfying the given condition
- Count number of ways to cover a distance | Set 2
- Reduce a number to 1 by performing given operations | Set 2
- Minimum integer that can be obtained by swapping adjacent digits of different parity
- Jaro and Jaro-Winkler similarity
- Number of binary strings such that there is no substring of length ≥ 3
- Partitions possible such that the minimum element divides all the other elements of the partition
- Partition the digits of an integer such that it satisfies a given condition
- Count of possible arrays from prefix-sum and suffix-sum arrays
- Smallest number greater than n that can be represented as a sum of distinct power of k
- Find Kth smallest value for b such that a + b = a | b
- Number of pairs of lines having integer intersection points
- Percentage change in Hemisphere volume if radius is changed
- Program to find the time remaining for the day to complete