Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
bintang
Group Title
how many different string can be made from the word PEPPERCORN when all letters are used and such strings do not contain the substring CON?
 one year ago
 one year ago
bintang Group Title
how many different string can be made from the word PEPPERCORN when all letters are used and such strings do not contain the substring CON?
 one year ago
 one year ago

This Question is Closed

Edutopia Group TitleBest ResponseYou've already chosen the best response.0
im interested in seeing how this one is done!
 one year ago

sumanth4phy Group TitleBest ResponseYou've already chosen the best response.3
no of different strings that can be made from the word PEPPERCORN are \[10!/(3!*2!)\] as there are 10 letters with one letter being repeated thrice and one leter being repeated twice No of strings with sub string CON are \[8!/(3!*2!)\] as there are 8 letters (consider whole CON as one letter or unit) and P repeated thrice and E repeated twice Hence no of different strings without the substring CON are \[10!/(3!*2!)  8!/(3!*2!)\]
 one year ago

Edutopia Group TitleBest ResponseYou've already chosen the best response.0
where did you get the (3!*2!)?
 one year ago

bintang Group TitleBest ResponseYou've already chosen the best response.0
okay i get it :) thanks... 3! and 2! is from the letters which are repeated right
 one year ago

sumanth4phy Group TitleBest ResponseYou've already chosen the best response.3
yup...10! is assuming all the letters are different but our word has three P's which when interchanged do not change the arrangement but have been in included in the 10! as different arrangements...now no of times the each unique arrangement is reapeated is equal to no of times the 3 P's have been interchanged or permuted among themselves. That is 3! hence divide by 3!. Like wise 2! for E's
 one year ago

bintang Group TitleBest ResponseYou've already chosen the best response.0
and why must be 8!, i know 8 is from the prob of CON in string with length 10, and we substract it..hm..why?
 one year ago

kropot72 Group TitleBest ResponseYou've already chosen the best response.0
@sumanth4phy There are two letter Rs in PEPPERCORN.
 one year ago

sumanth4phy Group TitleBest ResponseYou've already chosen the best response.3
Imagine gluing all the letters of CON togetehr as single unit. Now we have the letters "P, E, P, P, E, R, CON" we should not count CON as three letters but one as we need permutations where CON is clubbed hence 8! CON has to exist as substring which implies u cant treat C, O, N as individual letters any more. There are fixed with respect to each other only the clubbed substring can be shifted here and there with other letters
 one year ago

bintang Group TitleBest ResponseYou've already chosen the best response.0
yeah, i found 2 letters which are repeated twice, R and E, then 1 letter which is repeated thrice, it's P so 8!/(3!2!2!) or 8!/(3!2!) ?
 one year ago

sumanth4phy Group TitleBest ResponseYou've already chosen the best response.3
yup I have overlooked R's solution is \[10!(3!*2!*2!)  8!/(3!*2!*2!)\]
 one year ago

bintang Group TitleBest ResponseYou've already chosen the best response.0
okay thanks :)
 one year ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.