Tag
Combinatorics
- How Many Whole Numbers Are Between 100 and 999?There are 900 whole numbers from 100 through 999. For a uniform random choice, count the numbers meeting the event and divide by 900.
- How to Calculate Card-Matching ProbabilitiesCalculate a card-match probability by defining what counts as a match, then counting favorable outcomes under the stated draw and replacement rules.
- How to Find Probabilities After Moving a Random Ball Between BoxesUse the law of total probability: account for each possible ball transferred, update the box, and combine the event probabilities with the right weights.
- When Should You Use nPr or nCr?Use nPr when order matters and nCr when it does not. Learn how replacement changes the count and how to use these counts in probability.
- What Is the Probability Mike and Joe Sit Next to Each Other?In a random circular arrangement of eight people, Mike and Joe sit next to each other with probability 2/7, or about 28.6%.
- How Many Ways Can Rs. 16 Be Divided Among 4 People?If four distinct people each receive a positive whole-rupee amount, the Rs. 16 can be divided in 455 ways, by stars and bars.
- How Many Combinations Are Possible with Limited Repetitions?Count unordered selections of k items from n types with per-type limits using a generating function or an inclusion-exclusion formula.
- How Many Outcomes Are Possible in a Three-Team Round Robin?In a round robin where three teams each play once and a game can be won by either team or drawn, there are 27 outcome combinations.
- Asymptotics of the Central Binomial CoefficientUsing Stirling’s formula, the central binomial coefficient satisfies C(2n,n) ~ 4^n divided by √(πn), with useful correction terms.
- Why You Cannot Connect 3 Dots to 3 Squares Without CrossingsThe three-dot, three-square puzzle requires drawing K3,3. Euler’s formula shows it needs nine edges, but a planar bipartite graph on six vertices allows at most eight.
- Examples of Open Problems Solved by Short ProofsSee examples where a compact argument settled a mathematical problem, and learn why a short proof can hide a long search or earlier work.
- How to Distribute Identical Stones Among Buckets with LimitsCount distributions of identical stones into distinct buckets with minimum and maximum limits using stars and bars, inclusion-exclusion, or generating functions.
- How to Calculate Probabilities in MinesweeperCalculate a Minesweeper square’s mine probability by counting all mine layouts consistent with clues and the total mine count.
- How Many Ways Can Men and Women Sit Around a Table with No Adjacent Men?For n distinct men and k distinct women seated up to rotation, count the arrangements by placing women first and filling separate gaps.
- How to Count Integers Not Divisible by 5To count integers not divisible by 5, subtract the multiples of 5 from the total; use floor formulas for any interval or digit rule.
- How to Find a Closed Form for an nth Term Using Generating FunctionsTurn a recurrence into a generating function, simplify it, and extract its coefficients to obtain a closed form for the nth term.
- How Many Ways Are There to Eat Lunch?There is no single count without a menu and rules. Define the lunch choices, then use the product rule, sum rule, or permutations as needed.
- How to Find Probabilities in a Box of Red and Black BallsFor a draw without replacement, use combinations to find the probability of a given number of red and black balls, or adapt the method for replacement.
- Can 7 Drinks with 7 Flavors Make Infinite Varieties?With continuously variable proportions, seven flavors produce uncountably many mathematical mixtures; counting only flavor subsets gives 127 nonempty choices.
- How to Solve the Missionaries and Cannibals ProblemSolve the classic three-missionary, three-cannibal river crossing in 11 boat trips, with a step-by-step table and an explanation of the safety rule.
- Can You Draw This Figure Without Lifting the Pen? (Euler Paths)A figure can be drawn in one stroke exactly when it is connected and has 0 or 2 points where an odd number of lines meet. How to check, and where to start.