Demo: Short Trick to find HCF by minimum difference method
Duration: 14 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 demonstrates a specialized technique for calculating the Highest Common Factor (HCF) known as the Minimum Difference Method. The core concept involves finding the difference between two or more numbers and analyzing its factors to determine the HCF. The instructor emphasizes a critical caveat: the minimum difference itself is not always the final answer, as some of its factors may need to be eliminated if they do not divide all original numbers evenly. The lesson progresses from simple two-number examples to more complex three-number scenarios, illustrating how to systematically test prime factors of the difference against the original set. Key steps include calculating differences, performing prime factorization on those differences, and verifying divisibility to isolate the true common factor.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with an introduction to the 'Minimum Difference Method' for finding HCF, using 56 and 84 as the primary example. The instructor immediately highlights a crucial theoretical constraint displayed on screen: 'Every time minimum difference will not be the final answer. Some factors of min. difference may be eliminated.' This sets the stage for a method that requires verification rather than simple subtraction. The visual text '4. HCF by Minimum Difference Method' and the problem statement 'HCF (56, 84)' establish the specific topic. The instructor begins by calculating the difference between the two numbers, showing '84 - 56 = 28' on screen. This initial segment focuses on setting up the problem and warning students against assuming the difference is automatically the HCF, preparing them for a factorization process.
2:00 – 5:00 02:00-05:00
In this segment, the instructor demonstrates the factorization of the calculated difference (28) to find potential HCFs. The screen displays the prime factorization '28 = 2 x 2 x 7'. The teaching process involves testing these factors against the original numbers (56 and 84) to see if they divide evenly. The instructor notes that factors of the minimum difference may be eliminated, reinforcing the earlier warning. A specific visual cue 'Reserved Words : 2' appears, indicating that certain factors are being set aside or tracked during the process. The instructor explains that while 2 is a factor of both numbers, it might not be the highest common one if other factors like 7 are also present. This section bridges the gap between calculating a difference and rigorously testing its components to find the true HCF.
5:00 – 10:00 05:00-10:00
The lesson expands to handle three numbers, introducing the problem 'HCF (15, 39, 153)'. The instructor calculates the differences between pairs of these numbers to identify a minimum difference, which is found to be 24. The screen explicitly shows 'min diff = 24' and its prime factorization '24 = 2x2x2x3'. A critical rule is displayed: 'If all the factors are eliminated, then HCF will be 1', covering cases where numbers share no common factor other than unity. The instructor proceeds to test the factors of 24 against the original numbers (15, 39, 153). This part of the video illustrates how to manage multiple numbers by focusing on the smallest difference and systematically eliminating factors that do not divide all three values, ensuring a robust method for complex sets.
10:00 – 13:33 10:00-13:33
The final segment applies the method to a more complex set of three numbers: 'HCF (238, 322, 434)'. The instructor identifies a common difference of 84 and begins factorizing it, showing '84 = 21 x 4' and '84 = 7 x 3 x 2 x 2'. A key technique demonstrated is dividing the original numbers by a common factor (in this case, 2) to simplify the problem, resulting in new values '119, 161, 217'. The instructor then checks for further common factors like 7 and 17 in these reduced numbers. The video concludes with a brief example 'HCF (5, 18)' where the minimum difference is 13, followed by a 'THANKS FOR WATCHING' screen. This section reinforces the iterative nature of the method, showing how to reduce numbers and continue testing factors until the HCF is fully determined.
The video provides a structured approach to finding the Highest Common Factor (HCF) using the Minimum Difference Method, which is particularly useful for numbers that are close in value or have large prime factors. The central thesis is that the difference between numbers contains all potential common factors, but not every factor of the difference will necessarily be a common factor for the entire set. The method requires a two-step verification process: first, calculating the difference and factorizing it into primes; second, testing each prime factor against all original numbers to ensure divisibility. The instructor uses a progression of examples, starting with two numbers (56, 84), moving to three numbers (15, 39, 153), and finally tackling larger values (238, 322, 434). A recurring visual aid is the 'Reserved Words' or tracking of factors like 2, which helps students keep track of common divisors found during the process. The lesson also addresses edge cases, such as when all factors are eliminated, resulting in an HCF of 1. This technique simplifies the search space for common factors compared to traditional prime factorization of all numbers, making it an efficient tool for competitive exams or quick calculations.

