Demo: Divisibility Rules of 2, 3 and 4

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/general-intelligence-reasoning/divisibility-rules/divisibility-rules-for-all-numbers/asset-demo-divisibility-rules-of-2-3-and-4 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, Divisibility Rules, HCF LCM, Verbal Analogy (Word Based Analogy)
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  6. Programming & Data Structures: 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
  7. Databases: 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
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  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, Run Time Environment
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  12. 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, Hardware Basics
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a structured lesson on the divisibility rules for integers, specifically focusing on 1, 2, 3, and 4. The instructor begins by defining the scope of integers to exclude fractions before introducing the trivial rule that any integer is divisible by 1. The lesson progresses systematically to more complex rules, starting with divisibility by 2, which relies on the parity of the last digit. Subsequently, the rule for divisibility by 3 is explained using the sum of digits method, including a demonstration on how to repeat the process for large numbers. Finally, the video covers divisibility by 4 through two methods: checking the last two digits and a mental math shortcut involving halving the number twice. Throughout the lecture, visual aids such as checkmarks, crosses, and step-by-step calculations are used to reinforce the concepts.

Chapters

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

    The video opens with an introduction to the concept of divisibility, specifically establishing that any integer is divisible by 1. The instructor emphasizes a critical definition on the slide: 'Any integer (not a fraction) is divisible by 1,' underlining key terms to ensure students distinguish between whole numbers and fractions. To illustrate this, the instructor lists specific examples of integers such as 8, 10, 729, and 499. Visual cues include checkmarks next to valid integers and crosses or exclusions for fractions, setting a foundational understanding of the number types applicable to these rules.

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

    The lesson transitions to the divisibility rule for 2, stating that a number is divisible by 2 if its last digit is even (0, 2, 4, 6, or 8). The instructor validates this rule using the examples '128 Yes' and '129 No,' clearly marking which numbers satisfy the condition based on their final digit. The segment also introduces a seven-digit number N represented as 'abcabc,' likely to set up future problems involving patterns. The teaching method involves underlining the rule and using visual checks to confirm whether specific numbers meet the criteria, reinforcing the concept of evenness.

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

    This section covers the divisibility rule for 3, explaining that a number is divisible by 3 if the sum of its digits is divisible by 3. The instructor demonstrates this with '381 (3+8+1=12, and 12÷3 = 4) Yes' and '217 (2+1+7=10, and 10÷3 = 3 1/3) No.' For larger numbers like '99996,' the rule is applied iteratively: summing digits to get 42, then summing again to get 6. The video then introduces the rule for 4, stating 'The last 2 digits are divisible by 4,' verified with examples like '1312 is (12÷4=3) Yes' and '7019 is not (19÷4=4 3/4) No.'

  4. 10:00 – 12:07 10:00-12:07

    The final segment reinforces the divisibility rule for 4 by introducing a 'quick check' method: halving the number twice to see if the result remains a whole number. The instructor demonstrates this with '12/2 = 6, 6/2 = 3' (Yes) and '30/2 = 15, 15/2 = 7.5' (No). The video concludes by applying these methods to a larger number, '1214,' and ends with a 'Thanks for watching' screen. The visual evidence includes handwritten calculations showing the division steps and explicit text confirming the rule that 'The last 2 digits are divisible by 4.'

The lecture follows a logical progression from simple to complex divisibility rules, ensuring students build confidence with each step. The instructor consistently uses visual verification methods like checkmarks and crosses to make abstract rules concrete. Key takeaways include the strict definition of integers for divisibility by 1, the reliance on the last digit for divisibility by 2 and 4, and the iterative summing of digits for divisibility by 3. The inclusion of a 'quick check' method for divisibility by 4 adds practical value, offering students an alternative mental math strategy. The use of specific numerical examples like 381 and 99996 ensures that students can apply the rules to both small and large numbers effectively.

Loading lesson…