Short Trick for Reminders on Successive Divisions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/paper-1-unit-5-mathematical-reasoning-and-aptitude/number-system-bff2d7/concept-of-remainders/asset-short-trick-for-reminders-on-successive-divisions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Course Overview: About the Course
  2. Paper - 1 | Unit - 1 | Teaching Aptitude: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement
  3. Paper - 1 | Unit - 2 | Research Aptitude: Introduction to Research, Validity & Reliability, Research Paradigms & Types of Research, Research Process Steps, Research Ethics, Writing & Publication
  4. Paper - 1 | Unit - 3 | Comprehension: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
  5. Paper - 1 | Unit - 4 | Communication: Communication Basics, Language and Semiotics, Types of Communication, Communication Models, Mass Communication, Mass Media, Journalism, General Knowledge and General Studies related to Communication
  6. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Number System, Percentage, Ratio and Proportion (Ratios), Simple Interest and Compound Interest, Speed Time and Distance, Powers and Exponents (Surds and Indices), Profit and Loss, Average, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Verbal Analogy (Word Based Analogy), Divisibility Rules, Calendar, Miscellaneous, Time and Work, Algebra
  7. Paper - 1 | Unit - 6 | Logical Reasoning: Syllogisms, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Venn Diagram, School Of Thoughts, Fallacy, Western Logic
  8. Paper - 1 | Unit - 7 | Data Interpretation: Data Interpretation
  9. Paper - 1 | Unit - 8 | Information and Communication Technology: MS Office Applications, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Artificial Intelligence, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services
  10. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystem, Biomes & Environmental Issues, MDG & SDG, Air Pollution, Water Pollution, Soil, Noise Pollution and Waste Management, Natural Resources, Energy & Disaster Management, Global Environmental Conventions – COP, Protocols & ISA
  11. Paper - 1 | Unit - 10 | Higher Education System: Vedic Education, Jainism & Buddhism, Ancient Universities, Pre-Independence Commissions, Post-Independence Policy, Higher Education Structure & Accreditation, Universities & Learning Programmes, Types of Education & NEP 2020
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation and Combination, Probability, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization
  13. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  14. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals
  15. Paper 2 | Unit 4 | Database Management Systems: 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  16. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  17. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  18. Paper 2 | Unit 7 | Data Structures and Algorithms: 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
  19. Paper 2 | Unit 8 | Theory of Computation and Compilers: 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
  20. Paper 2 | Unit 9 | Data Communication and 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, Network Security, Mobile Technology, Cloud Computing and IoT, Cloud Computing
  21. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  22. Live Classes: NTA UGC NET 2025 Live Class
  23. Paper 1 | Full Mock Tests:
  24. Paper 2 | Full Mock Tests:
  25. Paper 1 | Previous Year Papers:
  26. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on number systems, specifically focusing on the concept of remainders in division. The instructor begins by introducing the topic with a title slide and a simple example of division with a remainder, using the equation 7 ÷ 2 = 3 R1, where the remainder is highlighted. The core of the video is a problem-solving session. The first problem states that a number, when divided by 3, 4, and 7, leaves remainders of 2, 1, and 4 respectively, and asks for the remainder when the same number is divided by 84. The instructor methodically breaks down the problem using the formula: Dividend = (Divisor × Quotient) + Remainder. He sets up a table with the divisors and their corresponding remainders, then uses a step-by-step substitution method to express the original number N in terms of a variable x. He first expresses N as 3(4(7x + 4) + 1) + 2, which simplifies to N = 84x + 53. This shows that the number is of the form 84x + 53, meaning when divided by 84, the remainder is 53. The second problem involves two numbers, P and Q, with similar conditions. For P, a number is divided by 4, 5, and 7, leaving remainders 1, 4, and 1 respectively. For Q, a number is divided by 5, 6, and 8, leaving remainders 2, 3, and 4 respectively. The question asks for a possible value of P + Q. The instructor applies the same method to find that P = 140a + 53 and Q = 120b + 53. He then evaluates the given options (267, 529, 1007, 1961) by subtracting 53 from each, checking if the result is divisible by 140 and 120. He finds that 529 - 53 = 476, which is not divisible by 140, but 1007 - 53 = 954, which is not divisible by 120. He then correctly identifies that 529 - 53 = 476 is divisible by 140, and 1007 - 53 = 954 is divisible by 120, but the correct answer is 529, which is 140*3 + 53. The video concludes with a thank you message.

Chapters

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

    The video opens with a title slide that reads "NUMBER SYSTEM" in a stylized font against a gray background. This transitions to a colorful title slide with the text "NUMBER SYSTEM" and the subtitle "The mysterious world of numbers...". The slide also features the text "by YASH [KG]" and "YASH JAIN". The instructor, a man with glasses, appears in a small window in the bottom right corner. The video then moves to a new slide titled "Concept of Remainders". This slide shows a diagram of two puppies and bones, illustrating the concept of division. The equation 7 ÷ 2 = 3 R1 is written on the screen, with an arrow pointing to the 'R1' and the word "Remainder" written below it. The instructor explains that the remainder is the part that is left over after division.

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

    The video presents a problem on a slide with a yellow background. The text reads: "Q: On dividing a number successively by 3, 4 and 7, the remainder are 2, 1 and 4 respectively. If the same number is divided by 84, the remainder is __". The instructor begins to solve this problem by writing the formula for division: "Dividend = (Divisor × Quotient) + Remainder". He then sets up a table with the divisors (3, 4, 7) and their corresponding remainders (2, 1, 4). He starts by expressing the number N as N = 3q1 + 2, where q1 is the quotient. He then expresses q1 as q1 = 4q2 + 1, and q2 as q2 = 7q3 + 4. He substitutes these into the original equation to get N = 3(4(7q3 + 4) + 1) + 2.

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

    The instructor continues to simplify the expression for N. He expands the equation N = 3(4(7q3 + 4) + 1) + 2 to get N = 3(28q3 + 16 + 1) + 2, which simplifies to N = 3(28q3 + 17) + 2. Further simplification gives N = 84q3 + 51 + 2, resulting in N = 84q3 + 53. He explains that this means the number N is of the form 84x + 53, so when N is divided by 84, the remainder is 53. The video then transitions to a new problem. The slide text reads: "Q: There are two finite control units, in the first FCU, A number is successively divided 3 times by 4, 5 & 7 respectively leaving remainders as 1, 4, 1 respectively. The remainder comes out to be some value P when the same number is divided by 84. In the second FCU, some another number Q is successively divided 3 times by 5, 6 & 8 respectively leaving remainders as 2, 3, 4 respectively. Out of the given options, what could be the possible value of P + Q." The options are a) 267, b) 529, c) 1007, d) 1961. The instructor begins to solve for P by setting up the equation N = 4(5(7x + 1) + 4) + 1, which simplifies to N = 140x + 53. He then solves for Q by setting up the equation N = 5(6(8y + 4) + 3) + 2, which simplifies to N = 240y + 122. He then checks the options by subtracting 53 from each and seeing if the result is divisible by 140 and 120. He finds that 529 - 53 = 476, which is divisible by 140, and 1007 - 53 = 954, which is divisible by 120. He concludes that the correct answer is 529.

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

    The video concludes with a black screen featuring a red neon-style rectangle with the text "THANK YOU FOR WATCHING". A white lightning bolt effect runs vertically through the rectangle. The instructor's voice is heard saying "Thank you for watching". The video ends with this thank you message.

The video provides a comprehensive tutorial on solving remainder problems using a systematic, step-by-step approach. It begins with a foundational concept of remainders, illustrated with a simple example, and then progresses to more complex problems involving successive division. The core method demonstrated is the use of the division formula (Dividend = Divisor × Quotient + Remainder) to express the unknown number in terms of a variable. By substituting the conditions of successive division, the number is expressed in a form that reveals its remainder when divided by a specific number, often the least common multiple of the divisors. The video effectively applies this method to two distinct problems, one with a single unknown and another with two unknowns (P and Q), and uses the given options to verify the solution. The key takeaway is the power of algebraic substitution to solve problems that would be difficult to solve by trial and error.

Loading lesson…