Divisibility Rules of 14 and 15

Duration: 5 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-14-and-15 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 structured lesson on divisibility rules for the numbers 14 and 15. The presentation begins with a colorful, hand-drawn diagram illustrating various divisibility rules, setting a visual context for the topic. The main content is delivered through a series of digital slides. The first slide explains the divisibility rule for 14, stating that a number is divisible by 14 if it is divisible by both 2 and 7. The instructor demonstrates this by checking if 224 is divisible by 2 and 7, using the standard divisibility tests for each. A second, more complex rule for 14 is then introduced: a number is divisible by 14 if the sum of its last two digits and twice the rest of the number is divisible by 14. This is demonstrated with the examples 364 and 1764. The video then transitions to the divisibility rule for 15, which states that a number is divisible by 15 if it is divisible by both 3 and 5. The instructor uses the number 390 as an example, showing that it is divisible by 5 (ends in 0) and by 3 (sum of digits is 12, which is divisible by 3). The video concludes with a 'Thanks for Watching' screen.

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. This transitions to a colorful, hand-drawn circular diagram titled 'DIVISIBILITY RULES' that visually organizes various divisibility rules for numbers 2 through 10. The instructor, Yash Jain Sir, appears in a small window in the bottom right corner. The first slide of the presentation is shown, titled 'Divisibility Rule of 14'. The on-screen text states that a number is divisible by 14 if it is divisible by 2 and by 7. An example, 224, is provided. The instructor begins to explain the rule, writing '14 = 2 x 7' on the screen to show the factorization.

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

    The instructor continues to explain the divisibility rule for 14. He demonstrates that 224 is divisible by 2 because it is an even number, and he shows the division 224 ÷ 2 = 112. He then checks if 224 is divisible by 7 by performing the division 224 ÷ 7, which results in 32. Since 224 is divisible by both 2 and 7, it is divisible by 14. The instructor then introduces a second rule for 14: 'Add the last two digits to twice the rest. The result must be divisible by 14.' He demonstrates this with the example 364: 3 (the rest) multiplied by 2 is 6, and adding the last two digits (64) gives 70. Since 70 is divisible by 14, 364 is divisible by 14. He repeats this with 1764: 17 (the rest) times 2 is 34, plus 64 gives 98, which is divisible by 14.

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

    The video transitions to a new slide titled 'Divisibility Rule of 15'. The on-screen text states that a number is divisible by 15 if it is divisible by 3 and by 5. An example, 390, is given. The instructor explains that 390 is divisible by 5 because it ends in 0. He then checks for divisibility by 3 by summing the digits: 3 + 9 + 0 = 12, and since 12 is divisible by 3, 390 is divisible by 3. Therefore, 390 is divisible by 15. The video concludes with a 'THANKS FOR WATCHING' screen.

The video presents a clear, step-by-step lesson on divisibility rules, using a combination of visual aids and direct instruction. It begins with a general overview of divisibility rules, then focuses on two specific composite numbers, 14 and 15. For each number, the instructor first explains the rule based on its prime factors (e.g., 14 = 2 x 7), providing a foundational understanding. He then introduces a more advanced, direct rule for 14, demonstrating its application with multiple examples. The lesson is structured logically, moving from simpler concepts to more complex ones, and uses clear, worked examples to reinforce the learning. The consistent use of on-screen text and handwritten calculations ensures that the key information is easily accessible to the viewer.

Loading lesson…