A prime number is a whole number greater than 1 that has exactly two factors: 1 and itself. For example, 7 is prime because its only factors are 1 and 7. Prime numbers cannot be broken down into smaller whole number factors. They are like the "atoms" of mathematics—the fundamental building blocks from which all other numbers are built!

To check if 17 is prime: test factors from 2 to 16. 17 cannot be divided evenly by 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, or 16. So 17 is prime because its only factors are 1 and 17. 15 has factors 1, 3, 5, and 15 (not prime). 21 has factors 1, 3, 7, and 21 (not prime). 27 has factors 1, 3, 9, and 27 (not prime).

The first five prime numbers are 2, 3, 5, 7, and 11. The number 2 is the only even prime number because every other even number can be divided by 2. The prime numbers continue: 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, and so on. There are infinitely many prime numbers, and they become rarer as numbers get larger. The search for larger prime numbers continues to this day!

To find the prime factorization of 24: divide by prime numbers. 24 = 2 × 12 = 2 × 2 × 6 = 2 × 2 × 2 × 3 = 2³ × 3. Every number can be broken down into prime factors in exactly one way (except for order). This is called the Fundamental Theorem of Arithmetic. Prime factorization is essential for finding GCF, LCM, simplifying fractions, and solving many mathematical problems.

The Sieve of Eratosthenes works by crossing out multiples: write all numbers from 2 to a certain limit. Start with 2 (prime), cross out all multiples of 2 (4, 6, 8,...). Then move to 3 (prime), cross out all multiples of 3 (6, 9, 12,...). Continue with 5, 7, and so on. The numbers left are prime. This method was invented by the Greek mathematician Eratosthenes around 200 BCE and is still the most efficient way to find all primes up to a given number!

Euclid proved that there are infinitely many prime numbers—they never run out! His proof (c. 300 BCE) is one of the most elegant proofs in mathematics. He showed that no matter how many primes you find, you can always find another prime by multiplying all the known primes together and adding 1. This new number will have a prime factor different from all the known primes. This means the list of primes goes on forever, making them one of the most fascinating and infinite sets in mathematics!

Prime numbers are used in cryptography—the science of secret codes. The most common encryption method, RSA, uses the fact that it's extremely hard to factor large numbers into primes. When you enter your credit card online, send a secure message, or access a secure website, you're using prime number encryption. Multiplying two large primes is easy, but finding those primes from the product is incredibly difficult—this difficulty keeps our information secure. Prime numbers protect billions of online transactions every day!

Twin primes are pairs of primes that are exactly 2 apart: (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), and many more. Mathematicians have been studying twin primes for centuries. The Twin Prime Conjecture states that there are infinitely many twin primes, but this has never been proven. Finding the largest twin prime pairs is an ongoing challenge in number theory!

The largest known prime numbers are found by the Great Internet Mersenne Prime Search (GIMPS), a distributed computing project where thousands of volunteers contribute computer power. They search for Mersenne primes (primes of the form 2^n - 1). The largest known prime has millions of digits! Finding these huge primes proves the power of modern computing and helps advance our understanding of prime numbers. There are even cash prizes for finding the largest prime numbers!

Prime numbers matter because they are the building blocks of all whole numbers (the Fundamental Theorem of Arithmetic). They are essential for cryptography (online security), computer science, coding theory, and even biology (some life cycles are prime to avoid predators). They are a source of beauty and mystery—simple to understand but with unsolved mysteries like the Twin Prime Conjecture and Goldbach's Conjecture. Prime numbers connect pure mathematics to real-world applications, showing how abstract ideas can have practical uses. They remind us that mathematics is not just about solving problems—it's also about exploring the hidden patterns and mysteries of numbers!