Tricks to Calculate Number of Triangles in Any Figure

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/speed-mathematics-and-basic-mathematics/speed-maths/asset-tricks-to-calculate-number-of-triangles-in-any-figure 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 video is a tutorial on solving a common aptitude test problem: counting the number of triangles in a given figure. The instructor, Yash Jain Sir, begins by presenting a sequence of four diagrams, each showing a large triangle subdivided into smaller triangles by horizontal lines. He explains that the number of triangles in each figure follows a pattern based on the number of horizontal divisions. For the first figure with one horizontal line, he counts the triangles as 1 (small) + 2 (medium) = 3. For the second with two horizontal lines, he counts 1 + 2 + 3 = 6. He then generalizes this pattern, stating that for a figure with 'n' horizontal lines, the total number of triangles is the sum of the first 'n+1' natural numbers, which is given by the formula n(n+1)/2. He demonstrates this with a final example of a triangle divided into 4 horizontal levels, where the total is 1+2+3+4 = 10. The video uses on-screen diagrams and handwritten annotations to illustrate the counting process and the mathematical formula.

Chapters

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

    The video opens with a title card reading "SPEED MATHS". It then transitions to a screen with a daily quiz announcement and a sequence of four diagrams. The diagrams show a large triangle divided into smaller triangles by horizontal lines. The first has one horizontal line, the second has two, the third has three, and the fourth has four. The instructor, Yash Jain Sir, appears in a small window and begins to explain the problem, which is to count the number of triangles in each figure. He states that the quiz is about questions asked in IT companies and encourages viewers to follow their Instagram.

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

    The instructor begins to solve the first problem. He focuses on the first diagram, which has one horizontal line dividing the large triangle. He counts the small triangles at the top (1) and the larger triangles formed by combining the top and bottom sections (2), arriving at a total of 3. He then moves to the second diagram, which has two horizontal lines. He counts the triangles: 1 small one at the top, 2 medium ones in the middle, and 3 large ones at the bottom, summing to 6. He writes the equation 1+2+3=6 on the screen. He then explains that the pattern is the sum of the first 'n' natural numbers, where 'n' is the number of horizontal lines plus one.

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

    The instructor generalizes the pattern. He explains that for a figure with 'n' horizontal lines, the total number of triangles is the sum of the first (n+1) natural numbers. He writes the formula n(n+1)/2 on the screen. He then applies this to the third diagram, which has three horizontal lines. He counts the triangles as 1+2+3+4=10. He then moves to the fourth diagram, which has four horizontal lines, and states that the total number of triangles is 1+2+3+4+5=15. He uses red lines to highlight the different levels of triangles in the diagrams to aid the counting process.

  4. 10:00 – 10:32 10:00-10:32

    The video concludes with a final summary of the formula. The instructor reiterates that the total number of triangles in a figure with 'n' horizontal lines is given by the formula n(n+1)/2. He shows a final example of a triangle with 4 horizontal lines, where the total is 1+2+3+4+5=15. The video ends with a "THANKS FOR WATCHING" screen over a blue, abstract background with mathematical equations.

The video presents a clear, step-by-step method for solving a classic aptitude problem. It starts with a visual pattern of triangles, guides the viewer through the counting process for the first few cases, and then reveals the underlying mathematical formula. The progression from a specific example to a general rule is logical and effective. The use of on-screen diagrams and handwritten annotations makes the explanation easy to follow, demonstrating that a complex counting problem can be solved efficiently using a simple arithmetic series formula.

Loading lesson…