Every composite number has exactly one blueprint of prime factors, in exactly one combination, no matter how you go about finding it. That single fact of uniqueness turns out to be the one tool this whole chapter runs on -- it builds HCF and LCM directly, and it is also the hidden engine that proves numbers like the square root of 2 can never be written as a fraction.
Part of Karnataka State Board Class 10 Mathematics on Lipi
This chapter is free. Every subject of Karnataka · KSEEB · Class 10 is one module: ₹499 + GST a month →Sonia and Ravi, and when two loops line back up
Sonia takes 18 minutes per lap and Ravi 12. Both start together. Each returns to the start after a whole number of laps, so the first shared return is the Lowest Common Multiple. Sonia's return times are 18, 36, 54, ... minutes; Ravi's are 12, 24, 36, ... minutes. The first common time is 36 minutes. Prime factorisation confirms it: 18=2×3² and 12=2²×3; take the greatest power of each prime, so LCM=2²×3²=36. In 36 minutes Sonia completes two laps and Ravi three.
One blueprint, however you take a number apart
Factor 32760 into primes, following the book's large example. Divide by 2 three times to reach 4095; divide by 3 twice to reach 455; then 455=5×91=5×7×13. Thus 32760=2×2×2×3×3×5×7×13=2³×3²×5×7×13. The Fundamental Theorem of Arithmetic says every composite number can be expressed as a product of primes, and that prime-factor list is unique apart from its order. Reordering these same factors is not a different factorisation.
HCF and LCM, read straight off the blueprint
Use the book's first prime-factor example, 6=2×3 and 20=2²×5. HCF takes the smallest power of each prime common to both numbers: only 2 is shared, so HCF=2. LCM takes the greatest power of every prime present: 2²×3×5=60. For two positive numbers, HCF(a,b)×LCM(a,b)=a×b; here 2×60=120 and 6×20=120. The larger 96-and-404 example and the three-number case are handled separately, so this video stays on one idea.
The same uniqueness, turned into a proof that a number is NOT a fraction
The book's prime-square theorem says that if a prime p divides u², then p divides u: squaring repeats prime factors but creates no new prime. To prove √2 irrational, assume √2=a/b in lowest terms, where a and b share no factor greater than 1. Squaring gives 2b²=a², so 2 divides a² and therefore a; write a=2c. Substitute: 2b²=4c², hence b²=2c², so 2 divides b² and therefore b. Now a and b both have factor 2, contradicting lowest terms. The assumption was false; √2 is irrational.
Book Example 6: why 5−√3 is irrational
The book has already established that √3 is irrational. To prove 5−√3 is irrational, assume the opposite: let 5−√3=a/b for integers a and b with b nonzero. Isolating the root gives √3=5−a/b=(5b−a)/b. The numerator and denominator are integers, so this would make √3 rational—contradicting the known result. Therefore the assumption is false and 5−√3 is irrational. This video stays on this one proof; the book's separate 3√2 example is taught separately.
Book Example 7: why 3√2 is irrational
The book first proves that √2 is irrational. Now suppose, for contradiction, that 3√2 is rational. Then 3√2=a/b for integers a,b with b nonzero. Dividing both sides by 3 gives √2=(a/b)/3=a/(3b). Since a and 3b are integers and 3b is nonzero, this would make √2 rational. That contradicts the proved result. Therefore 3√2 is irrational. This is the book's Example 7, kept separate from the preceding 5−√3 proof so each video has one clear question.
Uses your saved EN voice · Narration settings
Point 1
Point 2
Point 3
Point 4
Point 5
Point 6
Uses your saved EN voice · Narration settings
Point 1
One single fact -- that prime factorisation is unique -- is genuinely powerful enough to build two seemingly unrelated tools: a direct formula for HCF and LCM, and a watertight method for proving a number can never be written as a fraction.
Point 2
A clean identity that holds for 2 numbers (HCF x LCM = product) does not automatically generalise to 3 or more -- always worth checking a pattern's boundary rather than assuming it stretches indefinitely.
Point 3
Textbooks get edited and trimmed over time; an intro paragraph can occasionally reference content that a later rationalisation quietly removed. Reading the actual section that follows, rather than assuming the intro is a perfectly accurate table of contents, is a genuinely useful habit.
Uses your saved EN voice · Narration settings
सामान्य भूल
✕ HCF(a,b) x LCM(a,b) = a x b works no matter how many numbers are involved.
✓ It only works for EXACTLY 2 numbers. For 3 or more numbers (e.g. 6, 72, 120), the product of all the numbers does NOT equal HCF x LCM -- a different, more complex formula is needed for 3+ numbers.
सामान्य भूल
✕ Proving the square root of 2 is irrational and finding the LCM of two numbers are two unrelated skills in this chapter.
✓ Both rest on exactly the same fact: the Fundamental Theorem of Arithmetic's uniqueness. One direction builds HCF/LCM directly from prime-power blueprints; the other direction is what makes every irrationality proof's contradiction actually bite.
सामान्य भूल
✕ This chapter covers Euclid's Division Algorithm, since the book's own introduction mentions it.
✓ The current syllabus removed Euclid's Division Lemma/Algorithm (and decimal-expansion classification) from this chapter in a recent rationalisation. The intro paragraph's mention of it is a leftover reference from an older edition, not content that actually appears in the chapter that follows.
Uses your saved EN voice · Narration settings
Point 1
Point 2
Next in prescribed order
Polynomials
Continue when you’re ready. You can still choose any chapter from the contents.
Open next chapter →