SOLVER7 Study. Nothing Else.
Chapter 1 - Theorem Q2

Theorem 1.2 : Let p be a prime number. If p divides a2, then p divides a, where a is a positive integer.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

Imagine a prime number is like a very special building block, like a unique LEGO piece. When you multiply a number by itself to get \( a^2 \), you are just using each building block twice. So every block inside \( a^2 \) was already inside \( a \). If that special prime piece fits into \( a^2 \), it must have come from \( a \) in the first place. There is no other way it could have sneaked in!

Answer: If \( p \) is a prime number and \( p \) divides \( a^2 \), then \( p \) divides \( a \).

📖 Proof and Explanation of Theorem 1.2 (Divisibility of Primes)

Detailed Explanation

This theorem is a fundamental property of prime numbers and is a direct consequence of the Fundamental Theorem of Arithmetic. The Fundamental Theorem of Arithmetic states that every composite number can be expressed (factorized) as a product of primes, and this factorization is unique, apart from the order in which the prime factors occur.

To understand this theorem, let us look at an example. Consider the prime number \(p = 3\) and a positive integer \(a = 6\). Here, \(a^2 = 36\). Since \(3\) divides \(36\) (as \(36 = 3 \times 12\)), the theorem states that \(3\) must also divide \(6\), which is indeed true (\(6 = 3 \times 2\)).

Formula Used

The prime factorization of a positive integer \( a \) is represented as:

\[a = p_1 p_2 \dots p_n\]

where \(p_1, p_2, \dots, p_n\) are prime numbers (not necessarily distinct).

Squaring both sides gives:

\[a^2 = p_1^2 p_2^2 \dots p_n^2\]

Solution

  1. Step 1: Write the prime factorization of \( a \)

    Let the prime factorization of the positive integer \( p \) be:

    \[a = p_1 p_2 \dots p_n\]

    where \(p_1, p_2, \dots, p_n\) are prime numbers, not necessarily distinct.

  2. Step 2: Express \(a^2\) in terms of its prime factors

    By squaring both sides, we get:

    \[a^2 = (p_1 p_2 \dots p_n)(p_1 p_2 \dots p_n) = p_1^2 p_2^2 \dots p_n^2\]

    This shows that the prime factors of \(a^2\) are the same as the prime factors of \( a \), just squared (or repeated).

  3. Step 3: Apply the given condition

    We are given that the prime number \( p \) divides \(a^2\). According to the Fundamental Theorem of Arithmetic, the prime factorization of any number is unique. Therefore, \( p \) must be one of the prime factors of \(a^2\).

  4. Step 4: Relate the prime factors of \(a^2\) back to \( a \)

    Since the only prime factors of \(a^2\) are \(p_1, p_2, \dots, p_n\), the prime \( p \) must be one of \(p_1, p_2, \dots, p_n\).

  5. Step 5: Conclude the proof

    Since \(a = p_1 p_2 \dots p_n\) and \( p \) is one of these prime factors, it logically follows that \( p \) divides \( a \).

Final Answer

Hence, it is proved that if a prime number \( p \) divides \(a^2\), then \( p \) divides \( a \), where \( a \) is a positive integer.

Common Mistake

Assuming the theorem holds when \( p \) is a composite number: Students often forget that this theorem is strictly true only when \( p \) is a prime number. For example, let \(p = 4\) (which is a composite number) and \(a = 6\). Here, \(a^2 = 36\). Although \(4\) divides \(36\), \(4\) does not divide \(6\). Thus, the theorem fails if \( p \) is not prime.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Represent \( a \) as a product of its prime factors.
    Reason: We use the Fundamental Theorem of Arithmetic to express any positive integer as a product of prime numbers, which allows us to analyze its divisibility properties.
    Let the prime factorization of \( a \) be: \[a = p_1 p_2 \dots p_n\]where \(p_1, p_2, \dots, p_n\) are prime numbers (not necessarily distinct).
  2. Step 2: Express \(a^2\) in terms of these prime factors.
    Reason: To understand the divisibility of \(a^2\), we square to see its prime factors.
    Squaring both sides gives: \[a^2 = (p_1 p_2 \dots p_n)^2 = p_1^2 p_2^2 \dots p_n^2\]
  3. Step 3: Analyze the given condition that \( p \) divides \(a^2\).
    Reason: We apply the uniqueness part of the Fundamental Theorem of Arithmetic.
    Since \( p \) is a prime number that divides \(a^2\), \( p \) must be one of the prime factors of \(a^2\).
  4. Step 4: Identify the prime factors of \(a^2\).
    Reason: We look at the base prime factors of \(a^2\) to locate \( p \).
    The only prime factors of \(a^2\) are \(p_1, p_2, \dots, p_n\). Thus, \( p \) must be one of the primes in this list.
  5. Step 5: Relate the prime factor \( p \) back to \( a \).
    Reason: We connect our finding back to the factorization of \( a \).
    Since \(a = p_1 p_2 \dots p_n\) and \( p \) is one of these primes, it follows directly that \( p \) divides \( a \).

Final Answer

If \( p \) is a prime number and \( p \) divides \(a^2\), then \( p \) divides \( a \).

Common Mistake

One common mistake: Assuming this theorem holds for composite numbers. For example, if \(4\) divides \(6^2\) (\(36\)), it does not mean \(4\) divides \(6\), because \(4\) is not a prime number.

✍️ Exam-ready Answer

Exam-ready Answer

Let \(a = p_1 p_2 \dots p_n\), where \(p_1, p_2, \dots, p_n\) are prime factors of \( a \).

\(a^2 = p_1^2 p_2^2 \dots p_n^2\)

\(p \mid a^2 \implies p \in \{p_1, p_2, \dots, p_n\}\) (by Fundamental Theorem of Arithmetic)

\(p \in \{p_1, p_2, \dots, p_n\} \implies p \mid a\)

Answer: If \( p \) is a prime number and \( p \) divides \(a^2\), then \( p \) divides \( a \).

➕ More Examples

More Examples

Example 1

Question: Given that \(p = 7\) is a prime number and it divides \(k^2\), where \( k \) is a positive integer. If \(\dfrac{k^2}{7} = 112\), find the value of \( k \) and verify that \(7\) divides \( k \).

Solution:

  1. First, calculate \(k^2\) by isolating it: \[k^2 = 112 \times 7 = 784\]
  2. Find the positive integer by taking the square root: \[k = \sqrt{784} = 28\]
  3. According to the theorem, since the prime number \(7\) divides \(k^2\) (since \(784 \div 7 = 112\)), \(7\) must also divide .
  4. Let's verify this division: \[\dfrac{28}{7} = 4\] Since \(4\) is an integer, \(7\) indeed divides \(k = 28\).

Answer: \(k = 28\), and \(7\) divides \(28\) because \(28 = 7 \times 4\).

Example 2

Question: Let \( m \) be a positive integer. Show that if \(m^2\) is a multiple of \(18\), then \( m \) must be a multiple of \(6\) by using the prime divisibility theorem.

Solution:

  1. Since \(m^2\) is a multiple of \(18\), we can write: \[m^2 = 18q \text{ for some integer } q\]
  2. Express \(18\) as a product of prime factors: \[m^2 = 2 \times 3^2 \times q\]
  3. This shows that the prime number \(3\) divides \(m^2\). Since \(3\) is prime, by the theorem, \(3\) must also divide \( m \).
  4. Similarly, the prime number \(2\) divides \(m^2\). Since \(2\) is prime, by the theorem, \(2\) must also divide \( m \).
  5. Since both prime numbers \(2\) and \(3\) divide \( m \), and they have no common factors other than \(1\), their product \(2 \times 3 = 6\) must also divide \( m \). Therefore, \( m \) is a multiple of \(6\).

Answer: Since the prime factors \(2\) and \(3\) divide \(m^2\), they must also divide \( m \), proving that \( m \) is a multiple of \(6\).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( a \) be a positive integer. If the prime number \(13\) divides \(a^2\), show that \(169\) must divide \(a^2\).

Solution

  1. We are given that \(13\) is a prime number and \(13\) divides \(a^2\) (written as \(13 \mid a^2\)).
  2. According to the fundamental property of prime divisibility, if a prime number \( p \) divides \(a^2\), then \( p \) must divide \( a \). Since \(13\) is a prime number, it follows that \(13\) divides \( a \) (written as \(13 \mid a\)).
  3. Since \(13\) divides \( a \), we can express \( a \) as a multiple of \(13\):
    \[a = 13k\]
    where is some positive integer.
  4. Now, let us square both sides of this equation to find the expression for \(a^2\):
    \[a^2 = (13k)^2\]
    \[a^2 = 169k^2\]
  5. Since \( k \) is an integer, \(k^2\) is also an integer. This means that \(169\) is a factor of \(a^2\), which implies that \(169\) divides \(a^2\) (written as \(169 \mid a^2\)).

Answer: Since \(13 \mid a^2 \implies 13 \mid a \implies a = 13k\), squaring gives \(a^2 = 169k^2\), which proves that \(169\) must divide \(a^2\).

Everything you get with Solver7

More questions in Real Numbers

Chapter 1 - Theorem Q1 30/4/1 2023 / Section A Q1 430/1/1 2026 / Section A Q1 430/2/1 2026 / Section A Q1 430/3/1 2026 / Section A Q1 430/4/1 2026 / Section A Q1 430/5/1 2024 / Section A Q1 30/3/1 2026 / Section A Q2 430/1/1 2026 / Section A Q2 430/2/1 2026 / Section A Q2 430/3/1 2026 / Section A Q2 CBSE-ADDL1 2024 / Section A Q2 Chapter 1 - Theorem Q3 430/3/1 2026 / Section A Q3 Chapter 1 - Examples Q1 30/2/1 2023 / Section A Q4 30/2/1 2026 / Section A Q4 Chapter 1 - Examples Q2 Chapter 1 - Examples Q3 30/1/1 2026 / Section A Q6 430/5/1 2023 / Section A Q6 Chapter 1 - Examples Q4 430/2/1 2023 / Section A Q7 430/5/1 2024 / Section A Q7 Chapter 1 - Examples Q5 430/5/1 2024 / Section A Q8 Chapter 1 - Examples Q6 30/1/1 2026 / Section A Q9 Chapter 1 - Examples Q7 30/2/1 2026 / Section A Q10 Exercise 1.1 Q1 (i) Exercise 1.1 Q1 (ii) Exercise 1.1 Q1 (iii) 430/4/1 2024 / Section A Q13 Exercise 1.1 Q1 (iv) 30/1/1 2026 / Section A Q14 Exercise 1.1 Q1 (v) Exercise 1.1 Q2 (i) Exercise 1.1 Q2 (ii) Exercise 1.1 Q2 (iii) 30/2/1 2026 / Section A Q18 Exercise 1.1 Q3 (i) 430/1/1 2026 / Section A Q19 430/2/1 2026 / Section A Q19 CBSE-ADDL2 2024 / Section A Q19 Exercise 1.1 Q3 (ii) 30/5/1 2023 / Section A Q20 430/3/1 2024 / Section A Q20 Exercise 1.1 Q3 (iii) 30/2/1 2023 / Section B Q21 30/4/1 2023 / Section B Q21 430/4/1 2024 / Section B Q21 430/4/1 2026 / Section B Q21 430/5/1 2023 / Section B Q21 CBSE-ADDL1 2024 / Section B Q21 CBSE-ADDL2 2024 / Section B Q21 Exercise 1.1 Q4 430/2/1 2023 / Section B Q22(a) Exercise 1.1 Q5 30/3/1 2026 / Section B Q23(a)