Express each number as a product of its prime factors: 7429
CBSE Class 10 Maths · Real Numbers
CBSE Class 10 Maths · Real Numbers
Imagine a giant toy castle made of special building blocks that cannot be broken down further. To find which blocks make up this big castle, we try to split it into equal groups. We test different block sizes until we find the magic ones that fit perfectly. By dividing, we discover that multiplying three special blocks of seventeen, nineteen, and twenty-three builds our exact castle. This clever trick helps us easily see the hidden pieces inside any very large number.
Answer: \(7429 = 17 \times 19 \times 23\)
Prime factorisation is the process of expressing a composite number as the product of its prime factors. According to the Fundamental Theorem of Arithmetic, every composite number can be uniquely factored into prime numbers, regardless of the order in which they are written.
To find the prime factors of a large number like \(7429\), we systematically test divisibility by prime numbers in increasing order: \(2, 3, 5, 7, 11, 13, 17, 19, 23, \dots\)
Any composite number \( N \) can be represented as:
\[N = p_1 \times p_2 \times p_3 \times \dots\]where \(p_1, p_2, p_3, \dots\) are prime numbers.
Dividing \(7429\) by \(17\):
\[7429 \div 17 = 437\]Since it divides completely, we can write: \(7429 = 17 \times 437\).
Now, we find the prime factors of \(437\). We continue testing primes starting from \(17\):
Since \(23\) is also a prime number, we have successfully found all the prime factors.
Combining all the prime factors, we get:
\[7429 = 17 \times 19 \times 23\]The prime factorisation of \(7429\) is:
\[\mathbf{7429 = 17 \times 19 \times 23}\]Giving up too early: Students often test divisibility only up to \(11\) or \(13\) and assume that \(7429\) is a prime number because it is not divisible by smaller primes. Always continue testing prime numbers up to the square root of the number (since \(\sqrt{7429} \approx 86.19\), you should theoretically test primes up to \(83\) if needed).
\(7429 = 17 \times 19 \times 23\)
One common mistake: Students often assume a large number like 437 is prime without testing prime factors up to its square root (\(\sqrt{437} \approx 20.9\)), thereby missing the factor 19.
\[7429 \div 17 = 437\]
\[437 \div 19 = 23\]
\[23 \div 23 = 1\]
Answer: \(7429 = 17 \times 19 \times 23\)
Question: Express 5765 as a product of its prime factors.
Solution: We divide 5765 by successive primes.
Check divisibility by 2: 5765 is odd, so not divisible by 2.
Check divisibility by 5: last digit is 5, so divisible by 5. \[5765 \div 5 = 1153\] Now factorise 1153.
Check 1153 by 2: odd, skip. By 3: \(1+1+5+3 = 10\), not divisible by 3. By 7: \(1153 \div 7 \approx 164.7\), no. By 11: \(1153 \div 11 = 104.8\), no. By 13: \(1153 \div 13 = 88.7\), no. By 17: \(1153 \div 17 = 67.8\), no. By 19: \(1153 \div 19 = 60.7\), no. By 23: \(1153 \div 23 = 50.1\), no. By 29: \(1153 \div 29 = 39.8\), no. By 31: \(1153 \div 31 = 37.2\), no. By 37: \(1153 \div 37 = 31.2\), no. Since \(\sqrt{1153} \approx 33.9\), we only need to check primes up to 33. We have checked all of them, so 1153 is prime.
Therefore: \[5765 = 5 \times 1153\]
Answer: \( 5765 = 5 \times 1153 \)
Question: Express 9867 as a product of its prime factors.
Solution: We divide 9867 by successive primes.
Check divisibility by 2: 9867 is odd, skip. By 3: \(9 + 8 + 6 + 7 = 30\), which is divisible by 3. \[9867 \div 3 = 3289\] Now factorise 3289.
Check 3289 by 3: \(3+2+8+9 = 22\), not divisible by 3. By 7: \(3289 \div 7 = 469.9\), no. By 11: \(3289 \div 11 = 299\). Yes! \[3289 \div 11 = 299\] Now factorise 299.
Check 299 by 11: \(299 \div 11 = 27.2\), no. By 13: \(299 \div 13 = 23\). Yes! \[299 \div 13 = 23\] Now 23 is itself a prime number.
Putting it all together: \[9867 = 3 \times 11 \times 13 \times 23\]
Answer: \( 9867 = 3 \times 11 \times 13 \times 23 \)
Question: Express the number 4199 as a product of its prime factors.
Every composite number can be uniquely expressed as a product of prime numbers. To find these factors, we systematically test divisibility using prime numbers in ascending order: \(2, 3, 5, 7, 11, 13, 17, \dots\)
Answer:\[4199 = 13 \times 17 \times 19\]