Divisibility Rules of 19

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/divisibility-rules/divisibility-rules-for-all-numbers/asset-divisibility-rules-of-19 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
  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
  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 provides a comprehensive lesson on divisibility rules, specifically focusing on the rule for the number 19. The video begins with an introductory title card and a colorful, hand-drawn diagram illustrating various divisibility rules for numbers 2 through 10. The main content is a step-by-step demonstration of two different methods to test if a number is divisible by 19. The first method, shown from 02:00 to 05:00, involves adding two times the last digit to the remaining number and repeating the process until a result is obtained that is clearly divisible by 19. The instructor uses the example of 101156 to demonstrate this rule. The second method, shown from 05:00 to 06:23, involves adding four times the last two digits to the rest of the number, using the example of 6935. The video concludes with a 'Thanks for Watching' screen. The instructor, identified as Yash Jain Sir, is visible in a small window throughout the presentation.

Chapters

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

    The video opens with a title card displaying 'DIVISIBILITY RULES' over a background of scattered numbers. It then transitions to a colorful, hand-drawn diagram titled 'DIVISIBILITY RULES' which illustrates the rules for divisibility by numbers 2 through 10. The instructor, Yash Jain Sir, is visible in a small window in the bottom right corner. The video then cuts to a new slide titled 'Divisibility Rule of 19' which presents the first method: 'Add 4 times the last two digits to the rest.' An example is given: '6935: 69 + 35 × 4 = 209.' The instructor begins to explain this rule.

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

    The video focuses on the second divisibility rule for 19, which is displayed on the screen: 'Test for divisibility by 19. Add two times the last digit to the remaining leading truncated number. Apply this rule over and over again as necessary.' The instructor demonstrates this rule using the example number 101156. He shows the step-by-step process: 10115 + 2*6 = 10127, then 1012 + 2*7 = 1026, then 102 + 2*6 = 114, and finally 11 + 2*4 = 19. The final result, 19, is shown to be divisible by 19, thus proving that 101156 is also divisible by 19. The instructor writes out each step on the screen.

  3. 5:00 – 6:23 05:00-06:23

    The video returns to the first divisibility rule for 19, which is 'Add 4 times the last two digits to the rest.' The instructor demonstrates this rule with the example 6935. He calculates 35 × 4 = 140, then adds this to the remaining number: 69 + 140 = 209. The result, 209, is shown to be divisible by 19 (209 = 19 × 11), confirming that 6935 is divisible by 19. The instructor then begins to demonstrate the rule on a new number, 126935, by calculating 35 × 4 = 140 and adding it to 1269 to get 1409. The video ends with a 'THANKS FOR WATCHING' screen.

The video systematically teaches two distinct methods for testing divisibility by 19. The first method, demonstrated with the number 101156, involves a recursive process of adding twice the last digit to the remaining number. The second method, demonstrated with 6935, involves adding four times the last two digits to the rest of the number. The lesson progresses from an introduction to a detailed, step-by-step application of each rule, using clear examples and on-screen calculations to reinforce the concepts. The instructor's consistent presence in a small window provides a personal touch to the educational content.

Loading lesson…