Short Trick to find HCF of Big Numbers

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/quantitative-aptitude/hcf-lcm/finding-hcf/asset-short-trick-to-find-hcf-of-big-numbers after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: 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 Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
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 tutorial on finding the Highest Common Factor (HCF) of large numbers. The video begins with an introduction to the topic, defining HCF and explaining its relationship with LCM. The core of the lesson focuses on a practical method for simplifying the calculation of HCF for large numbers by first dividing all numbers by a common factor, typically 10, to reduce them to smaller, more manageable values. This is demonstrated with the example HCF(750, 6300, 18900), where the numbers are divided by 10 to get 75, 630, and 1890. The video then applies the standard prime factorization method to these reduced numbers, showing the step-by-step process of dividing by common prime factors (2, 3, 5) until the numbers are co-prime. The final HCF of the reduced numbers is calculated as 15. The video concludes by multiplying this result by the initial common factor (10) to obtain the correct HCF of the original large numbers, which is 150. The lesson is reinforced with a second example, HCF(108, 288, 360), which is simplified by dividing by 2 to get 54, 144, and 180, and then further reduced to 27, 72, and 90, and so on, to find the HCF of 36. The video uses a digital whiteboard for all calculations and includes a copyright notice.

Chapters

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

    The video opens with a title card displaying 'LCM & HCF' against a digital background. It then transitions to a classroom setting with a cartoon teacher and a live instructor, Yash Jain. The topic is introduced as 'Highest Common Common Factor (HCF)'. The instructor explains that the video will cover the HCF of big numbers, setting the stage for the main lesson.

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

    The instructor presents the first example: HCF(750, 6300, 18900). He demonstrates the method of simplifying the problem by dividing all three numbers by 10, as they are all divisible by 10. This reduces the problem to finding HCF(75, 630, 1890). He then begins the prime factorization process on the reduced numbers, starting by dividing by 2, 3, and 5, and writing down the resulting quotients.

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

    The instructor continues the prime factorization for HCF(75, 630, 1890). He divides the numbers by 3, then by 5, and then by 3 again, showing the step-by-step reduction. The process reveals that the common factors are 3 and 5, and the final co-prime numbers are 1, 1, and 1. He calculates the HCF of the reduced numbers as 3 x 5 = 15. He then multiplies this result by the initial common factor of 10 to get the final answer: 15 x 10 = 150. He confirms this is the correct HCF of the original large numbers.

  4. 10:00 – 10:21 10:00-10:21

    The video presents a second example: HCF(108, 288, 360). The instructor begins by dividing all numbers by 2, resulting in 54, 144, and 180. He continues the process, dividing by 2 again to get 27, 72, and 90. He then divides by 3 to get 9, 24, and 30, and continues to find the HCF of these numbers. The video ends with a 'THANKS FOR WATCHING' screen.

The video provides a clear, step-by-step guide on how to find the HCF of large numbers by first simplifying the problem. The central concept is that if all numbers in a set are divisible by a common factor, the HCF of the original numbers can be found by first dividing all numbers by that common factor, calculating the HCF of the resulting smaller numbers, and then multiplying the result by the initial common factor. This method is demonstrated effectively with two examples, showing the reduction of large numbers to manageable ones through division by common factors (10 and 2), followed by the standard prime factorization technique to find the HCF of the simplified set. The final answer is obtained by reversing the initial simplification step.

Loading lesson…