Demo: Short Tricks to Find Number of Odd & Even Factors

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/number-system-bff2d7/factors-multiples-prime-factorization/asset-demo-short-tricks-to-find-number-of-odd-even-factors after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices, Number System, Powers, Surds and Logarithms, Mathematical Operations, Simplification and Approximation, Percentages, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Simple and Compound Interest, Transformation of Shapes, Signal Space and Optimum Detection, Alphabet and Word Tests, Syllogisms and Venn Diagrams, Analogy and Classification, Mensuration, Constraint Puzzles, Patterns in Two-Dimensional Figures, Three-Dimensional Patterns and Visualization, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Numerical Reasoning, Assembling and Grouping of Shapes, Coding and Decoding, Visual Recognition and Figure Completion, Paper Folding and Cutting, Cubes and Dice, Series Completion, Direction Sense, Logical Deduction and Induction, Seating and Arrangement Puzzles, Order, Ranking and Sequence, Clocks and Calendars, Critical Reasoning, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Counting Figures
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, 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, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  7. TOC & Compiler: 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, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video demonstrates a systematic approach to finding the number of odd and even factors for integers, culminating in solving probability problems involving perfect squares and cubes. The instructor begins by introducing a specific problem regarding the factors of 24000, asking for the probability that a randomly chosen factor is a perfect square. To build foundational understanding, he transitions to simpler examples like the number 12 and 24. He explicitly lists all factors for these smaller numbers to visualize the concept before introducing the more efficient method of prime factorization. The core technique involves decomposing a number into its prime power form, such as $N = 2^a imes 3^b$, and applying the divisor counting formula $(a+1)(b+1)$. The lecture distinguishes between total factors, odd factors (derived by ignoring the power of 2), and even factors. The final segment applies these principles to the main problem, calculating the prime factorization of 24000 as $2^6 imes 3^1 imes 5^3$ and determining the probability of selecting a perfect cube factor by analyzing exponent constraints.

Chapters

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

    The video opens with a probability problem displayed on screen asking for the likelihood that a factor chosen at random from 24000 is a perfect square. The slide presents four multiple-choice options: (a) 1/4, (b) 1/6, (c) 1/8, and (d) None of these. The instructor gestures while reading the problem statement, emphasizing the target number 24000 and the specific condition of finding a perfect square factor. This initial segment sets the context for applying number theory concepts to probability questions.

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

    To explain the underlying logic, the instructor transitions to a simpler example using the number 12. He explicitly lists the factors of 12 as {1, 2, 3, 4, 6, 12} to demonstrate how factors are identified. He then breaks down 12 into its prime factorization form, $N = (2^2 imes 3) / 2$, simplifying it to $2^1 imes 3^1$. The instructor derives the divisor counting rule by showing that for each prime base, one adds 1 to its exponent. He writes out the calculation $(1+1)(1+1) = 4$ to verify the count of factors, visually connecting prime powers like $2^0 imes 3^0 = 1$ to the actual factors.

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

    The lesson continues with the prime factorization of 12, written as $N = (2^2 imes 3^1) / 3$, and calculates the total factors using exponents. The instructor then introduces a new example, 24, breaking it down into $2^3 imes 3$. He demonstrates the division method to find factors, listing them as {1, 2, 3, 4, 6, 8, 12, 24}. A key transition occurs as he categorizes these factors into 'odd' and 'even' sets. He highlights that for 12, there are specific counts of odd factors (3) and even factors (4), summing to a total of 6. This section establishes the method for distinguishing between odd and even factors based on prime decomposition.

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

    The instructor formalizes the method for calculating odd and even factors using prime factorization. For the number 12 ($2^2 imes 3^1$), he applies the formula $(a+1)(b+1)$ to find total factors. He then analyzes 24 ($2^3 imes 3^1$) to categorize factors into odd, even, and total counts. The visual notes show a table structure with columns for 'odd', 'even', and 'total'. He emphasizes that odd factors are found by ignoring the power of 2 in the prime factorization, while even factors require at least one factor of 2. This systematic breakdown prepares the viewer to handle larger numbers like 24000.

  5. 15:00 – 18:01 15:00-18:01

    In the final segment, the instructor solves the initial probability problem regarding 24000. He performs prime factorization on 24000, resulting in $2^6 imes 3^1 imes 5^3$. He sets up the probability formula $P(E) = ext{favorable} / ext{total}$ and identifies the condition for a factor to be a perfect cube: exponents must be multiples of 3. By analyzing the possible combinations of prime powers that satisfy this condition, he calculates the number of favorable outcomes. The final derived answer is shown on screen as 1/7, contrasting with the initial multiple-choice options.

The lecture effectively bridges the gap between basic factor listing and advanced probability applications through a structured progression of examples. The pedagogical strategy relies on scaffolding: starting with the manual enumeration of factors for small integers like 12 and 24 to build intuition, then introducing the prime factorization formula $(a+1)(b+1)$ for efficiency. A critical conceptual distinction is made between total factors, odd factors (derived by excluding the prime base 2), and even factors. This distinction is essential for solving the final probability problem involving 24000, where the instructor must determine the count of perfect cube factors. The video demonstrates that for a factor to be a perfect cube, its prime exponents must be divisible by 3. By applying this constraint to the factorization $2^6 imes 3^1 imes 5^3$, the instructor calculates the favorable outcomes against the total possible factors. The final result of 1/7 indicates that the probability of selecting a perfect cube factor from 24000 is distinct from the initial options provided, highlighting the importance of rigorous calculation over estimation.

Loading lesson…