Short Trick to find LCM using Prime Factorization

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/general-aptitude/hcf-lcm/finding-lcm/asset-short-trick-to-find-lcm-using-prime-factorization after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  2. DataBase Management System/DBMS: 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
  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: 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, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Hardware Basics
  10. Theory Of Computation/Automata Theory: 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, 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, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lesson on finding the Least Common Multiple (LCM) and Highest Common Factor (HCF) using the prime factorization method. The instructor begins by introducing the topic and then demonstrates the method step-by-step with the example of LCM(12, 18). The process involves breaking down each number into its prime factors, identifying the highest power of each prime factor present in either number, and multiplying these together to find the LCM. The video then applies the same method to find the LCM and HCF of 24 and 60, explicitly showing the prime factorization of 24 as 2^3 x 3 and 60 as 2^2 x 3 x 5. The instructor explains that the LCM is the product of the highest powers of all prime factors (2^3 x 3 x 5 = 120), while the HCF is the product of the lowest powers of the common prime factors (2^2 x 3 = 12). A Venn diagram is used to visually represent this concept, with the intersection representing the HCF and the union representing the LCM. The video concludes by reinforcing the relationship between LCM and HCF with the formula LCM x HCF = product of the two numbers.

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 setting. The instructor, Yash Jain, introduces the topic of 'Least Common Multiple (LCM)' and 'Highest Common Factor (HCF)'. The screen displays a slide with the title '4. LCM using Prime Factorization Method' and the example 'LCM (12, 18)'. The instructor begins to explain the method, setting the stage for a detailed demonstration.

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

    The instructor demonstrates the prime factorization of 12 and 18. He writes the prime factorization of 12 as 2 x 2 x 3, or 2^2 x 3, and for 18 as 2 x 3 x 3, or 2 x 3^2. He then explains the rule for finding the LCM: take the highest power of each prime factor. For 12 and 18, the highest power of 2 is 2^2 and the highest power of 3 is 3^2. He writes the LCM as 2^2 x 3^2, which equals 4 x 9 = 36.

  3. 5:00 – 10:00 05:00-10:00

    The video presents a multiple-choice question: 'The LCM of 2^6 * 3^2 * 5 * 7 and 2^3 * 3^5 * 7 is:'. The instructor explains that to find the LCM, one must take the highest power of each prime factor. The highest power of 2 is 2^6, of 3 is 3^5, of 5 is 5^1, and of 7 is 7^1. He writes the LCM as 2^6 x 3^5 x 5 x 7. The video then moves to a new example, LCM & HCF (24, 60). The instructor writes the prime factorization of 24 as 2^3 x 3 and 60 as 2^2 x 3 x 5.

  4. 10:00 – 13:11 10:00-13:11

    The instructor calculates the LCM of 24 and 60 by taking the highest powers of the prime factors: 2^3, 3^1, and 5^1, resulting in 2^3 x 3 x 5 = 120. He then calculates the HCF by taking the lowest powers of the common prime factors: 2^2 and 3^1, resulting in 2^2 x 3 = 12. A Venn diagram is used to illustrate this, with the intersection (common factors) representing the HCF (2 x 2 x 3 = 12) and the union (all factors) representing the LCM (2 x 2 x 2 x 3 x 5 = 120). The video concludes by showing that LCM x HCF = 120 x 12 = 1440, which equals 24 x 60.

The video systematically teaches the prime factorization method for finding the LCM and HCF. It starts with a clear definition and a simple example (12, 18) to establish the core principle: for LCM, take the highest power of each prime factor; for HCF, take the lowest power of the common prime factors. The lesson progresses to a more complex numerical example (24, 60) and a conceptual multiple-choice question, reinforcing the method. The use of a Venn diagram provides a powerful visual aid to distinguish between the intersection (HCF) and the union (LCM) of the prime factors, making the abstract concept more tangible. The final demonstration of the formula LCM x HCF = product of the numbers serves as a valuable verification step and a key takeaway for students.

Loading lesson…