So far we have looked at relationships among integers. Now we turn to the integers themselves. In this post we focus on natural numbers greater than 1, because that is where prime structure begins.
What this post covers
- What primes and composites are
- Why primes behave like basic building blocks
- Why 1 is not prime
- A few beginner examples of primality testing
Key terms
- prime number: a natural number greater than 1 with no positive divisors other than 1 and itself
- composite number: a natural number greater than 1 with at least one additional positive divisor
- prime factorization: expressing an integer as a product of primes
- divisor: a number that divides an integer exactly
Prime and composite numbers
A natural number n>1 is prime if its only positive divisors are 1 and itself.
Examples:
- primes:
2, 3, 5, 7, 11 - composites:
4, 6, 8, 9, 10, 12
Composite numbers can be broken into smaller integer factors. Primes cannot.
Why are primes special?
Primes act like the basic building blocks of integers.
For example,
So composites are built from primes. That is why primes are often called the “atoms” of number theory.
Why is 1 not prime?
If we allowed 1 to count as prime, factorizations would stop being essentially unique:
To preserve a clean theory of factorization, 1 is excluded from the primes.
Why is 2 the smallest prime?
2 is the only even prime. Every larger even number is divisible by 2, so it cannot be prime.
A few quick examples
Is 15 prime?
No, because
Is 17 prime?
17 is not divisible by 2, 3, or 4. Since \sqrt{17} lies between 4 and 5, there is no need to keep checking larger divisors. If 17 had a nontrivial factor larger than \sqrt{17}, it would also have one smaller than \sqrt{17}. So 17 is prime.
Is 21 prime?
No, because
Why do primes keep returning?
Primes are central because they sit behind:
- factorization
- divisor structure
- gcd and lcm through exponents
- congruence and modular theorems
- cryptographic applications
Common mistakes
1. Counting 1 as prime
Primes begin at 2.
2. Thinking every odd number is prime
Many odd numbers—such as 9, 15, 21, 25—are composite.
3. Checking far more divisors than necessary
In beginner examples, small divisors often decide the question quickly.
Wrap-up
Primes are the basic building blocks of integer structure. Once we understand them, we can move to the next natural step: prime factorization and the uniqueness of that factorization.
💬 댓글
이 글에 대한 의견을 남겨주세요