Another Short Trick to find HCF of Big Numbers

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/quantitative-ability/hcf-lcm/basic-concepts-factors-multiples-prime-composite-numbers/asset-another-short-trick-to-find-hcf-of-big-numbers after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Yash Jain from Knowledge Gate Eduventures, is a tutorial on finding the Highest Common Factor (HCF), also known as the Greatest Common Divisor (GCD). The video begins with an introduction to the topic, defining HCF and LCM, and then transitions to a practical problem: finding the GCD of three large numbers—1365, 1560, and 1755. The instructor demonstrates the prime factorization method as the primary technique. He systematically breaks down each number into its prime factors, writing the factor trees on the screen. For 1365, he shows the factorization as 3 × 5 × 7 × 13. For 1560, he factors it as 2³ × 3 × 5 × 13. For 1755, he factors it as 3³ × 5 × 13. The video concludes by identifying the common prime factors among all three numbers—3, 5, and 13—and multiplying them to find the GCD, which is 195. The final answer is confirmed as option (b) 195.

Chapters

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

    The video opens with a title card for 'LCM & HCF' and then transitions to a classroom setting. An animated teacher stands by a green chalkboard that displays the text 'Highest Common Common Factor Factor (HCF)'. The instructor, Yash Jain, is visible in a small window. The video then moves to a new slide titled 'HCF of Big Numbers', which presents a multiple-choice question: 'Find the GCD of 1365, 1560, 1755?' with options (a) 95, (b) 195, (c) 295, (d) None of these. The instructor begins to explain the problem, setting up the context for the lesson.

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

    The instructor begins the solution by demonstrating the prime factorization of the first number, 1365. He writes a factor tree, dividing 1365 by 3 to get 455, then 455 by 5 to get 91, and finally 91 by 7 to get 13. He concludes that 1365 = 3 × 5 × 7 × 13. He then proceeds to factor 1560, writing 1560 = 2³ × 3 × 5 × 13. Next, he factors 1755, showing 1755 = 3³ × 5 × 13. After establishing the prime factorization of all three numbers, he identifies the common prime factors: 3, 5, and 13. He multiplies these common factors (3 × 5 × 13) to find the GCD, which is 195. He then circles the correct answer, (b) 195, on the screen.

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

    The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in white and orange letters. This is a standard closing slide for the educational content.

The video provides a clear, step-by-step demonstration of how to find the GCD of three large numbers using prime factorization. It begins by introducing the concept of HCF and then applies it to a specific problem. The core of the lesson is the method of breaking down each number into its prime factors, which is visually represented through factor trees. The key learning point is that the GCD is the product of the common prime factors. The video effectively uses on-screen annotations to guide the viewer through the calculation, making the process easy to follow and understand.

Loading lesson…