A string is an ordering of letters ILLINOIS a

  • Thread starter look416
  • Start date
  • Tags
    String
In summary, in this conversation, there is a problem involving finding the number of possible strings that can be made from the letters in "ILLINOIS". Part a. can be solved using the partition formula to get a total of 3360 possible strings. For part b., the correct arrangement of Ls and Is must be found, which is only 1 out of 10 of all possible combinations, resulting in 336. In part c., the question is to find the number of strings where one I appears before the L, which is 1 out of 6 of the original arrangements, giving a total of 2016 possible strings.
  • #1
look416
87
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
[itex]\frac{8!}{2!3!1!1!1!}[/itex]
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 [itex]\times[/itex] 3C1 [itex]\times[/itex] 2C1 [itex]\times[/itex] 1C1
need some hints for question 3
 
Physics news on Phys.org
  • #2


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 [tex]\frac{5!}{2!3!}= 10[/tex]
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 [tex]\frac{4!}{2!2!}=6[/tex]
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.
 
  • #3


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:
  • #4


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


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


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
 

FAQ: A string is an ordering of letters ILLINOIS a

What is a string?

A string is a data type in computer programming that represents a sequence of characters, such as letters, numbers, or symbols. It is commonly used to store and manipulate text.

What is an ordering of letters?

An ordering of letters refers to the specific arrangement of characters within a string. In the example given, "ILLINOIS" is the ordering of letters within the string.

What does "ILLINOIS" represent in this string?

In this string, "ILLINOIS" represents a sequence of characters or letters. It does not have any special meaning or significance, but it could potentially represent a word or name in other contexts.

Can a string only contain letters?

No, a string can contain any type of character, including letters, numbers, symbols, and even spaces. It is simply a sequence of characters, regardless of their type.

How is a string different from other data types?

A string is different from other data types because it is a sequence of characters, whereas other data types may represent numbers, Boolean values, or other types of data. Strings are commonly used for storing and manipulating text, while other data types may be used for different purposes.

Back
Top