Demo: Short Trick to find HCF by minimum difference method

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/mathematical-aptitude/hcf-lcm/finding-hcf/asset-demo-short-trick-to-find-hcf-by-minimum-difference-method after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude / गणितीय अभिक्षमता: Number System / संख्या पद्धति, HCF and LCM / महत्तम समापवर्तक और लघुत्तम समापवर्त्य, Divisibility Rules / विभाज्यता के नियम, Percentage / प्रतिशत, Ratio and Proportion / अनुपात और समानुपात, Average / औसत, Profit, Loss and Discount / लाभ, हानि और बट्टा, Time and Work / समय और कार्य, Solid Mensuration / घन क्षेत्रमिति, Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज, Time, Speed and Distance / समय, चाल और दूरी, Age Problems / आयु संबंधी प्रश्न, Mixture and Alligation / मिश्रण और एलिगेशन, Algebra / बीजगणित, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Pipe and Cistern / नल और टंकी, Trigonometry / त्रिकोणमिति, Statistics / सांख्यिकी, Data Interpretation / आँकड़ा निर्वचन, Arithmetic / अंकगणित, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Number Systems and Number Theory / संख्या पद्धति और संख्या सिद्धांत, Coordinate Geometry, Vectors and 3D Geometry / निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ
  3. Logical Reasoning / तार्किक तर्कशक्ति: Series / श्रेणी, Coding-Decoding / कूट लेखन एवं कूट वाचन, Analogy and Classification / सादृश्यता एवं वर्गीकरण, Blood Relations / रक्त संबंध, Direction and Distance / दिशा एवं दूरी, Order and Ranking / क्रम एवं रैंकिंग, Non-Verbal Reasoning / अशाब्दिक तर्क, Seating Arrangement and Puzzles / बैठक व्यवस्था एवं पहेलियाँ, Syllogisms / न्यायवाक्य, Venn Diagrams, Syllogism and Inequalities / वेन आरेख, न्याय वाक्य एवं असमानता, Mathematical Operations and Missing Numbers / गणितीय संक्रियाएँ एवं लुप्त संख्या, Alphabet and Number Test / वर्णमाला एवं संख्या परीक्षण, Statement-Based Reasoning / कथन आधारित तार्किक विवेचन, Analytical Reasoning (Counting Figures Reasoning) / विश्लेषणात्मक तर्क (आकृति गणना तर्क), Cubes, Dice and Figure Counting / घन, पासा एवं आकृतियों की गिनती, Calendar and Clock / कैलेंडर एवं घड़ी, Clock / घड़ी
  4. General Knowledge / सामान्य ज्ञान: Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान, Chemistry / रसायन विज्ञान, Biology / जीव विज्ञान, History / इतिहास, Geography / भूगोल, Polity / राजव्यवस्था, Indian Economy / भारतीय अर्थव्यवस्था, Current Affairs / समसामयिकी, Static General Knowledge / स्थैतिक सामान्य ज्ञान, State-Specific General Knowledge / राज्य विशेष सामान्य ज्ञान
  5. Art of Teaching / शिक्षण कला: Teaching-Learning Process and Classroom Management / शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन, Learners & Learning Process / अधिगमकर्ता और अधिगम प्रक्रिया, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Teaching Methods and Approaches / शिक्षण विधियाँ एवं उपागम, Microteaching and Classroom Communication / सूक्ष्म शिक्षण एवं कक्षा संप्रेषण, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी, Assessment and Evaluation / आकलन एवं मूल्यांकन, Teacher: Qualities, Professional Ethics and Development / शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास, Educational Policies, Acts and Administration / शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन, Curriculum, Arts and Co-curricular Areas / पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र, Guidance and Counselling / निर्देशन एवं परामर्श, Education of Children with Disabilities / दिव्यांग बच्चों की शिक्षा, Micro-Teaching & Teaching Skills / सूक्ष्म शिक्षण और शिक्षण कौशल, Lesson Planning / पाठ योजना
  6. Environmental Science / पर्यावरण विज्ञान: Environment / पर्यावरण
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
  26. Full Length Mock Test – General + Computer Science:
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

  1. 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. 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.

  3. 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.

  4. 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.

Loading lesson…