Short Trick to find LCM using Co-Prime Numbers Concept

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/general-mental-ability-logical-reasoning/hcf-lcm/finding-lcm/asset-short-trick-to-find-lcm-using-co-prime-numbers-concept after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Yash Jain from Knowledge Gate Eduventures, provides a comprehensive lesson on finding the Least Common Multiple (LCM) using the concept of co-prime numbers. The lecture begins with an introduction to the topic, followed by a clear definition of co-prime numbers, stating that any two consecutive numbers (e.g., 12 and 13) and any two prime numbers are co-prime. The core principle is established: the LCM of two co-prime numbers is simply their product. The video then demonstrates this rule through a series of worked examples. The first example, LCM(7, 10, 13), shows that since these numbers are co-prime, their LCM is 7 × 10 × 13 = 910. The second example, LCM(12, 18), illustrates a different method: first, the Highest Common Factor (HCF) is found to be 6, and the numbers are divided by it to get a co-prime pair (2, 3). The LCM is then calculated as HCF × (co-prime pair product) = 6 × 6 = 36. The final example, LCM(48, 72), reinforces the method by showing the HCF is 24, leading to a co-prime pair (2, 3), and the LCM is 24 × 6 = 144. The video concludes with a thank you message.

Chapters

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

    The video opens with a title card displaying 'LCM & HCF' against a digital, data-stream background. It then transitions to a classroom setting with a cartoon teacher and a live instructor, Yash Jain. The main topic is introduced as 'Least Common Multiple (LCM)' on a green chalkboard. The instructor, visible in a small window, begins the lesson by explaining the concept of LCM and HCF, setting the stage for a detailed explanation of a shortcut method.

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

    The video focuses on a slide titled '5. LCM using Co-prime Numbers'. The instructor explains that any two consecutive numbers (e.g., 12 and 13) and any two prime numbers are co-prime. The key rule is highlighted: 'Product of two co-prime numbers = LCM'. The instructor emphasizes that when numbers have no common factor, their LCM is their product. This concept is demonstrated with the example LCM(7, 10, 13), where the numbers are shown to be co-prime, and the LCM is calculated as 7 × 10 × 13 = 910.

  3. 5:00 – 8:47 05:00-08:47

    The instructor presents a second method for finding LCM using co-prime numbers. The example LCM(12, 18) is used. The HCF of 12 and 18 is found to be 6. The numbers are divided by the HCF to get a co-prime pair (2, 3). The LCM is then calculated as HCF × (product of co-prime pair) = 6 × 6 = 36. This method is reinforced with a third example, LCM(48, 72), where the HCF is 24, leading to a co-prime pair (2, 3), and the LCM is 24 × 6 = 144. The video concludes with a 'THANKS FOR WATCHING' screen.

The video presents a clear, step-by-step progression on a specific mathematical shortcut. It starts by defining the core concept of co-prime numbers and establishing the fundamental rule that their LCM is their product. This is then applied to a simple case of three co-prime numbers. The lesson then advances to a more complex scenario, demonstrating a two-step method for numbers that are not co-prime: first, find the HCF, then divide the numbers by the HCF to create a co-prime pair, and finally, multiply the HCF by the product of the co-prime pair. This synthesis of the HCF and co-prime concepts provides a powerful and efficient technique for calculating the LCM.

Loading lesson…