Demo: Short Tricks to Find Number & Product of Factors
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- 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
- 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
- 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
- Engineering Mathematics: Calculus, Vectors
- 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 introduction to the Number System, specifically focusing on Multiples and Factors. The lesson begins by defining multiples as an infinite set of numbers generated by multiplying a base number, exemplified by the sequence 3 = {3, 6, 9, ... ∞}. The instructor contrasts this with factors, which are finite divisors of a number. Using the integer 12 as a primary case study, the lecture demonstrates how to list factors manually and visually decompose numbers using factor trees. A critical distinction is drawn between general factorization (pairs like 1x12, 2x6) and prime factorization (breaking numbers into prime components like 2^2 x 3). The core of the lesson involves deriving and applying a formula to calculate the total number of factors based on prime exponents. Finally, the video concludes with a summary of these formulas and recommends memorizing specific ranges for squares, cubes, and multiplication tables to facilitate faster problem-solving.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title slide for the 'Number System' chapter, establishing a progression from basic to advanced concepts. The instructor transitions immediately to the specific topic of 'Multiples and Factors.' On-screen text displays 'The mysterious world of numbers...' followed by the chapter title. The lesson formally introduces the concept of multiples, defining them as an infinite sequence. Evidence includes the visible text 'NUMBER SYSTEM' and 'MULTIPLES AND FACTORS,' alongside the instructor writing the set notation for multiples of 3 as '3 = { 3, 6, 9, 12, 15, 18, 21 ... ∞ }' to emphasize the infinite nature of this set.
2:00 – 5:00 02:00-05:00
The instructor shifts focus to factors, contrasting their finite nature with the infinite set of multiples. Using the number 12 as a demonstration, the instructor lists factors sequentially: '{ 1, 2, 3, 4, 6, ... }'. The lesson visualizes factors as pairs through a factor tree method and division checks. Visible evidence includes the instructor writing '12/1', '12/2', '12/3 = 4', and '12/6 = 2' to validate divisors. The screen displays the complete set of factors for 12 as 'N = 12 = {1, 2, 3, 4, 6, 12}', explicitly labeling the set as 'Limited' compared to multiples.
5:00 – 10:00 05:00-10:00
This segment distinguishes between general factorization and prime factorization. The instructor displays pairs like '1 x 12', '2 x 6', and '3 x 4' as general factorization. He then demonstrates prime factorization using a division method, resulting in the formula '12 = 2x2x3 = 2^2 x 3'. The core instructional goal is to teach the formula for counting factors: 'N = a^p x b^q x c^r' leading to the calculation '(p+1)(q+1)(r+1)...'. Applying this to 12, the instructor calculates '(2+1)(1+1) = 3x2=6' to confirm the manual count. The screen also shows '12 x 12 x 12 => (12)^3' in the context of product of factors.
10:00 – 11:06 10:00-11:06
The video concludes by summarizing the key formulas for finding the number of factors and introduces a strategy for calculating products. The instructor revisits the factor count logic, showing 'no. of factors = 6/2 = 3' in the context of pairs. The final slide lists recommended memorization ranges for quick calculation: '1-100: Squares', '1-30: cube', and '1-50: tables'. The session ends with a 'THANK YOU FOR WATCHING' slide, reinforcing the educational content covered regarding number properties and factorization techniques.
The lecture systematically builds understanding of number properties, starting with the fundamental definition of multiples as infinite sets and factors as finite divisors. The instructor uses the number 12 to bridge these concepts, first listing factors manually and then introducing prime factorization as a more efficient method for analysis. A pivotal moment in the lesson is the derivation of the formula (p+1)(q+1)... which allows students to calculate the total number of factors without listing them all. This theoretical framework is supported by visual aids like factor trees and division checks. The lesson concludes with practical advice on memorizing squares, cubes, and tables to enhance computational speed, linking theoretical factorization skills to practical exam preparation strategies.

