How to find HCF Quickly with the help of given options
Duration: 6 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 is a lecture on finding the Highest Common Factor (HCF) using the method of prime factorization, presented by an instructor from Knowledge Gate Eduventures. The video begins with a title slide introducing the topic of LCM and HCF, followed by a section on 'HCF using Least Number'. The core of the lecture consists of two worked examples. The first example asks to find the HCF of 24, 60, 84, and 108. The instructor demonstrates the prime factorization method by dividing all numbers by the smallest common prime factor, 2, and continues the process with the resulting quotients until no common factors remain. The final HCF is calculated as the product of the common prime factors, which is 12. The second example involves finding the HCF of 108, 288, and 360. The instructor applies the same method, dividing by 2 and then by 3, and concludes that the HCF is 36. The video concludes with a 'Thanks for Watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title slide featuring the text 'LCM & HCF' against a dark, digital-themed background. It then transitions to a presentation slide with a green chalkboard background, where the instructor, Yash Jain, introduces the topic 'HCF' and 'LCM' with a diagram showing the prime factorization method. The slide also displays the title '5. HCF using Least Number' and the 'Knowledge Gate Educa' logo. The instructor is visible in a small window in the bottom right corner, beginning to explain the concept.
2:00 – 5:00 02:00-05:00
The video displays a question on a yellow background: 'Que: Find the HCF of 24, 60, 84, 108?'. The instructor begins the solution by writing the numbers and then divides them by the smallest common prime factor, 2, as shown by the equation '24/2 = 12'. He continues this process, dividing the resulting quotients by 2 again, and then by 3, as seen in the handwritten calculations. The final HCF is determined to be 12, which is circled as the correct answer (D) from the multiple-choice options.
5:00 – 6:23 05:00-06:23
A new question appears: 'Que: Find the HCF of 108, 288, 360?'. The instructor applies the same prime factorization method, starting by dividing all numbers by 2, as shown by the calculation '108/2 = 54'. He continues the process, dividing by 2 again and then by 3, with the calculations '108/36 = 3' and '288/36 = 8' visible. The final HCF is identified as 36, which is marked as the correct answer (A). The video ends with a 'THANKS FOR WATCHING' screen.
The video provides a clear, step-by-step demonstration of the prime factorization method for finding the Highest Common Factor (HCF). It begins with an introduction to the topic and then presents two distinct problems. The first problem, finding the HCF of 24, 60, 84, and 108, is solved by systematically dividing all numbers by their common prime factors (2, 2, and 3), resulting in an HCF of 12. The second problem, for 108, 288, and 360, follows the same procedure, yielding an HCF of 36. The consistent use of visual annotations and a clear, methodical approach makes the concept accessible for students preparing for competitive exams.

