Lesson 06: Factors, Multiples, and Primes | Brick by Brick Mathematics

Lesson 6 of 76 · Level 1 · Foundations Primes, prime factorisation, HCF, LCM, and the Euclidean algorithm. In this lesson: Every idea is a picture. Divisors are rectangles. Primes are lines. Divisor counts are grids. And the HCF is the biggest square that tiles a rectangle. After this video you can: • Find all factors of a number and decide if a number is prime • Write the prime factorisation of a number and use it to find HCF, LCM, and the number of divisors • Find the HCF of large numbers with the Euclidean algorithm • Prove that there are infinitely many primes Nothing here is meant to be memorised. Every rule in this lesson is derived on screen from a picture or a short argument, so you can rebuild it whenever you need it. ◀ Previous: Lesson 05, Integers ▶ Next: Lesson 07, Divisibility and Parity Watch the full course in order: Brick by Brick Mathematics playlist (76 lessons, from zero to olympiad foundations, following the NCERT Class 6–12 syllabus). Animations made with Manim. Narration is a synthetic voice (Kokoro text-to-speech). #Mathematics #NCERT #MathOlympiad