Question

Let A be the set of all strings of decimal digits of length five. For example...

Let A be the set of all strings of decimal digits of length five. For example 00312 and 19483 are strings in A.

a. How many strings in A begin with 774?

b. How many strings in A have exactly one 8?

c. How many strings in A have exactly three 6’s?

d. How many strings in A have the digits in a strictly increasing order? For example 02357 and 14567 are such strings, but 31482 and 12335 are not.

Homework Answers

Answer #1

Answer ;

a. Since the string begins with 774, we need to bother about the last two digits.

Each digit has 10 choices and so there are 10 * 10 = 100 such strings.

b. The one 8 can be in any of the 5 places. The remaining 4 places have 94 choices.

Therefore, total number of such strings = 5 * 94 = 32805.

c. The three 6's can occupy their places in 5C3 = (5 4) / (2 1) = 10 ways.

The remaining two digits have 92 = 81 choices.

Total number of such strings = 10 * 81 = 810.

d. The question is actually chosing 5 digits out of 10 without worrying about order (the order is fixed i.e. ascending).

This can be done in 10C5 = 10! / (5! * 5!) = 252 ways.

///Thank you///

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
How many different decimal strings of length 2 (strings of length two where each element of...
How many different decimal strings of length 2 (strings of length two where each element of the string is one of the decimal digits 0-9) are there where no digit can be repeated? How many length 3 decimal strings are there like this. How many length 7 decimal strings are there like this? How many length 11 decimal strings are there like this? Give an example of one of the length 11 strings.
Discrete Math a.) How many bit strings are there of length five or less, not counting...
Discrete Math a.) How many bit strings are there of length five or less, not counting the empty string? b.) How many different three-letter initials with none of the letters repeated can people have? c.) How many different three-letter initials are there that begin with the letter B? d.) How many 5-element DNA sequences end with A? e.) How many bit strings of length nine both begin and end with 1?
1. (4 pts) Consider all bit strings of length six. a) How many begin with 01?...
1. (4 pts) Consider all bit strings of length six. a) How many begin with 01? b) How many begin with 01 and end with 10? c) How many begin with 01 or end with 10? d) How many have exactly three 1’s? 2. (8 pts) Suppose that a “word” is any string of six letters. Repeated letters are allowed. For our purposes, vowels are the letters a, e, i, o, and u. a) How many words are there? b)...
(a) How many 12-bit strings contain exactly five 1's? (b) How many 12-bit strings contain at...
(a) How many 12-bit strings contain exactly five 1's? (b) How many 12-bit strings contain at least nine 1's? .(c) How many 12-bit strings contain at least one 1? (d) How many 12-bit strings contain at most one 1?
Find a regular expression to describe: The set of all strings over the alphabet {a, b,...
Find a regular expression to describe: The set of all strings over the alphabet {a, b, c, d} that contain exactly one a and exactly one b So, for example, the following strings are in this language: ab, ba, cccbad, acbd, cabddddd, ddbdddacccc and the following strings are NOT in this language: a, ccbc, acbcaaacba, acacac, bcbbbbbca, aca, c, d, b
Let S denote the set of all possible finite binary strings, i.e. strings of finite length...
Let S denote the set of all possible finite binary strings, i.e. strings of finite length made up of only 0s and 1s, and no other characters. E.g., 010100100001 is a finite binary string but 100ff101 is not because it contains characters other than 0, 1. a. Give an informal proof arguing why this set should be countable. Even though the language of your proof can be informal, it must clearly explain the reasons why you think the set should...
1. Let D={0,1,2,3,4,5,6,7,8,9} be the set of digits. Let P(D) be the power set of D,...
1. Let D={0,1,2,3,4,5,6,7,8,9} be the set of digits. Let P(D) be the power set of D, i.e. the set of all subsets of D.    a) How many elements are there in P(D)? Prove it!    b) Which number is greater: the number of different subsets of D which contain the digit 7 or the number of different subsets of D which do not contain the digit 7? Explain why!    c) Which number is greater: the number of different...
Let D={0,1,2,3,4,5,6,7,8,9} be the set of digits. Let P(D) be the power set of D ,...
Let D={0,1,2,3,4,5,6,7,8,9} be the set of digits. Let P(D) be the power set of D , i.e. the set of all subsets of D . How many elements are there in P(D) ? Prove it! Which number is greater: the number of different subsets of D which contain the digit 7 or the number of different subsets of D which do not contain the digit 7? Explain why! Which number is greater: the number of different subsets of D which...
Consider strings of length 70, in which each character is one of the letters a, b,...
Consider strings of length 70, in which each character is one of the letters a, b, c. please explain in detail. 1)How many such strings have exactly 1 letter c? please answer with detail. 2)How many such strings have exactly 12 letters c and exactly 30 letters b? 3)How many such strings have exactly 12 letters c or exactly 30 letters b? 4)How many such strings have at least 3 letters c
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length...
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length 4 with repetitions contain A and B. How about without repetitions?