Short Trick for Reminders on Successive Divisions

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/mathematical-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. About the course: About the Course
  2. Mathematical Aptitude / गणितीय अभिक्षमता: Number System / संख्या पद्धति, HCF and LCM / महत्तम समापवर्तक और लघुत्तम समापवर्त्य, Divisibility Rules / विभाज्यता के नियम, Percentage / प्रतिशत, Ratio and Proportion / अनुपात और समानुपात, Average / औसत, Profit, Loss and Discount / लाभ, हानि और बट्टा, Time and Work / समय और कार्य, Solid Mensuration / घन क्षेत्रमिति, Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज, Time, Speed and Distance / समय, चाल और दूरी, Age Problems / आयु संबंधी प्रश्न, Mixture and Alligation / मिश्रण और एलिगेशन, Algebra / बीजगणित, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Pipe and Cistern / नल और टंकी, Trigonometry / त्रिकोणमिति, Statistics / सांख्यिकी, Data Interpretation / आँकड़ा निर्वचन, Arithmetic / अंकगणित, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Number Systems and Number Theory / संख्या पद्धति और संख्या सिद्धांत, Coordinate Geometry, Vectors and 3D Geometry / निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ
  3. Logical Reasoning / तार्किक तर्कशक्ति: Series / श्रेणी, Coding-Decoding / कूट लेखन एवं कूट वाचन, Analogy and Classification / सादृश्यता एवं वर्गीकरण, Blood Relations / रक्त संबंध, Direction and Distance / दिशा एवं दूरी, Order and Ranking / क्रम एवं रैंकिंग, Non-Verbal Reasoning / अशाब्दिक तर्क, Seating Arrangement and Puzzles / बैठक व्यवस्था एवं पहेलियाँ, Syllogisms / न्यायवाक्य, Venn Diagrams, Syllogism and Inequalities / वेन आरेख, न्याय वाक्य एवं असमानता, Mathematical Operations and Missing Numbers / गणितीय संक्रियाएँ एवं लुप्त संख्या, Alphabet and Number Test / वर्णमाला एवं संख्या परीक्षण, Statement-Based Reasoning / कथन आधारित तार्किक विवेचन, Analytical Reasoning (Counting Figures Reasoning) / विश्लेषणात्मक तर्क (आकृति गणना तर्क), Cubes, Dice and Figure Counting / घन, पासा एवं आकृतियों की गिनती, Calendar and Clock / कैलेंडर एवं घड़ी, Clock / घड़ी
  4. General Knowledge / सामान्य ज्ञान: Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान, Chemistry / रसायन विज्ञान, Biology / जीव विज्ञान, History / इतिहास, Geography / भूगोल, Polity / राजव्यवस्था, Indian Economy / भारतीय अर्थव्यवस्था, Current Affairs / समसामयिकी, Static General Knowledge / स्थैतिक सामान्य ज्ञान, State-Specific General Knowledge / राज्य विशेष सामान्य ज्ञान
  5. Art of Teaching / शिक्षण कला: Teaching-Learning Process and Classroom Management / शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन, Learners & Learning Process / अधिगमकर्ता और अधिगम प्रक्रिया, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Teaching Methods and Approaches / शिक्षण विधियाँ एवं उपागम, Microteaching and Classroom Communication / सूक्ष्म शिक्षण एवं कक्षा संप्रेषण, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी, Assessment and Evaluation / आकलन एवं मूल्यांकन, Teacher: Qualities, Professional Ethics and Development / शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास, Educational Policies, Acts and Administration / शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन, Curriculum, Arts and Co-curricular Areas / पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र, Guidance and Counselling / निर्देशन एवं परामर्श, Education of Children with Disabilities / दिव्यांग बच्चों की शिक्षा, Micro-Teaching & Teaching Skills / सूक्ष्म शिक्षण और शिक्षण कौशल, Lesson Planning / पाठ योजना
  6. Environmental Science / पर्यावरण विज्ञान: Environment / पर्यावरण
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
  26. Full Length Mock Test – General + Computer Science:
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…