Concept of Reminders (Part 4)

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/MP-SET-COMPUTER-SCIENCE/paper-1-unit-5-mathematical-reasoning-and-aptitude/number-system-bff2d7/division-and-remainder-based-problems/asset-concept-of-reminders-part-4 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper - 1 | Unit - 1 | Teaching Aptitude: Concept and Objectives of Teaching / शिक्षण की अवधारणा एवं उद्देश्य, Levels of Teaching / शिक्षण के स्तर, Learner's Characteristics / शिक्षार्थी की विशेषताएँ, Learning: Nature and Theories / अधिगम: प्रकृति एवं सिद्धांत, Cognition, Memory and Metacognition / संज्ञान, स्मृति एवं अधिसंज्ञान, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Effective Teaching and the Teacher / प्रभावी शिक्षण एवं शिक्षक, Instructional Objectives and Lesson Planning / अनुदेशनात्मक उद्देश्य एवं पाठ नियोजन, Methods of Teaching / शिक्षण विधियाँ, Offline and Online Teaching Methods / ऑफ़लाइन एवं ऑनलाइन शिक्षण विधियाँ, Teaching Support System / शिक्षण सहायक प्रणाली, Evaluation Systems / मूल्यांकन प्रणाली
  2. Paper - 1 | Unit - 2 | Research Aptitude: Research: Meaning, Features and Scientific Method / अनुसंधान: अर्थ, लक्षण व वैज्ञानिक विधि, Research Paradigms and Approaches / अनुसंधान के प्रतिमान एवं उपागम, Types of Research / अनुसंधान के प्रकार, Variables and Measurement / चर एवं मापन, Methods of Research / अनुसंधान की विधियाँ, Steps of Research / अनुसंधान के चरण, Sampling / प्रतिचयन, Tools and Methods of Data Collection / आँकड़ा संग्रह के उपकरण एवं विधियाँ, Data Analysis and Statistics in Research / आँकड़ा विश्लेषण एवं शोध सांख्यिकी, Thesis and Article Writing / शोध-प्रबंध एवं लेख लेखन, Application of ICT in Research / अनुसंधान में ICT का अनुप्रयोग, Research Ethics / शोध नैतिकता
  3. Paper - 1 | Unit - 3 | Comprehension: Literal Comprehension, Vocabulary and Language in Context, Inferential Comprehension, Critical Comprehension, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
  4. Paper - 1 | Unit - 4 | Communication: Communication: Meaning, Nature and Process / संचार: अर्थ, प्रकृति एवं प्रक्रिया, Types and Levels of Communication / संचार के प्रकार एवं स्तर, Verbal and Non-verbal Communication / मौखिक एवं अमौखिक संचार, Semiotics and Meaning / संकेत विज्ञान एवं अर्थ, Models and Theories of Communication / संचार के मॉडल एवं सिद्धांत, Effective Communication / प्रभावी संचार, Barriers to Communication / संचार की बाधाएँ, Classroom Communication / कक्षा संचार, Mass Media: Types and Evolution / जनसंचार माध्यम: प्रकार एवं विकास, Mass Media and Society / जनसंचार एवं समाज, Digital and New Media / डिजिटल एवं नव माध्यम, General Awareness (Legacy Paper 1) / सामान्य जागरूकता (पुराना पेपर 1)
  5. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Number System and Simplification / संख्या पद्धति एवं सरलीकरण, Algebra and Ages / बीजगणित एवं आयु, Percentage / प्रतिशतता, Ratio, Proportion, Partnership and Mixtures / अनुपात, समानुपात, साझेदारी एवं मिश्रण, Averages / औसत, Profit, Loss and Discount / लाभ, हानि एवं बट्टा, Simple and Compound Interest / साधारण एवं चक्रवृद्धि ब्याज, Time and Work / समय एवं कार्य, Speed, Time and Distance / चाल, समय एवं दूरी, Mensuration and Geometry / क्षेत्रमिति एवं ज्यामिति, Series / श्रेणी, Coding-Decoding / कूटलेखन-कूटवाचन, Relationships, Directions and Ranking / संबंध, दिशा एवं क्रम, Arrangements, Puzzles, Clock and Calendar / व्यवस्था, पहेलियाँ, घड़ी एवं कैलेंडर, Mathematical Foundations, Analysis
  6. Paper - 1 | Unit - 6 | Logical Reasoning: Structure of Arguments / युक्ति की संरचना, Terms, Definitions and Uses of Language / पद, परिभाषा एवं भाषा के उपयोग, Categorical Propositions / निरुपाधिक प्रतिज्ञप्तियाँ, Categorical Syllogism / निरुपाधिक न्यायवाक्य, Venn Diagrams / वेन आरेख, Deduction, Induction and Analogy / निगमन, आगमन एवं सादृश्यता, Fallacies / तर्कदोष, Indian Logic: Pramanas / भारतीय तर्कशास्त्र: प्रमाण, Anumana and Vyapti / अनुमान एवं व्याप्ति, Hetvabhasa / हेत्वाभास, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Aristotle / अरस्तू, Western Schools of Philosophy / पाश्चात्य दर्शन की विचारधाराएँ, Kant / कांट, Sadhana Paada / साधनपाद, Vaiśeṣika / वैशेषिक
  7. Paper - 1 | Unit - 7 | Data Interpretation: Data and Graphical Representation / आँकड़े एवं आलेखीय निरूपण, Data Interpretation: Tables / आँकड़ा निर्वचन: तालिका
  8. Paper - 1 | Unit - 8 | Information and Communication Technology: Computer Fundamentals and Hardware, Memory, Storage and Data Representation, Computer Software, Office Applications, Multimedia and File Formats, Computer Networks, Internet and World Wide Web, Email and Online Communication, Cyber Security, Digital Ethics, IPR and Society, Cloud and Distributed Computing, Emerging Technologies, ICT in Education and Governance, 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, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services, Protection of Geographical Indications / भौगोलिक संकेतों का संरक्षण
  9. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystems and Biodiversity / पारितंत्र और जैव विविधता, Human and Environment Interaction / मानव और पर्यावरण की अंतःक्रिया, Development and Environment / विकास और पर्यावरण, Natural Resources – Forests, Water and Soil / प्राकृतिक संसाधन: वन, जल और मृदा, Energy Resources / ऊर्जा संसाधन, Air Pollution / वायु प्रदूषण, Water Pollution and Treatment / जल प्रदूषण और उपचार, Noise Pollution / ध्वनि प्रदूषण, Waste Management / अपशिष्ट प्रबंधन, Environmental Health and Toxicology / पर्यावरणीय स्वास्थ्य और विषविज्ञान, Climate Change and Global Environmental Issues / जलवायु परिवर्तन और वैश्विक पर्यावरणीय समस्याएँ, Natural Hazards and Disaster Management / प्राकृतिक प्रकोप और आपदा प्रबंधन, Indian Environmental Laws and Policies / भारतीय पर्यावरण कानून और नीतियाँ, International Environmental Agreements / अंतर्राष्ट्रीय पर्यावरण समझौते, Environment / पर्यावरण, Geography / भूगोल, Factory and Industry Systems / कारखाना और उद्योग व्यवस्थाएँ, Earth Materials, Surface Features and Processes, Communicable Diseases and Immunization / संक्रामक रोग और प्रतिरक्षण
  10. Paper - 1 | Unit - 10 | Higher Education System: Education in Ancient India / प्राचीन भारत में शिक्षा, Ancient Centres of Higher Learning / प्राचीन भारत के उच्च शिक्षा केंद्र, Colonial Education Policies and Commissions / औपनिवेशिक काल की शिक्षा नीतियाँ और आयोग, Colonial Colleges, Universities and Reformers / औपनिवेशिक कॉलेज, विश्वविद्यालय व सुधारक, Education Commissions and Policies after Independence / स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ, National Education Policy 2020 / राष्ट्रीय शिक्षा नीति 2020, Types of Higher Education Institutions / उच्च शिक्षा संस्थानों के प्रकार, Learning Programmes and Academic Credits / अधिगम कार्यक्रम और अकादमिक क्रेडिट, Professional, Technical and Skill-Based Education / व्यावसायिक, तकनीकी और कौशल आधारित शिक्षा, Value Education and Environmental Education / मूल्य शिक्षा और पर्यावरण शिक्षा, Governance, Administration and Financing / शासन, प्रशासन और वित्तपोषण, Regulation, Accreditation and Ranking / उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग, Indian Polity and Governance (Legacy Unit 10) / भारतीय राजव्यवस्था और शासन (पुराना यूनिट 10)
  11. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization, Markov Chains
  12. 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
  13. 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, Array, String, IO & References, OOPS with Java
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. 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, Cloud Computing, Mobile Computing
  20. 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
  21. Full Notes: Paper 1 Full Notes
  22. Paper 1 | Full Mock Tests:
  23. Paper 2 | Full Mock Tests:
  24. Paper 1 | Previous Year Papers:
  25. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Yash Jain from Knowledge Gate, is a comprehensive tutorial on solving remainder problems in number systems, a common topic in competitive exams. The video begins with an introduction to the concept of remainders, using a simple division example (7 ÷ 2 = 3 R1) to establish the foundational idea. The main content consists of two complex problems. The first problem involves the sum of the reciprocals of the first 13 natural numbers, expressed as a fraction x/13!. The instructor demonstrates that to find the remainder when x is divided by 11, one must analyze the numerator of the sum after a common denominator is applied. The key insight is that for any term where the denominator is not divisible by 11, the corresponding numerator term will be divisible by 11, leaving only the term where the denominator is 11 as the only non-zero contributor to the remainder. The second problem asks for the remainder when N = (1! + 2! + 3! + ... + 1000!)^40 is divided by 10. The instructor explains that for n ≥ 5, n! is divisible by 10, so all terms from 5! onwards are 0 modulo 10. This simplifies the sum to (1! + 2! + 3! + 4!)^40 = (1 + 2 + 6 + 24)^40 = 33^40. The final step is to find the remainder of 33^40 when divided by 10, which is equivalent to finding the last digit of 33^40. The video concludes with a summary of the problem-solving techniques, emphasizing the use of modular arithmetic and the simplification of large expressions by identifying terms that become zero under the given modulus.

Chapters

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

    The video opens with a title card for 'NUMBER SYSTEM' and then transitions to a presentation slide. The slide features the title 'NUMBER SYSTEM' and the tagline 'The mysterious world of numbers...'. The instructor, Yash Jain, is visible in a small window. He introduces the topic of the 'Concept of Remainders' and provides a simple example on the board: '7 ÷ 2 = 3 R1', with an arrow pointing to the '1' and labeling it 'Remainder'. This establishes the basic definition of a remainder as the leftover part of a division.

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

    The video presents the first problem: 'The expression sigma(1/n) from n=1 to 13 can also be written as x/13!. What would be the remainder if x is divided by 11?'. The instructor begins to solve this by writing the sum as 1/1 + 1/2 + 1/3 + ... + 1/13. He then multiplies the entire sum by 13! to get x, which results in the expression x = 13!/1 + 13!/2 + 13!/3 + ... + 13!/13. He explains that to find x mod 11, he needs to evaluate each term in the sum modulo 11.

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

    The instructor analyzes the terms of the sum x = 13!/1 + 13!/2 + ... + 13!/13 modulo 11. He explains that 13! is divisible by 11, so 13! ≡ 0 (mod 11). For any term where the denominator is not 11, the numerator 13! is divisible by 11, making the entire term 0 modulo 11. The only term that is not divisible by 11 is the one where the denominator is 11, which is 13!/11. He simplifies this term to 13 × 12 × 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 13 × 12 × 10!. He then states that the remainder is the value of 13 × 12 × 10! modulo 11, which he will calculate in the next step.

  4. 10:00 – 15:00 10:00-15:00

    The instructor calculates the remainder of 13 × 12 × 10! when divided by 11. He uses the property that (p-1)! ≡ -1 (mod p) for a prime p (Wilson's Theorem). Since 11 is prime, 10! ≡ -1 (mod 11). He then simplifies 13 × 12 modulo 11: 13 ≡ 2 (mod 11) and 12 ≡ 1 (mod 11). Therefore, the expression becomes 2 × 1 × (-1) = -2. Since the remainder must be positive, he adds 11 to get 9. The final answer for the first problem is 9. He then transitions to the second problem.

  5. 15:00 – 18:29 15:00-18:29

    The second problem is introduced: 'What is the remainder when N = (1! + 2! + 3! + ... + 1000!)^40 is divided by 10?'. The instructor explains that for n ≥ 5, n! is divisible by 10 (since it contains both 2 and 5 as factors), so n! ≡ 0 (mod 10). This means all terms from 5! to 1000! are 0 modulo 10. The sum simplifies to (1! + 2! + 3! + 4!)^40 = (1 + 2 + 6 + 24)^40 = 33^40. The problem now is to find 33^40 mod 10, which is the last digit of 33^40. He notes that the last digit of 33 is 3, so he needs to find the last digit of 3^40. He then calculates the pattern of the last digit of powers of 3: 3^1=3, 3^2=9, 3^3=7, 3^4=1, and the cycle repeats every 4. Since 40 is divisible by 4, the last digit is 1. The final answer is 1. The video ends with a 'Thank You for Watching' screen.

The video provides a clear and structured lesson on applying modular arithmetic to solve complex remainder problems. It begins with a fundamental concept and progresses to two distinct, challenging problems. The first problem demonstrates the power of simplification by identifying that only one term in a large sum contributes to the remainder when the modulus is a prime number, leveraging Wilson's Theorem. The second problem illustrates the technique of reducing a sum by recognizing that terms beyond a certain point become zero modulo the divisor. The core teaching method is the step-by-step breakdown of complex expressions into manageable parts, using properties of factorials and modular arithmetic to arrive at the solution. The progression from a simple example to two advanced problems effectively builds the viewer's problem-solving skills for competitive exams.

Loading lesson…