An Important Property of HCF & LCM + Practice Question
Duration: 13 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a comprehensive lesson on finding the Highest Common Factor (HCF), also known as the Greatest Common Divisor (GCD). The lecture begins with an introduction to the topic, defining HCF and establishing a key property: the HCF of a set of numbers is always less than or equal to the smallest number in the set. The instructor then demonstrates the fundamental method of finding the HCF by listing the factors of each number and identifying the largest common factor. This method is applied to the numbers 6, 12, and 18, resulting in an HCF of 6. The video progresses to a more efficient method using prime factorization, which is demonstrated by breaking down the numbers 30, 42, and 135 into their prime factors and multiplying the common prime factors. The final segment presents a multiple-choice question to test the viewer's understanding, where the correct answer is determined to be 3. The video concludes with a 'Thanks for Watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card displaying 'LCM & HCF' against a digital, data-stream background. It then transitions to a classroom setting with a cartoon teacher and a live instructor. The main topic is introduced as 'Highest Common Common Factor (HCF)'. The instructor, Yash Jain, begins by stating a fundamental property of HCF: 'HCF is always smaller than or equal to the smallest number'. This is written on the screen as a key concept. The video then introduces a worked example with the numbers 6, 12, and 18, setting up the problem HCF(6, 12, 18).
2:00 – 5:00 02:00-05:00
The instructor explains the method for finding the HCF by listing the factors of each number. He writes out the factors of 6 as {1, 2, 3, 6}, the factors of 12 as {1, 2, 3, 4, 6, 12}, and the factors of 18 as {1, 2, 3, 6, 9, 18}. He then identifies the common factors (CF) as {1, 2, 3, 6} and concludes that the Highest Common Factor (HCF) is 6. This is visually confirmed with a checkmark next to the answer. The instructor also writes the inequality HCF ≤ 6, reinforcing the earlier rule that the HCF is less than or equal to the smallest number.
5:00 – 10:00 05:00-10:00
The video transitions to a new problem: 'Find the GCD of 30, 42, 135?'. The instructor begins to solve this using the prime factorization method. He starts by dividing 30 by 2, getting 15, and then divides 15 by 3, getting 5. He then divides 42 by 2, getting 21, and divides 21 by 3, getting 7. For 135, he divides by 3, getting 45, then by 3 again, getting 15, and finally by 3 again, getting 5. He then writes the prime factorization of each number: 30 = 2 × 3 × 5, 42 = 2 × 3 × 7, and 135 = 3 × 3 × 3 × 5. He identifies the common prime factor, which is 3, and concludes that the GCD is 3. He marks the correct answer (A) as 3 and crosses out the other options.
10:00 – 12:47 10:00-12:47
The instructor reviews the solution to the multiple-choice question, confirming that the GCD of 30, 42, and 135 is 3. He shows the prime factorization of each number again, emphasizing that the only common prime factor is 3. The video then displays a 'Thanks for Watching' screen, concluding the lesson. The entire video is presented as a tutorial by Knowledge Gate Eduventures, with a copyright notice visible at the bottom of the screen throughout.
The video provides a clear, step-by-step tutorial on finding the Highest Common Factor (HCF). It begins by establishing a foundational rule that the HCF is always less than or equal to the smallest number. The primary method demonstrated is the factor listing method, which is used to find the HCF of 6, 12, and 18, resulting in 6. The video then introduces the more efficient prime factorization method to solve a more complex problem involving 30, 42, and 135. By breaking down each number into its prime factors, the instructor identifies the common factors and calculates the GCD as 3. The lesson is structured to build from a basic concept to a more advanced application, using worked examples and a multiple-choice question to reinforce learning.

