A-Level Maths
Courses
Papers
Questions
Search
Courses
LFM Stats And Pure
Permutations & Arrangements
Q3
CAIE S1 2012 June — Question 3
Exam Board
CAIE
Module
S1 (Statistics 1)
Year
2012
Session
June
Topic
Permutations & Arrangements
Type
Selection with type constraints
3
In how many ways can all 9 letters of the word TELEPHONE be arranged in a line if the letters P and L must be at the ends? How many different selections of 4 letters can be made from the 9 letters of the word TELEPHONE if
there are no Es,
there is exactly 1 E ,
there are no restrictions?
This paper
(6 questions)
View full paper
Q1
Q2
Q3
Q4
Q5
Q6