Problem:
Let and be positive integers such that . Prove that there are distinct primes such that divides for .
Problem:
Let and be positive integers such that . Prove that there are distinct primes such that divides for .
Solution:
If some number , , has at least distinct prime factors, then we can associate a prime factor of with the number which is not associated with any of the remaining numbers.
Suppose has less than distinct prime factors. Write
But . Hence there exist , such that . Associate with this . Suppose is associated with some . Let be the largest power of dividing . Then . Let . Then . Since and , it follows that . But and , and we get a contradiction. This shows that cannot be associated with any other . Thus each is associated with different primes.