Prime Numbers

Primes are the multiplicative atoms of whole numbers. They support factorization, number theory, common-denominator work, and modern encryption.

Intuition and core definition

A prime number is a whole number greater than $1$ with exactly two positive factors: $1$ and itself. A composite number greater than $1$ has more than two positive factors. The number $1$ is neither because it has only one positive factor; $2$ is the only even prime.

Notation, language, and conditions

For an integer $n>1$, it is enough to test prime divisors up to $\sqrt n$. If $n=ab$ is composite, at least one factor must be at most $\sqrt n$. A proof that a number is prime must rule out every possible prime divisor in that range, not merely show that several small numbers fail.

Why this idea matters

Prime numbers have exactly two positive factors and act as the irreducible pieces from which every positive integer above one is built.

A dependable method

1. Handle boundary cases: numbers at most $1$ are not prime.
2. Check divisibility by $2,3,5,7,\ldots$ up to $\sqrt n$.
3. If any division has remainder zero, display the nontrivial factor pair and classify the number as composite.
4. If none of those primes divides, classify it as prime.
5. For a range, use a sieve to cross out multiples rather than retesting each number independently.

Worked example

Representations and interpretation

An array model shows a composite number as a rectangle with both dimensions greater than $1$. A prime number can form only a $1\times p$ array. The Sieve of Eratosthenes represents primality across a grid by removing multiples.

Reasoning about variations

Large-looking numbers may be composite for simple reasons: $1001=7\cdot11\cdot13$. Conversely, no visual pattern in the last digit alone proves primality; ending in $1,3,7,$ or $9$ only survives the tests for $2$ and $5$.

Common mistakes

How to check your work

• For a composite claim, multiply the displayed nontrivial factor pair.
• For a prime claim, list all primes tested through the square-root bound.
• Use divisibility rules as screens, then exact division when necessary.

Practice

1. Is $91$ prime?
2. What is the smallest prime number?
3. Which primes must be tested to decide whether $53$ is prime?

Answers and brief solutions

Synthesis and transfer

Testing whether a large candidate is prime only requires trial division through its square root, because any larger factor would have to pair with a smaller one already checked.

If a composite number $n$ had no factor at or below $\sqrt n$, both factors in every product $ab=n$ would exceed $\sqrt n$, forcing $ab>n$. That contradiction justifies the square-root stopping point. Before trial division, quick tests for divisibility by $2$, $3$, or $5$ eliminate many candidates. Finding one divisor proves compositeness and supplies its paired factor; failing all required tests proves primality for that candidate. The number $1$ is excluded because it has only one positive factor, a choice that preserves unique prime factorization. Prime testing is therefore a structured proof, not a judgment based on whether a number looks unfamiliar.

Related topics

• Prime Factorization
• Factors and Multiples
• Greatest Common Factor

Teaching and accessibility note