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
CBSE Class 10 Maths · Real Numbers
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 \).
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\)).
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\]
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.
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).
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\).
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\).
Since \(a = p_1 p_2 \dots p_n\) and \( p \) is one of these prime factors, it logically follows that \( p \) divides \( a \).
Hence, it is proved that if a prime number \( p \) divides \(a^2\), then \( p \) divides \( a \), where \( a \) is a positive integer.
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.
If \( p \) is a prime number and \( p \) divides \(a^2\), then \( p \) divides \( a \).
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.
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 \).
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:
Answer: \(k = 28\), and \(7\) divides \(28\) because \(28 = 7 \times 4\).
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:
Answer: Since the prime factors \(2\) and \(3\) divide \(m^2\), they must also divide \( m \), proving that \( m \) is a multiple of \(6\).
Question: Let \( a \) be a positive integer. If the prime number \(13\) divides \(a^2\), show that \(169\) must divide \(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\).