Ask your own question, for FREE!
Discrete Math 12 Online
OpenStudy (anonymous):

. How many different three-letter initials can people have?

OpenStudy (anonymous):

What type of question is this?

OpenStudy (anonymous):

no

OpenStudy (anonymous):

No, it's taking into account the amount of ways 3 letters can be arranged using our 26 letter alphabet.

OpenStudy (anonymous):

Silly me.. Permutations And Combinations.. :)

OpenStudy (anonymous):

:)

OpenStudy (anonymous):

It is talking about "Different" So, Repetition is not allowed, first of all.. :)

OpenStudy (anonymous):

First letter can be filled in 26 ways as all 26 letters are there to choose from.. As you will use one letter for forming first letter, for second letter you will only have 25 ways to choose letters, and in the formation of third letter, you have 24 ways.. So number of ways are: \(26 \times 25 \times 24\)

OpenStudy (anonymous):

thanks my dear :)

OpenStudy (anonymous):

i have one question .may i ask?

OpenStudy (anonymous):

Yes sure.. :)

OpenStudy (anonymous):

How many strings of five ASCII characters contain the character @ (“at” sign) at least once? [Note: There are 128 different ASCII characters

OpenStudy (anonymous):

I am unable to see the letters.. What have you done with letters? :P

OpenStudy (anonymous):

nothing))))

OpenStudy (anonymous):

. How many 5-element DNA sequences a) end with A? b) start with T and end with G?

OpenStudy (anonymous):

ok help this question )))

OpenStudy (anonymous):

In that five string, you are forming a string with 5 ASCII characters.. In that five characters, either 1st or 2nd or 3rd or 4th or 5th place can be @ character..

OpenStudy (anonymous):

And I need some help too.. @sidsiddhartha

OpenStudy (anonymous):

I think it is time to crown Mira.. So, @Miracrown can we get your help here??

OpenStudy (sidsiddhartha):

think of those 5 ascii characters that does'nt contain @ now repetation is also allowed

OpenStudy (sidsiddhartha):

so we can get total \[127^5\] no. of such combinations

OpenStudy (sidsiddhartha):

|dw:1412671654118:dw|

OpenStudy (sidsiddhartha):

now there are \[128^5\] no of strings of 5 ascii characters right? result will be=\[=strings~without~@-strings~with~@\\=128^5-127^5\]

OpenStudy (sidsiddhartha):

ok?

OpenStudy (anonymous):

thanks so much)))

OpenStudy (sidsiddhartha):

for for the second question -- there are 4 possible bases =A,T,G,C so for ending with A|dw:1412672252167:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!