SHORT TRICK To Apply Alligation Rule on 3 Ingredients

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/mixture-and-alligation/three-ingredient-mixtures-and-mixture-of-mixtures/asset-short-trick-to-apply-alligation-rule-on-3-ingredients 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, Cloud Computing
  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, presented by Yash Jain, is a tutorial on solving mixture and alligation problems, specifically focusing on the application of the alligation rule for three ingredients. The video begins with an introduction to the topic, followed by a detailed explanation of the weighted average formula for mixtures. The core of the lesson is a worked example: determining the ratio in which three types of sugar costing Rs. 10, Rs. 12, and Rs. 16 per kg should be mixed to achieve a mixture costing Rs. 13 per kg. The instructor demonstrates the alligation method by first pairing the ingredients (10 and 16, 12 and 16) with the mean price (13), calculating the differences (3 and 3, 1 and 3), and then combining these ratios to find the final ratio of 1:3:2. The video concludes with a summary of the solution and a thank you message.

Chapters

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

    The video opens with an animated title card featuring a cartoon scientist in a lab, with the word "MIXTURE" displayed at the bottom. This transitions to a presentation slide with a geometric background, introducing the topic "MIXTURES & ALLIGATIONS" and crediting the instructor, Yash Jain. The instructor, visible in a small window, begins to explain the concept of alligation, writing "Price A", "Price B", and "Mean Price" on the screen to establish the basic framework for the problem.

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

    The instructor continues to build the theoretical foundation. He writes the formula for the weighted average of a mixture: x̄ = (n₁x₁ + n₂x₂ + n₃x₃) / (n₁ + n₂ + n₃), where x̄ is the mean price and nᵢ are the quantities. He then introduces the problem: to find the ratio of three types of sugar costing Rs. 10, Rs. 12, and Rs. 16 per kg to make a mixture costing Rs. 13 per kg. He visually represents the prices on a number line, showing that 13 lies between 10 and 16, and between 12 and 16, setting up the alligation process.

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

    The instructor applies the alligation rule. He first pairs the cheapest (10) and the most expensive (16) sugar with the mean price (13). He calculates the difference: 13 - 10 = 3 and 16 - 13 = 3, resulting in a ratio of 3:3, which simplifies to 1:1. He then pairs the middle-priced sugar (12) with the most expensive (16), calculating 13 - 12 = 1 and 16 - 13 = 3, resulting in a ratio of 1:3. He then combines these two ratios, 1:1 and 1:3, to find the final ratio of the three ingredients, which he determines to be 1:3:2.

  4. 10:00 – 13:42 10:00-13:42

    The instructor verifies the solution by substituting the ratio 1:3:2 back into the weighted average formula. He calculates the total cost as (1*10 + 3*12 + 2*16) = 10 + 36 + 32 = 78, and the total quantity as 1 + 3 + 2 = 6. The mean price is 78/6 = 13, which matches the required price. He concludes the lesson by summarizing the final answer and the method used. The video ends with a "THANKS FOR WATCHING" screen.

The video provides a clear, step-by-step tutorial on solving a three-ingredient alligation problem. It begins by establishing the fundamental formula for a mixture's mean price and then applies the alligation rule by systematically pairing ingredients with the mean price. The instructor's method of breaking down the problem into two separate two-ingredient alligations and then combining the results is a logical and effective approach. The final verification step reinforces the correctness of the solution, making the entire process a comprehensive and practical guide for students.

Loading lesson…