Short Trick to find LCM using Co-Prime Numbers Concept
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- English Comprehension/Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Vocabulary, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Conjunction, Pronoun, Noun, Adjectives, Adverb, Modals, Cloze Test (Cloze Passage), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
- Logical Ability: Coding Decoding, Directions (Direction Test), Analogy, Inequality, Data Sufficiency, Series (Number and Letter Series) (Numerical Relations and Reasoning), Syllogisms, Seating Arrangements, Puzzle Solving (Puzzles), Blood Relations, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Data Arrangement, Venn Diagram, Calendar, Clock
- Quantitative Ability: Logarithm, Permutation and Combination, Probability, Profit and Loss, Speed Time and Distance, Mixture and Alligation, Partnership, Simple Interest and Compound Interest, Percentage, Ratio and Proportion (Ratios), Average, Time and Work, Pipe and Cistern, Number System, Divisibility Rules, HCF LCM, Algebra, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Age Problems, Data Interpretation, Sequence and Series (Series)
- Basic Analytical Ability: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Selection Decision Table (Decision Making)
- Computer Programming: Pseudo Codes, Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
- DBMS (Computer Science): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Concurrency Control, Database Security & Authorization
- SQL (Computer Science): SQL
- OS (Computer Science): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Process Synchronization, Threads & Process Creation, Memory Management, Virtual Memory, File Management
- Computer Networks (Computer Science): 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, Network Security
- Data Structures (Computer Science): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- OOPs (Computer Science): Object Oriented Programming (OOPS)
- Software Engineering (Computer Science): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- SVAR Conversational - Spoken English: Communication Assessment
- HR Interview: MR & HR Interview Preparation
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
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: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.
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.