CAIE S1 2016 June — Question 6

Exam BoardCAIE
ModuleS1 (Statistics 1)
Year2016
SessionJune
TopicPermutations & Arrangements
TypeArrangements with positional constraints

6 Find the number of ways all 9 letters of the word EVERGREEN can be arranged if
  1. there are no restrictions,
  2. the first letter is R and the last letter is G ,
  3. the Es are all together. Three letters from the 9 letters of the word EVERGREEN are selected.
  4. Find the number of selections which contain no Es and exactly 1 R .
  5. Find the number of selections which contain no Es.