Part 1 - Short Tricks to check Divisibility by 7 & 13

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-a-aptitude/hcf-lcm/basic-concepts-factors-multiples-prime-composite-numbers/asset-part-1-short-tricks-to-check-divisibility-by-7-13 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Yash Jain from Knowledge Gate Eduventures, is a tutorial on divisibility rules for prime numbers, specifically focusing on 7 and 13. The video begins with an introduction to the concepts of LCM (Least Common Multiple) and HCF (Highest Common Factor), using a title card and a classroom-style animation. The main content then transitions to a problem-solving session where the instructor poses the question: "How many of the following numbers are divisible by 7?" The numbers listed are 533, 987, 2996, 532, and 6789. The instructor demonstrates a specific divisibility rule for 7: take the last digit, multiply it by 2, and subtract it from the remaining number. This process is repeated until a small number is obtained, which is then checked for divisibility by 7. The video provides a step-by-step walkthrough for each number, using on-screen calculations to show that 2996 and 532 are divisible by 7, while the others are not. The video concludes by introducing a different rule for divisibility by 13, which involves adding four times the last digit to the remaining number, and demonstrates this rule with the example of 50661. The final frame is a 'Thanks for Watching' message.

Chapters

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

    The video opens with a title card displaying "LCM & HCF" against a digital, data-stream background. It then transitions to a classroom setting with a cartoon teacher and a green chalkboard. The board clearly states "Highest Common Common Factor Factor (HCF)". The instructor, Yash Jain, is visible in a small window in the bottom right corner. The video is branded with the "KG" logo and the name "KNOWLEDGE GATE EDUCATION". This segment establishes the topic of the lecture, which is a foundational concept in mathematics.

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

    The video presents a new problem on a yellow background with a pattern of stars and shapes. The on-screen text asks, "Que: How many of the following numbers is divisible by 7 ?" followed by the list of numbers: 533, 987, 2996, 532, 6789. The instructor begins to analyze the first number, 533, by writing a calculation on the screen. He demonstrates the divisibility rule for 7: he takes the last digit (3), multiplies it by 2 (3 x 2 = 6), and subtracts it from the remaining number (53 - 6 = 47). He then checks if 47 is divisible by 7, concluding it is not. This process is repeated for the other numbers.

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

    The instructor continues to apply the divisibility rule for 7 to the remaining numbers. For 987, he calculates 98 - (7 x 2) = 98 - 14 = 84, and then 8 - (4 x 2) = 8 - 8 = 0, which is divisible by 7, so 987 is divisible by 7. For 2996, he calculates 299 - (6 x 2) = 299 - 12 = 287, then 28 - (7 x 2) = 28 - 14 = 14, which is divisible by 7, so 2996 is divisible by 7. For 532, he calculates 53 - (2 x 2) = 53 - 4 = 49, which is divisible by 7, so 532 is divisible by 7. For 6789, he calculates 678 - (9 x 2) = 678 - 18 = 660, then 66 - (0 x 2) = 66, which is not divisible by 7. The instructor concludes that three numbers (987, 2996, 532) are divisible by 7.

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

    The video transitions to a new topic: divisibility by 13. The on-screen text explains the rule: "Add four times the last digit to the remaining leading truncated number. If the result is divisible by 13, then so was the first number." An example is provided: 50661. The instructor demonstrates the rule: 5066 + (1 x 4) = 5070, then 507 + (0 x 4) = 507, then 50 + (7 x 4) = 50 + 28 = 78, and finally 78 is divisible by 13 (6 x 13 = 78). The video ends with a black screen displaying the text "THANKS FOR WATCHING" in an orange and white box.

The video provides a structured, step-by-step tutorial on applying divisibility rules for prime numbers. It begins by establishing the context of LCM and HCF, then focuses on a practical problem involving divisibility by 7. The instructor clearly explains and demonstrates a specific rule, using on-screen calculations to verify the divisibility of each number in the list. The lesson concludes by introducing a different rule for divisibility by 13, demonstrating its application with a clear example. The progression moves from a general topic to a specific problem, and then to a new, related concept, making it a comprehensive guide for students learning these mathematical shortcuts.

Loading lesson…