Prime Divisor — Definition, Formula & Examples
A prime divisor of an integer is a prime number that divides that integer with no remainder. For example, the prime divisors of 30 are 2, 3, and 5 because each one divides 30 evenly.
A prime divisor of a positive integer is a prime number such that (that is, for some positive integer ). The set of all prime divisors of consists of the distinct prime numbers appearing in the prime factorization of .
How It Works
To find the prime divisors of a number, break it down into its prime factorization and then list each distinct prime that appears. You only list each prime once, regardless of how many times it shows up in the factorization. For instance, , so its prime divisors are just 2 and 3. Prime divisors help you determine shared factors between numbers, check divisibility, and simplify fractions.
Worked Example
Problem: Find all the prime divisors of 180.
Step 1: Divide 180 by the smallest prime, 2.
Step 2: Continue dividing by 2.
Step 3: 45 is not divisible by 2, so try 3.
Step 4: Continue dividing by 3.
Step 5: 5 is prime, so stop. The full prime factorization is:
Step 6: List each distinct prime that appears in the factorization.
Answer: The prime divisors of 180 are 2, 3, and 5.
Another Example
Problem: Find all the prime divisors of 48.
Step 1: Find the prime factorization of 48 by repeated division.
Step 2: List each distinct prime. Even though 2 appears four times, it counts as one prime divisor.
Answer: The prime divisors of 48 are 2 and 3.
Visualization
Why It Matters
Prime divisors are central to topics in pre-algebra and number theory courses, especially when computing the greatest common factor or least common multiple of two numbers. Cryptography systems like RSA rely on the difficulty of finding the prime divisors of very large numbers. Understanding prime divisors also helps you simplify fractions and recognize perfect squares or cubes.
Common Mistakes
Mistake: Listing a prime multiple times because it appears more than once in the factorization.
Correction: Prime divisors are the distinct primes only. For , list 2 and 3 once each, not 2, 2, 2, 3, 3.
Mistake: Including 1 as a prime divisor.
Correction: 1 is not a prime number, so it is never a prime divisor of any integer.
