How many permutations (when objects are not all distinct) of size k can be created from a set of size N composed of n1, n2,n3,...,nr parts?(adsbygoogle = window.adsbygoogle || []).push({});

When k = N this is easy and is equal to N!/(n1!n2!...nr!)

The following question would be then how many combinations (when objects are not all distinct) of size k can be created from a set of size N composed of n1, n2,n3,...,nr parts?

When all objects are distinct we know that this would be N!/((N-k)!k!)

Looking through the combinatorics section of my statistics book they don't mention these seemingly important situations.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Number of ways

Loading...

Similar Threads - Number ways | Date |
---|---|

I Is this a correct way to describe number sets? | Sep 15, 2016 |

How many ways a number can be written as components sum? | Dec 22, 2015 |

Number of ways in a 3D lattice | Nov 17, 2015 |

Number of ways to fill 3 boxes with 5 balls | Feb 3, 2015 |

Is there a strictly algebraic way of coding "whole number value of"? | Oct 6, 2014 |

**Physics Forums - The Fusion of Science and Community**