Surds and Indices Part 4
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
- Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, 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
- SQL (Technical): SQL
- Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks (Technical): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video, presented by Yash Jain Sir from Knowledge Gate Educator, is a tutorial on solving problems involving infinite nested radicals, specifically focusing on surds and indices. The video begins with a worked example demonstrating the simplification of the square root of 2601 by factoring it into prime factors (3x3x17x17), which is then simplified to 3x17, resulting in 51. The main lesson then transitions to a more complex problem: finding the value of the infinite nested radical y = √(3√(9√(3√(9...)))) where the pattern '3, 9' repeats infinitely. The instructor explains that this expression can be rewritten as y = √(3√(3²√(3√(3²...)))). By recognizing the repeating pattern, he sets up the equation y = √(3√(3²y)), which is then squared to eliminate the outermost radical, leading to y² = 3√(3²y). This is further simplified to y² = 3√(9y), and squaring both sides again yields y⁴ = 9 * 9y, or y⁴ = 81y. Dividing both sides by y (assuming y ≠ 0) gives y³ = 81. Since 81 is 3⁴, the equation becomes y³ = 3⁴. The instructor then solves for y by taking the cube root of both sides, resulting in y = 3^(4/3). The video concludes with a similar example using the number 2, where y = √(2√(4√(2√(4...)))) is solved to find y = 2^(4/3). The final frame is a 'Thanks for Watching' screen.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a whiteboard displaying a math problem: √2601 = √(3x3x17x17), which is simplified to 3x17, resulting in 51. The topic is introduced as 'SURDS & INDICES'. The instructor, Yash Jain Sir, then presents a new problem: y = √(3√(9√(3√(9...)))) with the pattern '3, 9' repeating infinitely. He explains that this can be rewritten as y = √(3√(3²√(3√(3²...)))). He sets up the equation y = √(3√(3²y)) and begins to solve it by squaring both sides, leading to y² = 3√(3²y). He then simplifies this to y² = 3√(9y) and squares both sides again to get y⁴ = 9 * 9y, or y⁴ = 81y. He divides by y to get y³ = 81, and since 81 is 3⁴, he writes y³ = 3⁴. He then circles the number 3 and writes '3' below it, indicating the next step is to solve for y.
2:00 – 2:42 02:00-02:42
The instructor continues solving the equation y³ = 3⁴. He explains that to find y, one must take the cube root of both sides, so y = (3⁴)^(1/3) = 3^(4/3). He then presents a similar problem with the number 2: y = √(2√(4√(2√(4...)))) and applies the same method. He rewrites it as y = √(2√(2²√(2√(2²...)))) and sets up the equation y = √(2√(2²y)). He squares both sides to get y² = 2√(2²y), simplifies to y² = 2√(4y), and squares again to get y⁴ = 4 * 4y, or y⁴ = 16y. Dividing by y gives y³ = 16. Since 16 is 2⁴, he writes y³ = 2⁴. He then circles the number 2 and writes '2' below it, indicating the solution is y = 2^(4/3). The video ends with a 'Thanks for Watching' screen.
The video provides a clear, step-by-step demonstration of solving infinite nested radical expressions by leveraging the properties of exponents and indices. The core method involves recognizing the repeating pattern within the radical, which allows the entire expression to be represented as an equation in terms of the variable itself. This self-referential equation is then algebraically manipulated by squaring both sides to eliminate radicals, leading to a polynomial equation that can be solved for the variable. The lesson effectively connects the concepts of surds and indices, showing how to convert radicals into fractional exponents to simplify complex expressions. The progression from a simple numerical example to a more abstract algebraic one reinforces the general applicability of the technique.