Short Trick to find HCF by using smallest element

Duration: 10 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-short-trick-to-find-hcf-by-using-smallest-element 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
  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
  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):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a step-by-step tutorial on calculating the Highest Common Factor (HCF) using the 'Least Number' method, which is a variation of the prime factorization technique. The instructor, Yash Jain, begins by introducing the topic and then demonstrates the method with several examples. The first example involves finding the HCF of 6, 12, and 18. The method involves identifying the smallest number among the given numbers (the 'pivot element') and then checking if it divides all other numbers. If it does, it is the HCF. If not, the process is repeated with the next smallest number. The video then applies this method to more complex sets of numbers, such as (8, 16, 20, 28, 44) and (8, 11, 16, 20, 28, 44, 46), consistently demonstrating the process of elimination to find the highest common factor. The video concludes with a final example and a 'Thanks for Watching' screen.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card displaying 'LCM & HCF' against a digital background. It then transitions to a lecture slide with a green chalkboard background. The slide is titled '5. HCF using Least Number' and presents the first example: 'HCF (6, 12, 18)'. The instructor, Yash Jain, begins to explain the method, writing the numbers 6, 12, and 18 on the board. He identifies 6 as the smallest number and the 'pivot element' for the method, explaining that the goal is to find the highest common factor by checking divisibility.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues the first example, demonstrating the 'Least Number' method. He writes '6, 12, 18' and circles the number 6, labeling it the 'pivot element'. He then checks if 6 divides 12 and 18. He writes '6/12 = 2' and '6/18 = 3', indicating that 6 divides both numbers. Since 6 divides all the numbers in the set, he concludes that the HCF is 6, writing 'HCF = 6'. The video then moves to the next example, 'HCF (8, 16, 20, 28, 44)'. He identifies 8 as the pivot element and checks if it divides all other numbers. He writes '8/16 = 2', '8/20 = 2.5', and '8/28 = 3.5', showing that 8 does not divide 20 or 28. He then circles 8 and marks the other numbers with a cross, indicating they are not divisible by 8. He then identifies the next smallest number, 16, as the new pivot element and begins to check its divisibility.

  3. 5:00 – 9:34 05:00-09:34

    The instructor continues with the second example, 'HCF (8, 16, 20, 28, 44)'. He checks if 16 divides 8, 20, 28, and 44, and finds that it does not. He then moves to the next smallest number, 20, and checks its divisibility, finding it fails. He continues this process, checking 28 and 44, all of which fail. He then identifies 4 as a common factor and checks if it divides all numbers, finding that it does. He concludes that the HCF is 4. The video then presents a third example: 'HCF (8, 11, 16, 20, 28, 44, 46)'. He identifies 8 as the pivot element and checks divisibility, finding it fails for 11, 16, 20, 28, 44, and 46. He then checks 11, which fails for 8, 16, 20, 28, 44, and 46. He continues this process, eventually finding that 2 is the only number that divides all the numbers in the set. He concludes that the HCF is 2. The video ends with a 'Thanks for Watching' screen.

The video systematically teaches a specific method for finding the Highest Common Factor (HCF) by using the 'Least Number' approach. The core concept is to start with the smallest number in the set and test if it is a common divisor for all other numbers. If it is, it is the HCF. If not, the process is repeated with the next smallest number until a common divisor is found. This method is demonstrated through three distinct examples, each increasing in complexity, to reinforce the concept. The video effectively uses on-screen writing and clear verbal explanation to guide the viewer through the logical steps of the algorithm, making it a practical tutorial for students learning about HCF.

Loading lesson…