Properties of Triangle - Napier's Analogy

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/trigonometry/properties-of-triangle/asset-properties-of-triangle-napiers-analogy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, 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
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture on Napier's Analogy, a set of trigonometric identities for triangles. The instructor begins by writing the title and the first formula, tan(B-C) = (b-c)/(b+c) * cot(A/2), on a digital blackboard. He then proceeds to write the analogous formulas for the other two angles, tan(C-A) and tan(A-B), using a standard triangle notation where angles A, B, C are opposite sides a, b, c respectively. The lecture progresses by drawing a triangle and labeling its vertices and sides. The instructor then fills in the complete set of three formulas, showing the pattern: for any two angles, the tangent of their difference is equal to the ratio of the difference of their opposite sides to the sum of those sides, multiplied by the cotangent of half the third angle. The final formulas are presented as a complete set, demonstrating the symmetry of Napier's Analogies.

Chapters

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

    The video opens with a digital blackboard displaying the title 'Napier's Analogy :'. The instructor writes the first formula: tan(B-C) = (b-c)/(b+c) * cot(A/2). He then writes the second formula, tan(C-A) = (c-a)/(c+a) * cot(B/2), and the third, tan(A-B) = (a-b)/(a+b) * cot(C/2). As he writes, a diagram of a triangle with vertices A, B, C and opposite sides a, b, c is drawn on the right side of the screen. The instructor uses a yellow pen to write the formulas and draw the triangle, and a white pen for the final formulas. The 'KNOWLEDGE GATE' logo is visible in the bottom right corner.

  2. 2:00 – 2:20 02:00-02:20

    The instructor completes the set of Napier's Analogies on the screen. The final formulas are clearly displayed: tan(B-C) = (b-c)/(b+c) * cot(A/2), tan(C-A) = (c-a)/(c+a) * cot(B/2), and tan(A-B) = (a-b)/(a+b) * cot(C/2). The triangle diagram with labeled vertices and sides remains on the right. The instructor has used a yellow pen for the initial writing and a white pen for the final, complete set of formulas, which are now fully visible. The 'KNOWLEDGE GATE' logo is still present in the bottom right corner.

The video systematically presents Napier's Analogies, a fundamental set of trigonometric identities for any triangle. The core concept is the relationship between the tangent of the difference of two angles and the ratio of the difference and sum of their opposite sides, scaled by the cotangent of half the third angle. The lecture follows a clear progression: it introduces the topic, presents the first formula, then derives the other two by analogy, and finally displays the complete, symmetric set of three identities. The use of a standard triangle diagram (A, B, C opposite a, b, c) is crucial for understanding the pattern and application of these formulas.

Loading lesson…