Short Trick to find HCF of more than 2 numbers

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-a-aptitude/hcf-lcm/finding-hcf/asset-short-trick-to-find-hcf-of-more-than-2-numbers after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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, Hardware basics
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lesson on finding the Highest Common Factor (HCF) of multiple numbers using the 'by parts' method. The video begins with an introduction to the topic, defining HCF and presenting the core formula: HCF(a,b,c) = HCF(HCF(a,b),c). The instructor then demonstrates this method with a detailed example, calculating HCF(24, 40, 42, 44). The process involves breaking down the four numbers into pairs, first finding the HCF of the first two numbers (24 and 40), which is 8. This result is then used to find the HCF with the next number (42), yielding 2. Finally, the HCF of 2 and 44 is calculated, resulting in 2. The video uses a digital whiteboard for all calculations and includes a small inset of the instructor, Yash Jain, who explains the steps. The lesson concludes with a final answer and a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title card for 'LCM & HCF' and transitions to a classroom-style animation. The instructor, Yash Jain, introduces the topic of HCF, defining it as the Highest Common Factor. The on-screen text clearly states 'Highest Common Factor (HCF)' and the formula 'HCF (a,b,c) = HCF (HCF (a,b),c)' is displayed. The instructor explains that this formula is the basis for the 'by parts' method, which will be used to find the HCF of three or more numbers by solving them in pairs.

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

    The instructor begins a worked example, writing 'HCF (24, 40, 42, 44)' on the digital whiteboard. He applies the 'by parts' method, first calculating HCF(24, 40). Using the Euclidean algorithm, he divides 40 by 24, getting a remainder of 16, then divides 24 by 16, getting a remainder of 8, and finally divides 16 by 8, getting a remainder of 0. The last non-zero remainder, 8, is the HCF of 24 and 40. This result is then used to find HCF(8, 42), which is shown to be 2. The process continues with HCF(2, 44), which is 2. The instructor's voiceover explains each step of the calculation.

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

    The final calculation is completed, showing that HCF(2, 44) is 2. The instructor writes the final answer, 'HCF (24, 40, 42, 44) = 2', on the screen. The video then transitions to a black screen with an orange and white 'THANKS FOR WATCHING' message, concluding the lesson.

The video presents a clear, step-by-step demonstration of the 'by parts' method for calculating the HCF of multiple numbers. It effectively breaks down a complex problem into a series of simpler, manageable calculations. The use of a digital whiteboard allows for a clean and organized presentation of the mathematical process, while the instructor's narration provides a clear explanation of the underlying logic, making the concept accessible for students.

Loading lesson…