Set 6- Important Questions on Logarithms

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/logarithm/solving-logarithmic-expressions-and-equations/asset-set-6-important-questions-on-logarithms 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 is a lecture on logarithms, presented by Yash Jain from Knowledge Gate Eduventures. The video begins with an introduction to the topic, followed by a series of practice problems. The first problem asks for the value of a + b + c given that log a + log b + log c = 0 for non-negative integers a, b, and c. The instructor applies the logarithmic property log m + log n = log(mn) to simplify the equation to log(abc) = 0, which implies abc = 1. Since a, b, and c are non-negative integers, the only solution is a = b = c = 1, leading to a + b + c = 3. The second problem is similar but for integers a, b, and c, with the condition log |a| + log |b| + log |c| = 0. This simplifies to |a||b||c| = 1, meaning the product of their absolute values is 1. The instructor then finds the minimum and maximum possible values of a + b + c by considering the combinations of positive and negative integers whose absolute values multiply to 1. The final problem involves solving for y given log_y(5/7) = -1/3, which is solved by converting the logarithmic equation to its exponential form, y^(-1/3) = 5/7, and then finding y = (7/5)^3 = 343/125. The video concludes with a 'Thanks for watching' screen.

Chapters

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

    The video opens with a title card for a lecture on logarithms by Yash Jain. The main content begins with a problem statement on a yellow background: 'Que: (Set6) For non-negative integers a, b and c, what would be the value of a + b + c if log a + log b + log c = 0.' The instructor, visible in a small window, begins to solve the problem. He first applies the logarithmic property log m + log n = log(mn) to the given equation, writing 'log(abc) = 0' on the screen. He then explains that this implies abc = 1, as log_x(1) = 0 for any base x. He notes that a, b, and c are non-negative integers, so the only way for their product to be 1 is if all three are 1. He writes 'a=1, b=1, c=1' and calculates the sum as 3.

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

    The instructor transitions to the next problem: 'Que: (Set6) For integers a, b and c, what would be the minimum & maximum value respectively of a + b + c if log |a| + log |b| + log |c| = 0.' He explains that the absolute values are used because the logarithm of a negative number is not defined in the real number system. He applies the same logarithmic property to get log(|a||b||c|) = 0, which means |a||b||c| = 1. He then considers the possible integer values for a, b, and c. Since the product of their absolute values is 1, each of |a|, |b|, and |c| must be 1. Therefore, a, b, and c can each be either 1 or -1. To find the minimum sum, he considers the case where all three are -1, giving a sum of -3. To find the maximum sum, he considers the case where all three are 1, giving a sum of 3. He writes 'min = -3' and 'max = 3' on the screen.

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

    The video presents the final problem: 'Que: (Set6) log_y(5/7) = -1/3, find y?'. The instructor begins by explaining that to solve for the base y, he needs to convert the logarithmic equation into its exponential form. He writes the conversion rule: 'log_b(a) = c' is equivalent to 'b^c = a'. Applying this to the problem, he writes 'y^(-1/3) = 5/7'. To solve for y, he takes the reciprocal of both sides, which gives 'y^(1/3) = 7/5'. He then cubes both sides to get 'y = (7/5)^3'. He calculates this as '343/125'. He also notes that the base y must be positive and not equal to 1, which is satisfied by the solution.

  4. 10:00 – 10:34 10:00-10:34

    The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in white and orange. The text is centered on the screen, with 'THANKS' in a large orange box and 'FOR WATCHING' below it in white. A thin orange line is drawn underneath the text. This is a standard closing screen for the educational video.

The video presents a structured lesson on logarithms, progressing from basic properties to more complex problem-solving. It begins with a problem that reinforces the product rule of logarithms and the definition of a logarithm, leading to a simple integer solution. The second problem introduces the concept of absolute values to handle negative numbers, demonstrating how to find the range of a sum under a logarithmic constraint. The final problem applies the fundamental conversion between logarithmic and exponential forms. The progression shows a clear pedagogical flow, moving from foundational concepts to their application in solving for unknowns, which is typical for a mathematics tutorial.

Loading lesson…