The number of permutations of the digits 1, 2, 3, …., 7 without repetition, which neither contain the string 153 nor the string 2467, is _____.
Explanation
Given numbers are 1, 2, 3, 4, 5, 6, 7
So, total number of permutations are 7!=5040
Now total number of permutations having string (153)
=(153),2,4,6,7
⇒n(153)=5!=120
and total number of permutations having string (2467)
=(2467),1,3,5
⇒n(2467)=4!=24
also total permutations having string (153) and (2467)
n(153∩2467)=2!=2
Now n(153∪2467)=120+24−2=142
So, the required no. of permutations are
n(153∩2467)=n(153∪2467)
=Total−n(153∪2467)
=5040−142=4898
Explanation
Given numbers are 1, 2, 3, 4, 5, 6, 7
So, total number of permutations are 7!=5040
Now total number of permutations having string (153)
=(153),2,4,6,7
⇒n(153)=5!=120
and total number of permutations having string (2467)
=(2467),1,3,5
⇒n(2467)=4!=24
also total permutations having string (153) and (2467)
n(153∩2467)=2!=2
Now n(153∪2467)=120+24−2=142
So, the required no. of permutations are
n(153∩2467)=n(153∪2467)
=Total−n(153∪2467)
=5040−142=4898