Newbetuts
.
New posts in combinatorics
Connections between topology and combinatorics
combinatorics
general-topology
graph-theory
Combinations and Permutations of dice [closed]
combinatorics
Number of distinct nets of dual polyhedra
combinatorics
computational-geometry
polyhedra
Confusion over probability problems
probability
combinatorics
dice
How many sequence of integers ($j_1 , j_2 , . . . , j_k$) are there such that $0 ≤ j_1 ≤ j_2 ≤ . . . ≤ j_k ≤ n$?
combinatorics
inequality
discrete-mathematics
Poker and Combinatorics (Don't Mix): How to solve this problem?
combinatorics
discrete-mathematics
logic
permutations
An upper bound for $\sum_{i = 1}^m \binom{i}{k}\frac{1}{2^i}$?
combinatorics
binomial-coefficients
Prove that $\sum\limits_{k=0}^{m}\binom{m}{k}\binom{n+k}{m}=\sum\limits_{k=0}^{m}\binom{n}{k}\binom{m}{k}2^k$ [duplicate]
combinatorics
summation
binomial-coefficients
The probability of rolling 5 dice ordered or unordered
probability
combinatorics
Musical and combinatorial proof
combinatorics
fibonacci-numbers
music-theory
10-digit numbers with constraints
combinatorics
How to find the sum $\sum_{k=1}^{\lfloor n/2\rfloor}\frac{2^{n-2k}\binom{n-2}{2k-2}\binom{2k-2}{k-1}}{k}$
combinatorics
summation
contest-math
binomial-coefficients
catalan-numbers
$20$ people are sitting around a (circular) table. How many ways can we choose $3$ people, no two of whom are neighbors?
combinatorics
Expected value for advent of code (average case complexity)
probability
combinatorics
computational-complexity
A Curious Binomial Sum Identity without Calculus of Finite Differences
combinatorics
polynomials
binomial-coefficients
interpolation
Any partition of $\{1,2,\ldots,100\}$ into seven subsets yields a subset with numbers $a,b,c,d$ such that $a+b=c+d$. [closed]
combinatorics
functions
elementary-set-theory
problem-solving
pigeonhole-principle
What are generating functions?
combinatorics
generating-functions
Given an array, how to generate all combinations of subset size k?
javascript
algorithm
subset
permutation
combinatorics
If $n\ge m$, then the number of $m$-cycles in $S_n$ is given by $\frac{n(n-1)(n-2)\cdots(n-m+1)}{m}$.
abstract-algebra
combinatorics
permutations
symmetric-groups
Number or regions formed when $n$ points on a circle are joined
combinatorics
discrete-mathematics
induction
Prev
Next