👁 Preview — Study, Practice and Revise are open; mock tests and the rest of the syllabus unlock on subscription. Unlock all · ₹4,999
← Back to Number System
Study mode

Prime Numbers

Study Practice Revise 🔒 Test

Introduction to Prime Numbers

Prime numbers are a special set of natural numbers that play a fundamental role in mathematics, especially in the study of the number system. A prime number is defined as a natural number greater than 1 that has exactly two distinct positive divisors: 1 and itself.

Why are prime numbers important? They are the building blocks of all natural numbers because every number can be expressed as a product of primes. This property makes them crucial in various areas such as cryptography, computer science, and competitive exams like engineering and medical entrance tests.

Understanding prime numbers helps you grasp other concepts in the number system, such as composite numbers, factorization, and divisibility rules. This chapter will guide you through the basics, properties, factorization techniques, and applications of prime numbers with clear examples and problem-solving strategies.

Definition and Properties of Prime Numbers

Let's start with the formal definition:

Prime Number: A natural number \( n > 1 \) is prime if its only positive divisors are 1 and \( n \) itself.

For example, 2, 3, 5, 7, 11 are prime numbers because:

  • 2 is divisible by 1 and 2 only.
  • 3 is divisible by 1 and 3 only.
  • 5 is divisible by 1 and 5 only.

Numbers greater than 1 that have more than two divisors are called composite numbers. For example, 4 is composite because it is divisible by 1, 2, and 4.

Note that 1 is neither prime nor composite because it has only one divisor.

Properties of Prime Numbers

  • Smallest prime number is 2, which is also the only even prime number.
  • All other prime numbers are odd.
  • There are infinitely many prime numbers - no largest prime exists.
  • Every composite number can be uniquely expressed as a product of prime numbers (Fundamental Theorem of Arithmetic).

Visualizing Primes on the Number Line

Prime Factorization

Prime factorization is the process of expressing a composite number as a product of its prime factors. This is important because it reveals the fundamental building blocks of the number.

To find the prime factors of a number, we use a factor tree, which breaks the number down step-by-step into prime numbers.

Fundamental Theorem of Arithmetic

This theorem states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. For example:

\[84 = 2 \times 2 \times 3 \times 7 = 2^2 \times 3 \times 7\]

This uniqueness is the foundation for many applications in number theory and problem solving.

Factor Tree Example: Prime Factorization of 84

84 12 7 2 6 2 3

Explanation:

  • Start with 84 at the top.
  • Split 84 into 12 and 7 (since \(12 \times 7 = 84\)).
  • 7 is prime, so stop there.
  • Split 12 into 2 and 6.
  • 2 is prime, stop there.
  • Split 6 into 2 and 3, both primes.

Thus, the prime factorization of 84 is \(2 \times 2 \times 3 \times 7 = 2^2 \times 3 \times 7\).

Applications of Prime Numbers

Prime numbers are not just theoretical; they have practical uses in various calculations and concepts:

  • Greatest Common Divisor (GCD): The largest number that divides two or more numbers. Prime factorization helps find GCD by identifying common prime factors.
  • Least Common Multiple (LCM): The smallest number divisible by two or more numbers. Prime factorization helps find LCM by combining prime factors with the highest powers.
  • Divisibility Rules: Many rules for checking divisibility involve prime numbers, such as 2, 3, 5, 7, and 11.
  • Modular Arithmetic and Cryptography: Prime numbers underpin modern encryption methods like RSA, ensuring secure communication.

Worked Examples

Example 1: Is 29 a Prime Number? Easy
Check whether 29 is a prime number.

Step 1: Find the square root of 29 to limit divisibility checks.

\(\sqrt{29} \approx 5.38\)

We only need to check divisibility by prime numbers less than or equal to 5: 2, 3, and 5.

Step 2: Check divisibility:

  • 29 / 2 = 14.5 (not an integer)
  • 29 / 3 ≈ 9.67 (not an integer)
  • 29 / 5 = 5.8 (not an integer)

No prime divisor found.

Answer: 29 is a prime number.

Example 2: Prime Factorization of 180 Medium
Find the prime factorization of 180 using a factor tree.

Step 1: Start with 180 and find two factors.

180 = 18 x 10

Step 2: Factor 18 into 2 x 9.

Step 3: Factor 10 into 2 x 5.

Step 4: Factor 9 into 3 x 3.

All factors are now prime numbers: 2, 2, 3, 3, 5.

Step 5: Write prime factorization:

\[ 180 = 2 \times 2 \times 3 \times 3 \times 5 = 2^2 \times 3^2 \times 5 \]

Answer: \(180 = 2^2 \times 3^2 \times 5\)

Example 3: Finding GCD of 48 and 180 Medium
Calculate the Greatest Common Divisor (GCD) of 48 and 180 using prime factorization.

Step 1: Find prime factorization of 48.

48 = 2 x 24 = 2 x 2 x 12 = 2 x 2 x 2 x 6 = 2 x 2 x 2 x 2 x 3

So, \(48 = 2^4 \times 3\)

Step 2: Find prime factorization of 180 (from previous example):

180 = \(2^2 \times 3^2 \times 5\)

Step 3: Identify common prime factors with minimum powers:

  • For 2: minimum power is \(\min(4,2) = 2\)
  • For 3: minimum power is \(\min(1,2) = 1\)
  • 5 is not common.

Step 4: Multiply common prime factors:

\[ \text{GCD} = 2^2 \times 3 = 4 \times 3 = 12 \]

Answer: GCD of 48 and 180 is 12.

Example 4: Using Divisibility Rules to Identify if 97 is Prime Easy
Use divisibility rules to check if 97 is a prime number.

Step 1: Find primes less than or equal to \(\sqrt{97} \approx 9.8\): 2, 3, 5, 7.

Step 2: Apply divisibility rules:

  • Divisible by 2? Last digit is 7 (odd), so no.
  • Divisible by 3? Sum of digits = 9 + 7 = 16, which is not divisible by 3.
  • Divisible by 5? Last digit is not 0 or 5.
  • Divisible by 7? Check 97 / 7 ≈ 13.86 (not integer).

No divisor found.

Answer: 97 is a prime number.

Example 5: Application in INR - Dividing INR 1000 into Prime Denominations Hard
Using prime factorization, determine possible ways to split INR 1000 into prime currency denominations (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47).

Step 1: Prime denominations in INR are limited to 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 (hypothetical for this example).

Step 2: Prime factorize 1000:

\[ 1000 = 10^3 = (2 \times 5)^3 = 2^3 \times 5^3 \]

Step 3: Since 1000 is composed of 2 and 5 primes, possible splits must use these denominations.

Step 4: Possible combinations include:

  • 500 notes of 2 INR
  • 200 notes of 5 INR
  • 100 notes of 10 INR (not prime, so not allowed)
  • Mix of 2 and 5 INR notes, e.g., 300 notes of 2 INR and 80 notes of 5 INR: \(300 \times 2 + 80 \times 5 = 600 + 400 = 1000\)

Step 5: Other prime denominations (like 3, 7, 11, etc.) cannot exactly divide 1000 without remainder, so they are less practical here.

Answer: The prime factorization shows that splitting INR 1000 into prime denominations is feasible primarily with 2 INR and 5 INR notes.

Prime Factorization

\[n = p_1^{a_1} \times p_2^{a_2} \times \cdots \times p_k^{a_k}\]

Express a composite number n as a product of prime factors raised to their powers

n = Composite number
\(p_i\) = Prime factors
\(a_i\) = Powers

Greatest Common Divisor (GCD)

\[\text{GCD}(a,b) = \prod p_i^{\min(a_i,b_i)}\]

GCD is product of common prime factors with minimum powers

a,b = Numbers
\(p_i\) = Prime factors
\(a_i,b_i\) = Powers in factorization of a and b

Least Common Multiple (LCM)

\[\text{LCM}(a,b) = \prod p_i^{\max(a_i,b_i)}\]

LCM is product of all prime factors with maximum powers

a,b = Numbers
\(p_i\) = Prime factors
\(a_i,b_i\) = Powers in factorization of a and b

Divisibility Rule for 2

\[n \equiv 0 \pmod{2} \iff \text{last digit of } n \text{ is even}\]

Number divisible by 2 if last digit is even

n = Number

Divisibility Rule for 3

\[n \equiv 0 \pmod{3} \iff \text{sum of digits of } n \text{ divisible by } 3\]

Number divisible by 3 if sum of digits divisible by 3

n = Number

Tips & Tricks

Tip: Check divisibility only up to the square root of the number.

When to use: When testing if a number is prime to reduce calculations and save time.

Tip: Use factor trees for quick and organized prime factorization.

When to use: When breaking down composite numbers into prime factors efficiently.

Tip: Memorize prime numbers up to 50 for faster identification during exams.

When to use: During quick prime checks and elimination in competitive exams.

Tip: Apply divisibility rules to eliminate non-primes quickly.

When to use: When checking primality of larger numbers without full factorization.

Tip: For GCD and LCM calculations, always use prime factorization method to avoid errors.

When to use: To simplify and accurately compute GCD and LCM in problems.

Common Mistakes to Avoid

❌ Assuming 1 is a prime number.
✓ Remember that 1 is neither prime nor composite; primes start from 2.
Why: Confusion arises because 1 is unique but does not meet the prime definition.
❌ Checking divisibility beyond the square root of the number.
✓ Only check divisibility up to \(\sqrt{n}\) when testing primality.
Why: Divisors above \(\sqrt{n}\) correspond to smaller divisors below \(\sqrt{n}\), so checking beyond is unnecessary and time-consuming.
❌ Mixing up prime and composite numbers.
✓ Recall that primes have exactly two divisors; composites have more than two.
Why: Lack of clarity on definitions leads to misclassification.
❌ Incorrect prime factorization due to missing factors.
✓ Use systematic factor trees and verify by multiplying all factors back.
Why: Rushing causes skipped factors and errors.
❌ Using addition instead of multiplication in prime factorization.
✓ Remember prime factorization involves multiplication of primes, not addition.
Why: Misunderstanding the concept of factorization leads to incorrect results.
Curated videos per subtopic
Top YouTube explainers, AI-ranked for your exam and language. Unlocks with subscription.
Unlock

Try Practice next.

Progress tracking is paywalled — subscribe to mark subtopics as understood and save your streak.

Go to practice →
Ask a doubt
Prime Numbers · 10 free messages
Ask me anything about this subtopic. You have 10 free messages this session — chat history isn't saved in preview.