#help
65 messages · Page 1 of 1 (latest)
Hey, so here do you think the arrangements would involve combinations or permutations?
combinations
9*4!
i think this should be
Ie the scenario
Well, it's a permutation here as order matters
Not q combination
yeah
So how many ways can 9 letters be sorted into 9 slots?
no you can change word order
so not permutation because the order is not important
It is permutation
Cause order matters
Let me give you an example w 3 letters
why
yes
ok
9
The word has 6 letters.
yes
So where's the 9 coming from
but 9 ways you can change s places
What?
and 4! other words
Where is the 9 comint from
10 ways
so by changing s places
How does that bring in a 9 and 10 there's only 6 letters
SXXXXS, SXSXXX, XSXSXX, XXSXSX, XXXSXS, SXXSXX, XSXXSX, XXSXXS, SXXXSX, XSXXXS.
10 ways
Well instead of doing it manually let's do it mathematicall
Mathematically*
Cause manually won't work for larger numbers
so show me
Ok so
Think of this word as 6 empty slots
And you're putting 1 letter into each slot
So that's 6P1
Or 6!
But here an S is repeated, so you have to divide by 2!
That gives us the first answer
6!/2! Or 360
Now for the 2nd, we use the gap method
Since the 2 S's can't be together, let's see how many ways we can permute the leftover 4 letters into 4 slors
Which is 4!
Now with 4 of these slots , there'll be 5 gaps formed
Somethinf like
-x-x-x-x-
And now the S's can be sorted into any of these gaps without being adjacent. Ways of sorting 2 objects into 5 slots where order does matter is 5P3. Here we divide by 2! Again as the S's are repeated. Now we use fcp and multiply these 2 answrrs
So our final answer for the 2nd part should be (4!)(5!/(3!2!))
so wrong answer
no restrictions 6!/2 permutations = 360
SS together 5! = 120
no SS together 6!/2 - 5! = 240
.solved