answer in detail please 1. How many words can be created using all of the letter

Question

answer in detail please

1. How many words can be created using all of the letters in the following state names? a. Florida b. Minnesota C. Wisconsin d. Tennessee d. 2. n how many ways can 24 cupcakes be divided among 11 birthday party guests, if every guest must receive at least one cupcake? 3. Use the Binom al Theorem to expand the following: a. (a b) 4. Consider the following set ta, b, c, d a. n how many different orders can n this set be a rranged? b. List a the possible a rrangements of this set in dictionary order c. What is the 15th permutation, that is, the 15th item on the list you created in stepb? d. Write a Pseudocode algorithm for constructing any specified permutation of these four letters, without constructing or referringto he list. Verify that your lgorithm correctly constructs th e 15th permutation that you identified in part c Hint: You may want to start with the example included at the end ofthis document, of a Pseudocode algorithm to identify the kth permutation of a set of 3 objects, and modify it to do4 objects. Or you may do your own from scratch, if you prefer. This example is not the most efficient version, rthe most general, but it does perform correctly in all cases

Explanation / Answer

1)

a) The number of words will be FLORIDA are 7! = 5040 words

b) The number of words will be MINNESOTA are 9!/2! (because of two N present in the world hence has to divide with two otherwise the words formed will be repeated)

c)he number of words will be WISCONSIN are 9!/2!2!2! (because of two N, two I, two S present in the world hence has to divide with two otherwise the words formed will be repeated

d)The number of words will be TENNESSEE are 9!/4!2!2! (because of four E, two S and two N present in the world hence has to divide with two otherwise the words formed will be repeated)

2) Ans:C(n+r-1,r-1)

By theory of permutation and Combination: Take any r-1 positons among n+r-1.

Now see that these r-1 stones divided our total coins in r sets.We can always assign 1st set to 1st beggar , 2nd to 2nd beggar and so on.Thus providing us number of ways to distribute n coins to r beggars.

Here n = 24, r =11 hence number of combinations will be C(34,23)

3)

................1........................
..............1...1..................n...
...........1....2....1..............n=...
........1....3.....3...1...........n=3
.....1....4.....6.....4...1........n=4
...1....5...10....10...5....1....n=5
1....6...15....20...15...6...1..n=6

(A+B)^6 = A^6 + 6(A^5)(B) + 15(A^4)(B^2) + 20(A^3)(B^3) + 15(A^2)(B^4) + 6(A)(B^5) + B^6

(1 + x)7 = 1 + 7x + 21x 2 +35x 3 +35x 4 +21x 5 +7x 6 + x 7

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.