Demo: Tricky Important Questions on Finding Product of Factors

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/number-system-bff2d7/factors-multiples-prime-factorization/asset-demo-tricky-important-questions-on-finding-product-of-factors after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): 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, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive tutorial on number theory concepts, specifically focusing on finding the product of factors and divisors for any given integer. The lesson begins by defining fundamental terms such as factors, divisors, and prime factorization, establishing the notation N = p^a * q^b * r^c. The instructor systematically presents key formulas, including the method for calculating the total number of factors as (a+1)(b+1)(c+1) and the specific formula for the product of all factors, which is N^(n/2), where n represents the total count of factors. The video transitions from theoretical definitions to practical application, demonstrating how to solve complex problems involving large numbers like 7056 and smaller integers like 12 and 72. Through step-by-step breakdowns, the instructor illustrates how to identify perfect squares, perform prime factorization, and manipulate exponents to express products in specific forms like (8P)^(4Q) or 2^a * 3^b. The content is structured to guide students from basic definitions through intermediate problem-solving techniques to advanced algebraic manipulations required for competitive exam questions.

Chapters

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

    The video opens with a clear definition of factors and divisors, explaining that these are numbers which divide a given number N completely without remainder. The instructor introduces the standard prime factorization notation N = p^a * q^b * r^c and lists essential formulas on the slide. Key visible text includes 'Number of Factors/Divisors' and the formula for counting factors: (a+1)(b+1)(c+1). The instructor also highlights the formula for the product of factors as N^(No. of factors/2). This section establishes the theoretical foundation required for solving subsequent numerical problems, emphasizing the distinction between unique prime factors and total factors.

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

    The instructor applies the previously defined formulas to concrete examples, starting with the number 12. The slide displays 'Factors of a number N refers to all the numbers which divide N completely' alongside the list {1, 2, 3, 4, 6, 12}. The lesson then transitions to more complex problems, introducing a question about the product of factors for 7056 represented as (8P)^(4Q). Another problem asks for the sum of exponents when divisors of 72 are multiplied. The instructor begins analyzing 7056, identifying it as a perfect square (84^2) and starting the prime factorization process by breaking 84 into its components, specifically noting '2x42' on the screen.

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

    The core of the lesson involves solving the problem for 7056. The instructor demonstrates that 7056 = (84)^2 and factors 84 into 2^2 * 3 * 7, leading to the prime factorization (2^2 * 3 * 7)^2. Using the formula for the number of factors, (4+1)(2+1)(2+1), the total count is calculated as 45. The product of factors formula N^(n/2) is then applied, resulting in (7056)^(45/2), which simplifies to ((84)^2)^(45/2) or (84)^45. The instructor matches this result to the form (8P)^(4Q). Subsequently, a second problem regarding 72 is solved by finding its prime factorization as 2^3 * 3^2, calculating the total factors as (3+1)(2+1) = 12, and applying the product formula to get 72^6.

  4. 10:00 – 10:09 10:00-10:09

    The video concludes with the final steps of solving the problem for 72. The instructor expands the expression (72)^(12/2) into prime bases to find the exponents 'a' and 'b'. The screen shows the calculation leading to a = 18 and b = 12. The final answer is derived by summing these exponents, a + b. This section reinforces the method of expressing products of divisors in the form 2^a * 3^b and calculating the sum of exponents, providing a complete example of the techniques taught throughout the lecture.

The video effectively bridges theoretical number theory concepts with practical problem-solving strategies. The progression from defining factors to applying the product formula N^(n/2) is logical and well-supported by visual aids. The use of 7056 as a perfect square example demonstrates the importance of recognizing number properties to simplify calculations. Similarly, the 72 problem reinforces the method for handling non-perfect squares and expressing results in prime base forms. The consistent use of on-screen text for formulas like (a+1)(b+1)(c+1) ensures clarity. Students should note that the product of factors formula relies heavily on accurate prime factorization and correct exponent counting. The final examples show how to manipulate these results into specific algebraic forms required by exam questions.

Loading lesson…