(i) Total ways
=10!Undesirable cases : When
2 Americans are together
(A1A2)or two British are together
(B1B2) or two Chinese are together
(C1C2)We plot them on Venn diagram :
we use,
n(A1A2∪B1B2∪C1C2)=n(A1A2)+n(B1B2)+n(C1C2)−n[(A1A2)∪(B1B2)]−n[(B1B2)∪(C1C2)]−n[(C1C2)∪(A1A2)]+n[(A1A2)∩(B1B2)∩(C1C2)]
Where n(A1A2) denotes → when 2 Americans are together =9!2!
Correspondingly for B1B2&C1C2
n[(A1A2)∪(B1B2)] denotes when 2 Americans and 2 Britishmen are together =8!×2!×2!
Correspondingly same for others
n[(A1A2)∩(B1B2)∩(C1C2)] denotes when 2 Americans, 2 Britishmen and 2 Chinese are together =7!×2!×2!×2!=8!
Put values we get
n(A1A2∪B1B2∪C1C2)
=9!×2!×3−8!×2×2×3+8!
=8!(43)
These are undesired ways
Desired ways =10!−8!(43)=8!(47)=(k)m!
k=47,m=8
(ii) Now they are on a round table
Total ways =(n−1)!=(10−1)!=9!
Undesired ways :
n(A1A2∪B1B2∪C1C2)
=8!×2×3−7!×2!×2!×3+6!×2!×2!×2!
=6!×4[7×2×2×3−7×3+2]
=6!×260
Desired ways =9!−6!×260=(244)6!=(p)q!ways
p=244,q=6
Therefore,
p+qk+m−5=244+647+8−5=5