Introduction
Prime numbers have exactly two positive divisors: 1 and the number itself. Divisibility rules help identify possible factors efficiently.
Concept
A prime number is an integer greater than 1 with exactly two distinct positive factors.
Mnemonic
Prime means precisely two positive factors: one and itself.
Explanation
To test whether an integer is prime, check whether it has any prime divisor no greater than its square root. Divisibility tests can reduce the amount of trial division needed.
Step By Step
Check whether the number is greater than 1.
Check divisibility by 2, 3 and 5 where applicable.
Test other prime divisors up to the square root of the number.
If no such divisor exists, the number is prime.
Examples
| Problem | Solution | Result |
|---|---|---|
Is 29 prime? | 29 is not divisible by 2, 3 or 5. Its square root is less than 6, so there are no other prime divisors to test. | 29 is prime. |
Is 35 prime? | 35 is divisible by 5 and 7. | 35 is composite. |
Limitations
The number 1 is neither prime nor composite. The square-root test requires checking all relevant prime divisors up to that limit.
Common Mistakes
Calling 1 a prime number.
Assuming every odd number is prime.
Checking divisibility only by 2.
Practice
Identify whether 17 is prime.
Identify whether 51 is prime.
Explain why 2 is the only even prime number.