Question

Show that a composite number has at least one prime divisor.

Answer 1

Step-by-step explanation:

Any composite number n must have a prime divisor not exceed- ing the square root of n. not be greater than √ n (i.e., a ≤ √ n). By the lemma proved earlier, we know that a has a prime divisor (which is ≤ √ n) so n has the same prime divisor. them divide p, you have proved that p is prime.