Demo: Trick to find HCF by Long Division Method

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-1-basic-numeracy/hcf-lcm/finding-hcf/asset-demo-trick-to-find-hcf-by-long-division-method after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: 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, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video demonstrates the Long Division Method for calculating the Highest Common Factor (HCF) of numbers, progressing from basic definitions to complex multi-number problems. The instructor begins by defining the components of division—dividend, divisor, quotient, and remainder—using a simple example (14 divided by 3) to establish terminology. The core algorithm is then introduced: for two numbers, the larger number serves as the dividend and the smaller as the divisor. The process involves successive divisions where the remainder from one step becomes the divisor for the next, and the previous divisor becomes the new dividend. This cycle continues until a remainder of zero is achieved; at this point, the final non-zero divisor represents the HCF. The method is shown to be particularly effective for large numbers where prime factorization might be tedious.

Chapters

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

    The video opens with an introduction to HCF and LCM concepts before transitioning to the specific topic of 'HCF by Long Division Method'. The instructor sets up a foundational example using 14 divided by 3 to label the divisor, dividend, quotient, and remainder. On-screen text explicitly identifies these parts as 'divisor', 'dividend', 'quotient', and 'remainder'. The instructor emphasizes the rule that for HCF calculations, the larger number must be placed in the dividend position and the smaller in the divisor position. This segment establishes the necessary vocabulary and setup rules before tackling actual HCF problems.

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

    The instructor applies the Long Division Method to find the HCF of 48 and 72. The process begins by dividing 72 (dividend) by 48 (divisor), yielding a quotient and a remainder of 24. The video demonstrates the iterative nature of the algorithm: the previous divisor (48) becomes the new dividend, and the remainder (24) becomes the new divisor. The division continues until a zero remainder is obtained, at which point the final non-zero divisor (24) is identified as the HCF. The on-screen text reinforces this logic with cues like 'remainder -> divisor' and 'prev-divisor -> dividend', confirming the result HCF = 24.

  3. 5:00 – 6:29 05:00-06:29

    The lesson extends the method to three numbers (770, 1430, and 1760), noting the method is 'Applicable for Large Numbers'. The instructor first calculates the HCF of 1430 and 770, obtaining an intermediate result of 110. This result is then treated as a divisor for the third number, 1760. The final division of 1760 by 110 yields a zero remainder, confirming that 110 is the HCF for all three numbers. The video concludes with a 'THANKS FOR WATCHING' message, having successfully demonstrated the step-by-step reduction of multiple numbers to a single common factor.

The video provides a structured tutorial on the Long Division Method for HCF, emphasizing its utility for large numbers. The pedagogical flow moves from terminology definition to a two-number example, and finally to a three-number application. Key takeaways include the rule of placing the larger number as the dividend and the iterative process where remainders become subsequent divisors. The method is validated by reaching a zero remainder, which signals the final HCF. This approach simplifies finding common factors without requiring prime factorization.

Loading lesson…