Doing some how many combinations calculation

Click For Summary

Homework Help Overview

The problem involves calculating the number of distinct permutations of the digits in the number 123215, which consists of six digits, including repeated digits.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the use of permutations and combinations, specifically nCr and nPr, to determine the correct approach for counting arrangements of the digits. There is a focus on how to account for the repeated digits in the calculation.

Discussion Status

Some participants have offered insights into the correct method for calculating permutations with repeated elements, suggesting that the original poster consider the implications of the repeated digits. There is an exploration of how to adjust the calculations to account for these repetitions.

Contextual Notes

The original poster expresses uncertainty about the terminology and the approach to the problem, indicating a need for clarification on the concepts of ordering and selection in permutations.

Compaq
Messages
23
Reaction score
0
Doing some "how many combinations" calculation

Homework Statement



We're given the number 123215.

How many different numbers can we get by changing the order of the digits?

This is a six-digit number, so there are six positions for each digit.


This is an unsorted selection with covering (not sure if that's what you call it in English).



The Attempt at a Solution



I've tried nCr, nPr and pretty much everything that's tryable;) I just can't get it right. I know for a fact that the correct answer is 180.
 
Physics news on Phys.org


Do you know what nCr physically means? Well, it tells you how many ways you can select (without ordering) r different objects, from a set of n objects.

This is not what you have to do here. you have Order the given 6 digits, in order to produce newer numbers.

Order, and selection is done by nPr. Now you have to select and order 6 digits, from a set of 6 digits. So you must use 6P6.

But wait! That only works if all the digits are different. Here there are two 2's and two 1's. Can you account for that?
 


So I'm going to order a set of 6 digits. There are 4 different digits, but two 2s and two 1s. 6 digits total. The order of the 2s and the 1s doesn't matter.

My first guess was 6P4, but that can't be right.
 


Compaq said:
So I'm going to order a set of 6 digits. There are 4 different digits, but two 2s and two 1s. 6 digits total. The order of the 2s and the 1s doesn't matter.

My first guess was 6P4, but that can't be right.

Think it out logically. Let's look at the 1s only. Every number you create will contain these 2 digits whose order you can transpose without affecting the whole number. That means there are exactly two of these meaningless rogue permutations per whole number, so we can count properly by first counting all the permutations pretending each number is distinct and then dividing by 2. Can you see how to get rid of the rest of the rogues pertaining to the two 2s?
 


ahh, so we divide by 2 for the 1s, and then divide by 2 again for the 2s. That gives 180:D

Not really logic to me:S Probability is a weird branch of maths.

And thanks for the help! Appriciated it.
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
Replies
4
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
6
Views
2K
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K