Short Trick to find LCM using Co-Prime Numbers Concept

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/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. 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, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, 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, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…