Prime numbers are fundamental in mathematics, but their impact goes well beyond theoretical concepts; they are important for real-world applications that are essential in the operation of modern technology. The contributions of prime numbers to a variety of fields, like error detection and correction, data compression and cryptography, become more prominent as we dive deeper into their applications.
Prime numbers are numbers greater than 1 that only have two factors, 1 and the number itself. This means that a prime number is only divisible by 1 and itself.
Numbers that have more than 2 factors (but a finite number of factors) are known as composite numbers
If two prime numbers have only 1 composite number between them, they are called twin-prime numbers. For example, (3, 5), (59, 61). In the pair (3, 5), 4 is a composite number lying between the given 2 prime numbers.
If a pair of numbers does not have any common factor other than 1, they are called co-prime numbers. For example, (2, 9). In this pair, 2 and 9 do not have any common factor other than 1.
→ A prime number has only two factors 1 and the number itself.
→ 2 is the smallest prime number. Also, 2 is the only even prime number and all the prime numbers except 2 are odd
→ Any two prime numbers are always co-prime
→ Every positive integer greater than 1 has at least one prime factor.
→ Any composite number can be uniquely expressed as the product of its prime factors.
| Prime Numbers | Composite Numbers |
| Prime numbers have only two factors: 1 and the number itself. | Composite numbers have more than two factors besides 1 and the number itself. |
| Examples: 2, 3, 5, 7, 11 | Examples: 4, 6, 8, 9, 10 |
| Prime numbers cannot be divided evenly by any other number except 1 and the number itself. | Composite numbers can be divided evenly by numbers other than 1 and the number itself. |
| Prime numbers are indivisible, meaning they cannot be split into smaller whole numbers. | Composite numbers can be divided into smaller whole numbers, showing that they are made up of smaller factors. |
| Prime numbers are the building blocks of all other numbers. | Composite numbers are formed by multiplying prime numbers together. |
Eratosthenes, a Greek mathematician from 275-194 BC, discovered a method to identify prime numbers using a technique similar to a sieve, which helps separate prime numbers from a list of natural numbers while removing the composite numbers. This method is known as the Sieve of Eratosthenes. It is a popular method for generating a list of prime numbers. This technique produces a chart known as the Eratosthenes chart. Following are the steps to find all the prime numbers less than or equal to a given integer n by the Eratosthenes method.
In the given case, we have taken the integer n = 100. So, the given steps help us to identify the prime numbers between 1 and 100.
Step 1: Write all the natural numbers between 1 to 100 using 10 rows and 10 columns.
Step 2: Leave 1, as it is neither a prime number nor a composite number.
Step 3: Encircle 2 and cross out all its multiples (such as 4, 6, 8, 10 and so on) as they are not prime numbers.
Step 4: Encircle the next uncrossed number, which is 3 and cross out all its multiples. Ignore the previously crossed-out numbers like 6, 12, 18 and so on.
Step 5: Continue the process of encircling the next uncrossed number and crossing out its multiples till all the numbers in the table are either encircled or crossed except 1.
There are 168 prime numbers between 1 and 1000.
Example 1: Is 13 a prime number?
Solution: Yes, 13 is a prime number because it has only two factors: 1 and 13.
Example 2: What are the prime factors of 60?
Solution: The prime factorization of 60 can be shown as:
60 = 22 x 3 x 5.
Hence, the prime factors of 60 are 2, 3 and 5.
Example 3: Define co-prime numbers along with examples.
Solution: If a pair of numbers does not have any common factor other than 1, they are called co-prime numbers. For example, (9, 16), (7, 15).
1. How many prime numbers are there?
Answer: Prime numbers are infinite. This was proven by the ancient Greek mathematician Euclid around 300 BCE. In one of the most famous theorems in his work "Elements," Euclid proved that there is no largest prime number and thus, primes continue indefinitely.
2. How can I identify prime numbers?
Answer: To identify prime numbers, use methods such as trial division, Sieve of Eratosthenes, or testing divisibility by prime numbers up to the number's square root.
3. What are some examples of prime numbers?
Answer: Here are some examples of prime numbers:
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, and so on.
4. What is the smallest prime number?
Answer: 2 is the smallest prime number.
In this section, you will find interesting and well-explained topic-wise video summary of the topic, perfect for quick revision before your Olympiad exams.
***COMING SOON***
CREST Olympiads has launched this initiative to provide free reading and practice material. In order to make this content more useful, we solicit your feedback.
Do share improvements at info@crestolympiads.com. Please mention the URL of the page and topic name with improvements needed. You may include screenshots, URLs of other sites, etc. which can help our Subject Experts to understand your suggestions easily.