Quick Revision & Practice Problem
Duration: 1 hr 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
- Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper 2 | 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
- Paper 2 | 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
- Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
- Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Paper 2 | Computer Networks: 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
- Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
- Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
- Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Venn Diagram, Analogy
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture provides a structured revision of divisibility rules, progressing from basic single-digit tests to composite numbers and larger primes, before applying these concepts to quantitative aptitude practice problems. The session begins by defining divisibility and introducing rules for 2, 3, 4, and 5. The instructor uses a whiteboard to demonstrate factor sets for the number 12, showing how multiples of 12 are formed by dividing 24 by its factors. The lesson then covers the rule for 6 (passing both 2 and 3 tests) and a place-value breakdown method for dividing 672 by 7. Further rules are introduced for 9, 10, and the alternating sum rule for 11. The instructor transitions to composite rules for 12 (passing both 3 and 4) and introduces specialized tests for primes like 13, 16, and 17. A memorization table is presented for primes from 11 to 43, using specific factors (e.g., -5 for 17, +2 for 19) to simplify calculations. The final segment focuses on practice problems, including finding missing digits 'K' in numbers divisible by 11 and determining the maximum number of 4-digit permutations from a given set that are divisible by 9.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with a slide titled "Divisibility Rules," defining the concept as testing if one number can be exactly divided by another. Examples include "14 is divisible by 7" and "0 is divisible by 7." The instructor then works through the rule for 3 using the example "Is 723 divisible by 3?" showing that 7+2+3=12, which is divisible by 3. The rule for 2 is also introduced, noting that the last digit must be even (0, 2, 4, 6, 8), with examples like 128 (Yes) and 129 (No).
2:00 – 5:00 02:00-05:00
The instructor continues with the rule for 3, using examples like 381 (sum is 12) and 217 (sum is 10). The rule for 4 is introduced, stating that the last two digits must be divisible by 4. Examples include 1312 (Yes) and 7019 (No). A quick check for small numbers is provided: halving the number twice. The lesson transitions to rule 5, where the last digit must be 0 or 5. On the whiteboard, the instructor writes the fraction 24/12 and lists the factors of 12 as {1, 2, 3, 4, 6, 12}.
5:00 – 10:00 05:00-10:00
The whiteboard shows a circled "24" and the set of factors for 12, with fractions like 24/1 through 24/12 each followed by a check mark. A slide for rule 6 states that a number must be even and divisible by 3. Examples include 14 (Yes) and 808 (No). The instructor then demonstrates a place-value breakdown for dividing 672 by 7, showing intermediate steps like subtracting 4 from 67 to get a remainder of 63, and eventually reaching a final remainder of 0.
10:00 – 15:00 10:00-15:00
The video covers rules for 9, 10, and 11. For 9, the sum of digits must be divisible by 9 (e.g., 1629). For 10, the number must end in 0 (e.g., 220). For 11, the instructor explains the alternating sum rule: adding and subtracting digits in an alternating pattern. A detailed example for 1364 is shown, where +1-3+6-4 = 0, confirming divisibility. The instructor also works through the example of 987, where +9-8+7 = 8 (No).
15:00 – 20:00 15:00-20:00
The instructor reviews the rule for 11 with examples like 286 and 14641, where +1-4+6-4+1 = 0. A long division of 1464 by 11 is performed to verify the result. The lesson then transitions to composite numbers, explaining that a number is divisible by 12 if it passes both the 3 and 4 rules. Examples include 648 (Yes) and 524 (No). The rule for 13 is introduced: adding four times the last digit to the remaining truncated number, using 50661 as an example.
20:00 – 25:00 20:00-25:00
The rule for 16 is presented, stating that the last four digits must be divisible by 16. An example given is 157,648, where 7,648 = 478 × 16. An alternative method for 16 is shown: adding the last two digits to four times the rest. The rule for 17 follows, which involves subtracting five times the last digit from the remaining leading truncated number. An example is 3978, which becomes 397 - (5*8) = 357.
25:00 – 30:00 25:00-30:00
The instructor continues with the rule for 16, noting that if the thousands digit is even, the last three digits must be divisible by 16 (e.g., 254,176). The rule for 17 is demonstrated again with the example 221, where 22 - (1*5) = 17. The instructor uses underlining and circling on the board to highlight key terms and specific digits in these calculations, emphasizing the iterative nature of these tests for larger primes.
30:00 – 35:00 30:00-35:00
A table is displayed listing divisibility factors for primes from 11 to 43. The instructor writes numbers like 145, 273, and 311 on the whiteboard with associated keywords like 'Recharge' and 'Lipstick' to aid memorization. The table shows specific factors such as -1 for 11, +4 for 13, and -5 for 17. The instructor explains how to group these numbers based on their positive or negative factors to simplify the application of the rules.
35:00 – 40:00 35:00-40:00
The instructor points to the table of factors for primes 11-43, explaining how to use them. A slide details the test for divisibility by 41: subtract four times the last digit from the remaining number. A step-by-step calculation for 30873 is shown: 307 - (4*3) = 295, then 29 - (4*5) = 9, and finally reaching a remainder of zero. This demonstrates the iterative process until a recognizable number or zero is reached.
40:00 – 45:00 40:00-45:00
The video shows a quick revision of rules for 7 and 11. A practice problem is introduced: "2ab5 is a four-digit number divisible by 25." The instructor identifies that for divisibility by 25, the last two digits must be 00, 25, 50, or 75. The problem states that the digits 'ab' form a multiple of 13. Options A (65), B (75), C (52), and D (25) are evaluated. The instructor identifies 52 as the correct answer because it is a multiple of 13 and fits the constraints.
45:00 – 50:00 45:00-50:00
A new problem is introduced asking for the smallest whole number 'K' to make 97215k6 divisible by 11. The instructor sets up the alternating sum equation: +9 -7 +2 -1 +5 -k = 0/11n. Solving this equation leads to K=3, which matches option B on the screen. The instructor emphasizes using the alternating sum rule to find missing digits in quantitative aptitude problems.
50:00 – 55:00 50:00-55:00
The instructor solves another problem for a missing digit 'K' in the number K35624, which is divisible by 11. The equation +K -3 +5 -6 +2 -4 = 0/11n is set up and simplified to K-6=0. The instructor concludes that K=6 is the valid single-digit solution, explicitly rejecting K=17 because it does not fit the constraint of being a single digit. This reinforces the importance of checking solution validity.
55:00 – 60:00 55:00-60:00
A series of quantitative aptitude problems is presented. The first asks for the maximum number of 4-digit numbers formed by digits 6, 4, 8, and 1 that are divisible by 9. The instructor calculates the sum of these digits as 19 (6+4+8+1=19), which is not divisible by 9, leading to an answer of 0. A subsequent problem asks for the largest 5-digit number exactly divisible by 93, with option B (99,624) being pointed out.
60:00 – 61:31 60:00-61:31
The lecture concludes with a final review of the practice problems. The instructor reiterates that for any number formed from a fixed set of digits, the sum of those digits must be divisible by 9 for any permutation to be valid. The session ends with a summary of the key divisibility rules covered, from basic single-digit tests to the specialized factors for primes up to 43.
The lecture follows a logical progression from foundational divisibility rules to complex applications. It starts with the basics (2, 3, 4, 5) and moves to composite rules (6, 12), where a number must satisfy multiple conditions. The instructor then introduces the alternating sum rule for 11 and specialized truncation rules for larger primes (13, 16, 17). A key pedagogical tool is the use of a factor table for primes up to 43, which allows students to apply a consistent 'add or subtract factor times last digit' method. The final portion of the video applies these rules to solve for missing digits in numbers, a common format in quantitative aptitude exams. The instructor emphasizes the importance of checking if solutions are valid single digits and using digit sums to quickly eliminate impossible permutations.