A string is an ordering of letters ILLINOIS a

  • Thread starter Thread starter look416
  • Start date Start date
  • Tags Tags
    String
Click For Summary

Homework Help Overview

The problem involves determining the number of distinct arrangements of the letters in the string "ILLINOIS," with specific conditions regarding the order of certain letters. The discussion includes various parts: calculating total arrangements, arrangements where each 'L' appears before each 'I', and arrangements where one 'I' appears before an 'L'.

Discussion Character

  • Mixed

Approaches and Questions Raised

  • Participants explore combinatorial methods for counting arrangements, including the use of partition formulas and factorial calculations. Questions arise regarding the interpretation of conditions for parts b and c, particularly about how to account for the order of letters.

Discussion Status

Several participants have shared their reasoning and calculations, with some expressing uncertainty about specific interpretations of the problem. There is an ongoing dialogue about the correctness of approaches and the assumptions made in the calculations, indicating a productive exploration of the topic.

Contextual Notes

Participants are working within the constraints of the problem statement and are questioning the assumptions related to the order of letters in the arrangements. Some confusion exists regarding the interpretation of the conditions for parts b and c, which may affect the calculations.

look416
Messages
87
Reaction score
0

Homework Statement


In this problem a string is an ordering of letters ILLINOIS
a. how many such strings are there
b. in how many strings, such as LSLOINII, does each L appear before each I?
c. In how many strings does one I appear the L?


The Attempt at a Solution


a. this is pretty easy, just using partition formula
\frac{8!}{2!3!1!1!1!}
which is 3360

however, for question 2 and 3 I am not so understand about it
for question 2, considering each L appear before each I, should i conclude them as a partition?
which eventually, leads to 8C5 \times 3C1 \times 2C1 \times 1C1
need some hints for question 3
 
Physics news on Phys.org


For part b. I'd go like this:
Imagine for each string you highlight the Ls and Is.
Eg. ILLINOIS --> ILLII
How many possible dispositions you might get ?
They are \frac{5!}{2!3!}= 10
only one of them is the "good" one (LLIII) so, I'd say only 1 out of 10 of all the possible original combinations is good. That is 3360/10 = 336

Part c.
I assume the correct question is "In how many strings does one I appear before the L?"

The reasoning is pretty the same as before you just have one I stuck at the beginning
ILLII
Then you have to find in how many ways you can reaggange the four remaining letters: LLII
which is similarly as before \frac{4!}{2!2!}=6
So I'd say only 1 out of 6 of the original arrangements (560).

I just tried as you did, don't take my solutions for sure.
 


wow, you open another door for me to see about it, because typically, i still struggle in the ways to determining the correct ways to find the actual answer
thx for teaching me such a nice approach to these problems
 
Last edited:


In part c. there's a mistake:
it must be read 6 out of 10 of all possible original rearrangements:
3360*(6/10) = 2016
 


hmmm, why is it required to be assuming there must be 6 out of 10? i dun get the statement here
 


Well, we can count them, there's not a lot of them.

L: 0
I: 1

1) 00111
2) 01011
3) 01101
4) 01110
5) 10011
6) 10101
7) 10110
8) 11001
9) 11010
10) 11100
 

Similar threads

Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
23
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 29 ·
Replies
29
Views
2K