Short Tricks to Solve Dice Sum Problem (1)

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/general-mental-ability-logical-reasoning/permutation-and-combination/special-applied-problems/asset-short-tricks-to-solve-dice-sum-problem-1 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a mathematics lecture that teaches how to solve problems involving the number of ways dice can sum to a specific value. The instructor begins by introducing the concept of permutations and combinations, using a visual metaphor of a detective trying to unlock a combination lock to explain the difference between the two. The main focus is on a 'Dice Sum Problem' where the goal is to find the number of ways three dice can sum to a given number. The video demonstrates a method using the stars and bars technique, which involves transforming the problem into finding the number of non-negative integer solutions to an equation. The instructor shows the general formula for this, n+r-1Cr, and applies it to the specific case of finding the number of ways to get a sum of 6 with three dice. The solution is derived by setting up the equation x1 + x2 + x3 = 6, where each xi represents the value on a die, and then applying the formula with n=6 and r=3. The video concludes with a similar example for a sum of 5, reinforcing the method. The lecture is presented on a digital whiteboard with the instructor visible in a small window, and the content is from 'Knowledge Gate Eduventures'.

Chapters

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

    The video opens with a title card that visually distinguishes between 'PERMUTATION' and 'COMBINATION' using a casino theme (dice and roulette) and a business theme (fruit basket and office). This is followed by a slide titled 'Confused' which poses the question, 'Should I unlock with Permutation or Combination?'. The slide uses a detective metaphor, showing two locked doors labeled 'Permutation' and 'Combination', to illustrate the difference. The instructor, Yash Jain, is visible in a small window, and the 'Knowledge Gate Educator' logo is present. The video then transitions to a new slide titled 'Dice Sum Problem' with an image of two dice in a hand, setting up the main topic of the lecture.

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

    The instructor presents the first problem: '3 dice are thrown, number of ways they can sum 6?'. He begins to solve it by setting up the equation x1 + x2 + x3 = 6, where x1, x2, and x3 are the values on the three dice. He notes that each die must show a value of at least 1, so x1 ≥ 1, x2 ≥ 1, x3 ≥ 1. To apply the standard formula for non-negative integer solutions, he introduces a substitution: x1' = x1 - 1, x2' = x2 - 1, x3' = x3 - 1. This transforms the equation into x1' + x2' + x3' = 3, where x1', x2', x3' ≥ 0. He then applies the formula for the number of non-negative integer solutions, which is n+r-1Cr, where n is the sum (3) and r is the number of variables (3). He writes the formula as 3+3-1C3, which simplifies to 5C3.

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

    The instructor continues the calculation for the number of ways to get a sum of 6. He writes the formula 5C3 and then calculates it as 5! / (3! * 2!) = (5 * 4) / (2 * 1) = 10. He confirms that there are 10 ways. He then moves to a second example: 'If three dice are thrown, find the number of ways to get sum 5?'. He sets up the equation x1 + x2 + x3 = 5 with x1 ≥ 1, x2 ≥ 1, x3 ≥ 1. He applies the same substitution method, transforming it to x1' + x2' + x3' = 2. He then applies the formula n+r-1Cr with n=2 and r=3, which is 2+3-1C3 = 4C3. He calculates 4C3 as 4! / (3! * 1!) = 4. He concludes that there are 4 ways to get a sum of 5.

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

    The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in white and orange. This is a standard closing slide for the educational content.

The video provides a clear, step-by-step tutorial on solving dice sum problems using combinatorics. It begins by establishing the foundational concept of permutations versus combinations, using a relatable metaphor. The core of the lesson is the application of the stars and bars method to find the number of integer solutions to an equation. The instructor demonstrates a systematic approach: first, setting up the equation for the sum, then adjusting for the constraint that each die must show a value of at least 1 by using a substitution, and finally applying the formula for combinations with repetition. The method is effectively demonstrated with two examples, first for a sum of 6 and then for a sum of 5, reinforcing the technique. The progression from a general problem to a specific, solved example makes the concept accessible for students preparing for competitive exams.

Loading lesson…