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

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/arithmetical-numerical-ability/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 Course: About the Course
  2. Section A: General Awareness: Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, समसामयिकी / Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Analytical Reasoning (Counting Figures Reasoning), रक्त संबंध / Blood Relations, Syllogisms, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, दिशा एवं दूरी / Direction and Distance, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, आँकड़ा निर्वचन / Data Interpretation, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, Pipe and Cistern, घन क्षेत्रमिति / Solid Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Reading Comprehension, Parts of Speech, Sentence Construction, Prepositions and Conjunctions, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Structure and Common Errors, Modals, Transformation of Sentences, Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access 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, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, शिक्षण योजना और शिक्षण कौशल / Teaching Planning and Teaching Skills, Personality Development, शिक्षण विधियाँ / Teaching Methods, अधिगम और व्यवहारवादी सिद्धांत / Learning and Behavioural Theories, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, आकलन एवं मूल्यांकन / Assessment and Evaluation, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, प्रबंध के सिद्धांत एवं कार्य / Principles and Functions of Management, लेखांकन के आधार एवं लेन-देनों का अभिलेखन / Accounting Fundamentals and Recording of Transactions, Business Economics, ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन / Depreciation, Final Accounts and Computerised Accounting, Knowledge Management & New Economy
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…