query: Combinatorics-number of permutations of $m$ A's and at most $n$ B's
positive_passages.docid: 10211
positive_passages.text: Proving that $\sum\limits_{k=0}^{n} {{m+k} \choose{m}} = { m+n+1 \choose m+1 }$
negative_passages.docid: 13860
negative_passages.text: IMO/1981 - Combinatorics
negative_passages.docid: 131863
negative_passages.text: Permutation question on alphabets
negative_passages.docid: 26343
negative_passages.text: Number of certain (0,1)-matrices, Stanley's Enumerative Combinatorics
negative_passages.docid: 17580
negative_passages.text: Combinatorics That Looks Similar to Vandermonde's Identity
negative_passages.docid: 150281
negative_passages.text: Am I on the right track to figure out this combinatorics problem?
negative_passages.docid: 72853
negative_passages.text: What is the number of automorphisms (including identity) for permutation group $S_3$ on 3 letters?
negative_passages.docid: 5801
negative_passages.text: Combinatorial proof help
negative_passages.docid: 101751
negative_passages.text: The number of words that can be made by permuting the letters of _MATHEMATICS_ is
negative_passages.docid: 130614
negative_passages.text: Permutations on word $MISSISSIPPI$.
negative_passages.docid: 123407
negative_passages.text: Combinatorics - binary - very interesting question
negative_passages.docid: 158580
negative_passages.text: Permutation count of AABBC
negative_passages.docid: 26619
negative_passages.text: Permutations of word 'mathematics'
negative_passages.docid: 29678
negative_passages.text: Circular Permutation
negative_passages.docid: 82872
negative_passages.text: Combinatorial proof involving partitions and generating functions
negative_passages.docid: 38809
negative_passages.text: In how many ways can the letters of word $PERMUTATIONS$ be arranged if there are always 4 letters between P and S?
negative_passages.docid: 74730
negative_passages.text: Combinatorial Proof of ${{n}\choose{k}} {{k}\choose{j}} = {{n}\choose{j}} {{n-j}\choose{k-j}}$