User:
• Matrices
• Algebra
• Geometry
• Funciones
• Trigonometry
• Coordinate geometry
• Combinatorics
 Suma y resta Producto por escalar Producto Inversa
 Monomials Polynomials Special products Equations Quadratic equations Radical expressions Systems of equations Sequences and series Inner product Exponential equations Matrices Determinants Inverse of a matrix Logarithmic equations Systems of 3 variables equations
 2-D Shapes Areas Pythagorean Theorem Distances
 Graphs Definition of slope Positive or negative slope Determine slope of a line Ecuación de una recta Equation of a line (from graph) Quadratic function Posición relativa de dos rectas Asymptotes Limits Distancias Continuity and discontinuities
 Sine Cosine Tangent Cosecant Secant Cotangent Trigonometric identities Law of cosines Law of sines
 Ecuación de una recta Posición relativa de dos rectas Distancias Angles in space Inner product

# Combinations with repetition

An m-combination with repetition allowed, or a multiset of size m, chosen from a set of n elements, is an unordered selection of elements with repetition allowed.

The number of m-combinations with repetition allowed that can be selected from n elements is
C(n + m - 1; m), that is:

There are three flavors of icecream: chocolate, lemon and vanilla. You can have three scoops. How many variations will there be?
Lets use letters for the flavors: {c, l, v}.

Possible selections are:
{c,c,c} {c,c,l} {c,c,v} {c,l,v} {l,l,l} {l,l,c} {l,l,v} {v,v,v} {v,v,c} {v,v,l}

Using the formula:

Enter any numbers n and m you want and the computer will calculate for you the number of combinations with repetition.
Enter n = m =
C(n+m-1,m)=