Short Tricks to Solve Dice Sum Problem (2)

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/engineering-mathematics/permutation-and-combination/special-applied-problems/asset-short-tricks-to-solve-dice-sum-problem-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. Paper 2 | 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 Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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
  16. Paper 2 | 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 Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a mathematics lecture that explains how to solve a classic combinatorics problem: finding the number of ways to get a sum of 10 when three dice are thrown. The video begins with a title slide that introduces the topic of permutations and combinations, setting the context for the problem. The instructor then presents the problem statement: 'If three dice are thrown, find the number of ways to get sum 10?'. The core of the lesson involves a methodical approach using the stars and bars technique, but with constraints. The variables x1, x2, and x3 are defined as the values on the three dice, with the equation x1 + x2 + x3 = 10. The constraint 1 ≤ xi ≤ 6 is applied to each variable, as a die cannot show a value less than 1 or more than 6. The instructor demonstrates the standard method for solving such problems by first transforming the variables to remove the lower bound (by setting xi' = xi - 1), which leads to the equation x1' + x2' + x3' = 7. The total number of non-negative integer solutions is calculated as C(7+3-1, 3-1) = C(9,2). To account for the upper bound constraint, the instructor uses the principle of inclusion and exclusion. The method involves subtracting the cases where one or more variables exceed 6. For example, if x1 > 6, a substitution x1'' = x1 - 6 is made, leading to a new equation x1'' + x2' + x3' = 1. The number of solutions for this case is C(1+3-1, 3-1) = C(3,2). Since there are three dice, this case is multiplied by 3. The final answer is the total number of solutions minus the invalid cases: C(9,2) - 3*C(3,2) = 36 - 9 = 27. The video concludes with a general formula for the number of ways to get a sum n with three dice, which is C(n-1,2) - 3*C(n-7,2) for n from 7 to 12, and a final 'Thanks for watching' screen.

Chapters

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

    The video opens with a title slide that introduces the topic of permutations and combinations. The slide is divided into four quadrants, each with a visual metaphor: a green craps table with dice for 'PERMUTATION', a basket of fruit for 'COMBINATION', a pizza for 'COMBINATION', and two men in a business meeting for 'PERMUTATION'. This is followed by a presentation slide titled 'Confused' which poses the question, 'Should I unlock with Permutation or Combination?'. The slide features a cartoon detective with a magnifying glass, standing between two locked doors labeled 'Permutation' and 'Combination', visually representing the confusion between the two concepts. The instructor, Yash Jain, is visible in a small window in the bottom right corner. The slide also includes the 'Knowledge Gate Educator' logo and branding.

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

    The video transitions to a new slide titled 'Dice Sum Problem'. The instructor presents the core problem: 'If three dice are thrown, find the number of ways to get sum 10?'. The instructor begins to set up the mathematical model by defining the variables x1, x2, and x3 as the values on the three dice. The equation x1 + x2 + x3 = 10 is written on the screen. The constraints 1 ≤ x1 ≤ 6, 1 ≤ x2 ≤ 6, and 1 ≤ x3 ≤ 6 are also written, reflecting the possible values on a standard die. The instructor explains that this is a problem of finding the number of integer solutions to this equation under the given constraints.

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

    The instructor explains the method to solve the problem. He first removes the lower bound constraint by substituting xi' = xi - 1, which transforms the equation to x1' + x2' + x3' = 7, where xi' ≥ 0. He then uses the stars and bars method to find the total number of non-negative integer solutions, which is C(7+3-1, 3-1) = C(9,2). He then addresses the upper bound constraint. He explains that the total count includes invalid cases where one of the variables is greater than 6. He demonstrates the inclusion-exclusion principle by calculating the number of invalid cases. For example, if x1 > 6, he substitutes x1'' = x1 - 6, leading to the equation x1'' + x2' + x3' = 1. The number of solutions for this is C(1+3-1, 3-1) = C(3,2). Since there are three dice, this case is multiplied by 3. The final answer is the total number of solutions minus the invalid cases: C(9,2) - 3*C(3,2) = 36 - 9 = 27.

  4. 10:00 – 11:47 10:00-11:47

    The instructor generalizes the solution. He writes the formula for the number of ways to get a sum n with three dice as C(n-1,2) - 3*C(n-7,2) for n from 7 to 12. He explains that this formula accounts for the total number of solutions and subtracts the cases where one of the dice shows a value greater than 6. The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in an orange and white box.

The video provides a clear, step-by-step tutorial on solving a combinatorics problem involving dice. It begins by establishing the context of permutations and combinations, then focuses on a specific problem. The core of the lesson is the application of the stars and bars method to find the number of integer solutions to an equation, with a crucial emphasis on handling constraints. The instructor demonstrates the principle of inclusion and exclusion to subtract invalid cases where a die value exceeds 6. The progression from setting up the problem to applying the formula and generalizing the result provides a comprehensive understanding of the method, making it a valuable resource for students learning combinatorics.

Loading lesson…