Demo: Short Tricks to Quickly Solve Problems of Sequence Series

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/sequence-and-series-series/arithmetic-progression-ap/asset-demo-short-tricks-to-quickly-solve-problems-of-sequence-series after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, 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, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed tutorial on solving problems related to Sequence and Series, specifically focusing on finding the number of common terms between two Arithmetic Progressions (APs). The instructor, Yash Jain Sir, begins by introducing the fundamental concept of sequences and series, displaying the general summation formula Sn = a1 + a2 + ... + an. The core of the lesson involves a systematic method to identify common terms by first locating the initial common term and then determining the interval between subsequent common terms using the Least Common Multiple (LCM) of the differences of the two original sequences. The video demonstrates this technique through multiple examples, starting with simpler APs to build intuition before applying the method to more complex numerical problems. A key derivation presented is for calculating the number of terms n in an AP, rearranging the standard formula an = a + (n-1)d to solve for n as n = (l - a)/d + 1. This derived formula is then applied to the sequence of common terms to determine the total count, illustrating a practical shortcut for competitive exam preparation.

Chapters

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

    The video opens with an introduction to the topic of Sequence and Series, explicitly displaying the text 'SEQUENCE & SERIES' on screen. The instructor defines the general formula for the sum of a series as Sn = a1 + a2 + ... + an. The lesson immediately transitions to a specific problem statement: 'Q: FIND THE NUMBER OF COMMON TERMS'. Two arithmetic sequences are presented for comparison: Sequence A (17, 21, 25, 29...417) and Sequence B (16, 21, 26, 31...466). The instructor identifies the first common term as 21. Visual cues include a cartoon character reacting to math problems and text indicating the difficulty level as 'Basic To Advance'. The instructor begins explaining that finding common terms requires identifying a pattern, specifically looking at the differences between consecutive terms in each sequence to establish an interval for common values.

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

    The instructor demonstrates the method for finding subsequent common terms by calculating the Least Common Multiple (LCM) of the differences of the two sequences. For Sequence A, the difference is 4 (21-17), and for Sequence B, the difference is 5 (21-16). The LCM of 4 and 5 is calculated as 20. This value represents the interval between common terms. The instructor lists the sequence of common terms starting from 21: 21, 41 (21+20), 61 (41+20), and so on. A simpler example is introduced to clarify the concept, using APs with differences d=2 (2, 4, 6...) and d=3 (3, 6, 9...). The instructor visually circles common terms like 6, 12, and 18 in these sequences. This segment emphasizes the visual identification of common terms and the step-by-step breakdown using a simpler example to ensure understanding before moving to complex calculations.

  3. 5:00 – 9:37 05:00-09:37

    The video focuses on deriving and applying the formula to count the number of terms in the sequence of common terms. The instructor writes the standard nth term formula an = a + (n-1)d and algebraically rearranges it to isolate n, resulting in the formula n = (l - a)/d + 1. This derivation is shown step-by-step on the screen. The instructor then applies this formula to a specific problem involving the LCM of 2 and 3, calculating n = (18 - 6)/6 + 1. Returning to the main problem, the instructor identifies the first common term (a=21) and uses the LCM of differences (d=20) for the new sequence. The calculation begins with substituting values into the formula: n = (417 - 21) / 20. The instructor explains how to determine the last term of the common sequence that does not exceed the original limits (417 and 466) to accurately compute n. The segment concludes with the application of this derived formula to find the total count of common terms.

The instructional content follows a logical progression from definition to application. It begins by establishing the problem context: finding common terms between two Arithmetic Progressions (APs). The instructor first identifies the initial common term, which serves as the starting point for a new AP formed by these common terms. The critical insight provided is that the difference of this new sequence is the Least Common Multiple (LCM) of the differences of the original two sequences. For instance, with differences 4 and 5, the LCM is 20, creating a new sequence with a common difference of 20. To find the total count of these terms, the video derives the formula n = (l - a)/d + 1 from the standard nth term equation. This derivation is crucial for students to understand how to isolate n algebraically. The application involves determining the largest term in the common sequence that fits within the bounds of both original sequences. By substituting the first common term, the LCM-derived difference, and the maximum possible last term into the formula, students can efficiently calculate the number of common terms without listing them all. This method is presented as a shortcut for solving complex sequence problems quickly.

Loading lesson…