1. Evaluate, showing ALL steps: 71 71 + 215! 413! a) 2. Simplify, showing ALL steps:...

Transcribed Image Text:

1. Evaluate, showing ALL steps: 71 71 + 215! 413! a) 2. Simplify, showing ALL steps: n! (n-2)! b) 10P₂ + P₂ b) (n+2)! (n-1)! a) 3. Find the number of ways of arranging the letters of the word MATCHING if: a. there are no restrictions; - (9) b. the first letter must be M; c. the odd numbered positions must remain unchanged; d. the arrangement must end with NG. 4. In how many ways can the letters in the following words be arranged? a. UNINTERESTING b. SASKATCHEWAN 5. How many seven digit integers are there which include: a. two 3s, three 2s and two 8s? b. four 3s and three 4s? 6. How many integers greater than 200,000 are there using only the digits 1, 1, 1, 2, 2, 3? 7. From a deck of 52 cards, how many different 4 card hands could be dealt with: a. two kings? b. all red cards? c. one card from each suit? 8. A developer will build 12 houses on the same side of Costly Court in a new subdivision. If he has room for two houses modeled on Plan A, four modeled on Plan B and six modeled on Plan C, in how many different ways can he arrange the houses on the street? 9. A committee of students and teachers is being formed to study the issue of student parking privileges. 15 staff and 18 students have expressed an interest in serving on the committee. In how many different ways could a 5 person committee be formed if it must include at least one student and one teacher? 10. How many words can be formed using all the letters of the word SHRINKS if S must be directly in front of H? a. there are no special conditions? b. the marine biologist must speak first? 11. There are 5 speakers scheduled for a seminar on careers. How many different orders of speaking are possible if: c. the electrical engineer and machinist are to speak one after the other? d. the lawyer and doctor are not to follow one another in the program? N 1. Evaluate, showing ALL steps: 71 71 + 215! 413! a) 2. Simplify, showing ALL steps: n! (n-2)! b) 10P₂ + P₂ b) (n+2)! (n-1)! a) 3. Find the number of ways of arranging the letters of the word MATCHING if: a. there are no restrictions; - (9) b. the first letter must be M; c. the odd numbered positions must remain unchanged; d. the arrangement must end with NG. 4. In how many ways can the letters in the following words be arranged? a. UNINTERESTING b. SASKATCHEWAN 5. How many seven digit integers are there which include: a. two 3s, three 2s and two 8s? b. four 3s and three 4s? 6. How many integers greater than 200,000 are there using only the digits 1, 1, 1, 2, 2, 3? 7. From a deck of 52 cards, how many different 4 card hands could be dealt with: a. two kings? b. all red cards? c. one card from each suit? 8. A developer will build 12 houses on the same side of Costly Court in a new subdivision. If he has room for two houses modeled on Plan A, four modeled on Plan B and six modeled on Plan C, in how many different ways can he arrange the houses on the street? 9. A committee of students and teachers is being formed to study the issue of student parking privileges. 15 staff and 18 students have expressed an interest in serving on the committee. In how many different ways could a 5 person committee be formed if it must include at least one student and one teacher? 10. How many words can be formed using all the letters of the word SHRINKS if S must be directly in front of H? a. there are no special conditions? b. the marine biologist must speak first? 11. There are 5 speakers scheduled for a seminar on careers. How many different orders of speaking are possible if: c. the electrical engineer and machinist are to speak one after the other? d. the lawyer and doctor are not to follow one another in the program? N

Answer rating: 100% (QA)

Soluticn 1 S it 21 51 19x9xt 521 21 35 56 iol ... View the full answer