Demo: Tricks for HCF by Inspection, HCF by Prime Factorization

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/hcf-lcm/finding-hcf/asset-demo-tricks-for-hcf-by-inspection-hcf-by-prime-factorization after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): رسم الخط، حروفِ تہجی اور املا / Script, Alphabet and Spelling, اسم، ضمیر اور صفت / Nouns, Pronouns and Adjectives, الفاظ، محاورے اور ضرب الامثال / Vocabulary, Idioms and Proverbs, تفہیمِ عبارت، انشا اور ترجمہ / Comprehension, Writing and Translation, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি / Meaning, Idioms and Correct Usage, বাক্য ও বাচ্য / Sentences and Voice, শব্দগঠন ও শব্দভান্ডার / Word Formation and Vocabulary, অনুবাদ, বোধপরীক্ষণ ও রচনা / Translation, Comprehension and Composition
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, अशाब्दिक तर्क / Non-Verbal Reasoning, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Trigonometry, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, Chemistry, History, Geography, Indian Economy, Environment, समसामयिकी / Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, कंप्यूटर नेटवर्क / Computer Networks, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), Terms & Abbreviations, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References, OOPS with Java
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive tutorial on calculating the Highest Common Factor (HCF), also known as the Greatest Common Divisor (GCD). The instructor begins by establishing foundational definitions, explaining that a factor is a number that divides another number exactly without leaving a remainder. Using the number 12 as an illustrative example, the instructor lists all integers from 1 to 12 and demonstrates which ones divide evenly (1, 2, 3, 4, 6, 12) versus those that do not (like 7). The lesson then progresses to defining HCF as the largest number common to two or more sets of factors. Two primary methods for finding the HCF are introduced and demonstrated: inspection and prime factorization. The inspection method involves listing all factors of the given numbers and identifying the largest shared value, which is noted to be effective only for small integers. The prime factorization method involves breaking numbers down into their constituent prime factors and multiplying the common primes to find the HCF. The video concludes by highlighting the limitations of these manual methods when applied to large numbers with complex exponents, suggesting alternative tools for such cases.

Chapters

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

    The video opens with an introduction to the concepts of Highest Common Factor (HCF) and Least Common Multiple (LCM). The instructor immediately demonstrates the division method for finding HCF using specific numerical examples on a digital chalkboard. Visual aids include step-by-step calculations showing the division process for both HCF and LCM problems, such as finding the HCF of 455 and 26. The instructor writes 'HCF And LCM' as the title and proceeds to solve a problem involving 6, 96, and 12. Key on-screen text includes 'Highest Common Factor (HCF)' and division notations like '26)455(17'. The instructor underlines key terms and uses a grid layout to organize multi-number division, ensuring students visualize the long division process clearly.

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

    The instructor shifts focus to defining factors (divisors) by writing the question 'What is Factor (Divisor)?' on the screen. He illustrates this concept using the number 12, writing its multiplication form as '3 x 4' and establishing a range from 1 to 12. The instructor lists all numbers in this range and checks divisibility with checkmarks or crosses, demonstrating that dividing 12 by factors like 3 results in whole numbers (4), while non-factors do not. The text '12 = {1, 2, 3, 4, 6, 12}' appears to summarize the factors. The instructor then introduces finding the HCF of 6 and 8 by listing their respective factors: 'Factors of 6 = {1, 2, 3, 6}' and 'Factors of 8 = {1, 2, 4, 8}'. He begins to write the word 'Common' to identify shared factors between these sets.

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

    This segment demonstrates finding the HCF using the inspection method. The instructor lists all factors for two numbers, 12 and 18, to identify their common divisors. The text 'HCF by Inspection' is displayed alongside the problem 'HCF (12, 18)'. The factors are listed as 'Factors(12) = {1, 2, 3, 4, 6, 12}' and 'Factors(18) = {1, 2, 3, 6, 9, 18}'. By comparing these sets, the instructor identifies 'CF(12, 18) = {1, 2, 3, 6}' and selects the highest value, 'HCF(12, 18) = {6}'. The video then introduces the second method, HCF by Prime Factorization. A note appears stating 'HCF by Inspection - This method can be used only for small numbers'. The instructor transitions to an example problem 'HCF (24, 40)' and begins demonstrating the division ladder method to break down these numbers into prime factors.

  4. 10:00 – 15:00 10:00-15:00

    The instructor demonstrates finding the HCF using prime factorization for two different sets of numbers. First, he solves 'HCF(24, 40)' by breaking down both numbers into prime factors: '24 = 2 x 2 x 2 x 3' and '40 = 2 x 2 x 2 x 5'. He identifies the common factors as '2x2x2=8'. The method is then applied to a new problem, 'HCF(12, 30, 48)'. The prime factorizations are written as '12 = 2 x 2 x 3', '30 = 2 x 3 x 5', and '48 = 2 x 2 x 2 x 2 x 3'. The instructor highlights the common prime factors across all three numbers to determine the final HCF, calculated as '2^1 x 3^1 = 6'. A note appears stating this method is best for small numbers where prime factors are easily found.

  5. 15:00 – 17:55 15:00-17:55

    The video transitions from the detailed example of finding the HCF for small numbers (12, 30, 48) to a more complex problem involving large numbers with exponents. The instructor highlights that the prime factorization method is practical only for small numbers where factors are easily identifiable. He presents a problem with three large composite numbers expressed in prime factor form: '1. Find the H.C.F. of 2^3 x 3^2 x 5 x 7^4 x 13^4, 2^2 x 3^5 x 5^2 x 7^8, 2^3 x 5^3 x 7^2 x 13^3'. The instructor indicates that manual calculation is difficult for such large values, suggesting the use of a calculator or alternative methods. Visual cues include crossing out non-common factors and emphasizing the limitation that 'Method can only be used for small numbers and numbers whose prime factors can be found easily'.

The lecture systematically builds the concept of HCF from basic definitions to advanced application. It begins by defining factors as divisors that result in whole numbers, using 12 to illustrate the concept visually. The instructor then defines HCF as the greatest shared factor between numbers, demonstrating this through listing factors for 6 and 8. Two distinct methods are taught: inspection, which is limited to small numbers due to the manual listing required, and prime factorization, which involves decomposing numbers into primes. The video emphasizes that while inspection is intuitive for small integers like 12 and 18, prime factorization offers a structured approach but remains practical only for numbers with easily identifiable factors. The final segment warns against applying these manual methods to large composite numbers with high exponents, such as those involving 7^4 or 13^8, where calculation becomes unwieldy. This progression ensures students understand both the mechanics of finding HCF and the practical constraints of each method.

Loading lesson…