Merge Initials Ordered with airSlate SignNow

Merge initials ordered

how many ways can letters be arranged in a word basically word scramble problems these are pretty great problems see them quite a bit and permutation combination and so this would be the problem you've seen most likely in a text book or maybe it's the problem you're having problems with but basically here's what you have how many ways can we rearrange the letters in Mississippi all right well let's not start with that problem let's start with something a little bit easier how many ways can we rearrange the letters in the word Dan so go ahead and pause the video and give this problem a shot how many ways can we rearrange the letters the letters and Dan okay so when you do this you could list them out in this case you know with Mississippi obviously we can't but but this way we can list them out so we can talk about it you could have Dan you could have DNA where D is first then you could have where the a is first so a DN or a and D you could have where the n is first and you could be a nd a or an ad so those are all the ways to rearrange the word Dan and there are six you can count them pretty easy okay so let's think about this though in terms of fundamental counting the fundamental counting principle what I like to do is think of it so you've got three letters in the word Dan okay so if you were to pick the first letter and you haven't picked any debt you have three possibilities for that first space then the second letter since you've picked one you have two possibilities in that space and then your third one you have only one possibility because you've already picked two for the previous so this is three factorial you multiply them out and you end up with you know three factorial which is six three times two times one so this was pretty much like the Shelf if you've ever done the books on a shelf problem and you could look at it in terms of you know if you to beat this problem to death you could look at in in terms of fact that's basically a tree diagram so if you got you can have D a or n as your first choices then if you go down the D well now you can only go a or n and then with each of those last two you there's only one position you could be in here or a here you know so we've got three possibilities with a then you could go D or n which would give you n here and D here and if you go down this route you could have if you start with n you could either have an A here or a D here so this would be D...