SECTION 1
Historical Context & Motivation
People have been fascinated by numbers for thousands of years. Ancient mathematicians noticed something interesting: some numbers can only be divided evenly by 1 and themselves, while others have many divisors. These special "unbreakable" numbers became known as prime numbers. Understanding primes has shaped the way we do math, build codes, and even protect information online.
~300 BCE • Euclid's Elements
~240 BCE • The Sieve of Eratosthenes
1801 • Gauss and Number Theory
1970s–Today • Primes in Computer Security
So how do we actually decide whether a number is prime or composite? That's exactly what this lesson will teach you — step by step.
SECTION 2
Core Principles & Definitions
Before we start testing numbers, let's lock down the key vocabulary. Every SHSAT question about primes and composites relies on these ideas.
Factor (Divisor)
Prime Number
Composite Number
The Number 1
The Only Even Prime
KEY TAKEAWAY
SECTION 3
Visual Explanation — The Sieve of Eratosthenes
The best way to see primes and composites is with a number grid. The diagram below shows the numbers 1 through 50. Primes are highlighted in bright colors, composites are dimmed, and the number 1 is marked separately. Notice how primes become less common as numbers get bigger.
Look at the grid above. The bright cells are scattered among the dim ones, and there's no neat pattern to where primes appear. That's actually one of the most interesting things about them. However, you can spot some quick rules: after the number 2, no even number is prime. After 5, no number ending in 0 or 5 is prime.
SECTION 4
The Divisibility Test Method
You don't need to check every possible divisor to decide if a number is prime. There's a shortcut. You only need to test divisors up to the square root of the number. Here's why: if a number has a factor bigger than its square root, then it must also have a matching factor that's smaller than the square root. So if no small factor works, no big factor will either!
SQUARE ROOT TEST RULE
n = the number you're testing. √n = the square root of n. You only need to try prime divisors (2, 3, 5, 7, 11, …) up to that square root.
For most numbers on the SHSAT (typically under 100), you only need to check divisibility by 2, 3, 5, and 7. That's because √100 = 10, and the primes up to 10 are 2, 3, 5, and 7. Here are the quick divisibility rules to memorize:
DIVISIBLE BY 2
Example: 84 ends in 4, so 84 ÷ 2 = 42. It's composite.
DIVISIBLE BY 3
Example: 51 → 5 + 1 = 6, and 6 ÷ 3 = 2. So 51 is divisible by 3 and is composite.
DIVISIBLE BY 5
Example: 85 ends in 5, so 85 ÷ 5 = 17. It's composite.
SHSAT TIP
SECTION 5
Factor Trees & Prime Factorization
A factor tree is a diagram that breaks a composite number down into its prime factors. You keep splitting until every "leaf" of the tree is a prime number. This is called prime factorization. It's a powerful way to confirm that a number is composite and to see exactly which primes make it up.
On the left side of the diagram, 60 gets split over and over until only primes remain. On the right, 37 can't be split at all because none of the primes up to its square root divide into it evenly. This comparison shows the key difference between composite and prime numbers in action.
| Number | √n (approx.) | Primes to Test | Result |
|---|---|---|---|
| 29 | 5.39 | 2, 3, 5 | Prime |
| 51 | 7.14 | 2, 3, 5, 7 | Composite (3 × 17) |
| 67 | 8.19 | 2, 3, 5, 7 | Prime |
| 91 | 9.54 | 2, 3, 5, 7 | Composite (7 × 13) |
Applying the square root test to several numbers
SECTION 6
Worked Example — Is 83 Prime or Composite?
Let's walk through a full example, step by step. This is exactly the process you should use on the SHSAT when a question asks you to identify whether a number is prime or composite.
Is 83 prime or composite?
- 1
Step 1 — Find the Square Root
Calculate √83. Since 9 × 9 = 81 and 10 × 10 = 100, we know √83 is between 9 and 10. So we only need to test prime divisors up to 9.√83 ≈ 9.1 → test primes: 2, 3, 5, 7 - 2
Step 2 — Test Divisibility by 2
Is 83 even? The last digit is 3, which is odd. So 83 is not divisible by 2.83 ÷ 2 = 41.5 ✗ - 3
Step 3 — Test Divisibility by 3
Add the digits: 8 + 3 = 11. Is 11 divisible by 3? No (11 ÷ 3 = 3.67). So 83 is not divisible by 3.83 ÷ 3 = 27.67… ✗ - 4
Step 4 — Test Divisibility by 5
Does 83 end in 0 or 5? No, it ends in 3. So 83 is not divisible by 5.83 ÷ 5 = 16.6 ✗ - 5
Step 5 — Test Divisibility by 7
Divide: 83 ÷ 7 = 11.86 (not a whole number). So 83 is not divisible by 7.83 ÷ 7 = 11.86… ✗ - 6
Step 6 — Conclusion
We tested every prime up to √83, and none of them divided evenly. Therefore, 83 is a prime number.83 is PRIME
SECTION 7
Common Traps & Quick Tips
The SHSAT loves to test tricky numbers that look prime but aren't (or look composite but are). Let's compare some common mistakes students make with the correct thinking.
| Common Trap | Why It's Wrong | Correct Thinking |
|---|---|---|
| "1 is prime because its only factor is itself." | A prime must have exactly TWO factors. The number 1 has only ONE factor. | 1 is neither prime nor composite. |
| "All odd numbers are prime." | Many odd numbers are composite: 9, 15, 21, 25, 27, 33, 35, 39, etc. | Always test — odd doesn't mean prime. |
| "2 isn't prime because it's even." | 2 has exactly two factors (1 and 2), which fits the prime definition perfectly. | 2 is prime — the only even prime. |
| "91 is prime because it looks prime." | 91 = 7 × 13. Students forget to test 7 as a divisor. | Always test ALL primes up to √n. |
| "A big number can't be prime." | Large primes exist everywhere: 97, 101, 103, 107, etc. | Size doesn't determine primality — factors do. |
Common student mistakes on prime/composite questions
WATCH OUT FOR THESE SHSAT FAVORITES
SECTION 8
Connecting to Bigger Ideas
Understanding primes and composites is the foundation for many harder topics you'll see on the SHSAT and in future math courses. Here's how this concept connects to what comes next.
| This Lesson | Where It Leads |
|---|---|
| Identifying prime numbers | Finding the Greatest Common Factor (GCF) of two numbers by comparing their prime factorizations |
| Prime factorization | Finding the Least Common Multiple (LCM) using prime factors |
| Divisibility rules | Simplifying fractions — divide top and bottom by common prime factors |
| Counting factors of a number | SHSAT questions that ask "how many factors does n have?" — use prime factorization to count systematically |
How primes connect to other SHSAT topics
Once you're comfortable identifying primes, try this: pick any composite number and write it as a product of primes. Then use that skill to find the GCF or LCM of two numbers. You'll see how primes are the "master key" for many SHSAT number-property questions.
PRIME NUMBERS TO MEMORIZE FOR THE SHSAT
SECTION 9
Practice Problems
Try these five problems. They start easy and get harder, just like the SHSAT. Work through each one using the square root test before checking the answer.
Question 1: CONCEPTUAL
Show answer
Question 2: BASIC CALCULATION
Show answer
Question 3: INTERMEDIATE
Show answer
Question 4: APPLIED
Show answer
Question 5: CRITICAL THINKING
Show answer
SUMMARY
Lesson Summary
Summary
A prime number is a whole number greater than 1 with exactly two factors (1 and itself), while a composite number has more than two factors. The number 1 is neither prime nor composite, and 2 is the only even prime. To test whether a number is prime, use the square root test: check divisibility by every prime up to the square root of the number.
For SHSAT numbers under 100, you only need to test 2, 3, 5, and 7 using divisibility rules. Watch out for tricky composites like 51, 57, 87, and 91. Mastering primes unlocks bigger topics like GCF, LCM, and fraction simplification — all of which appear frequently on the SHSAT.