Let us divide given 3n numbers (integers) into three sets as follows S1,=1,4,7,...,3n−2 S2=2,5,8,...,3n−1 S3=3,6,9,...,3n
Now, sum of selected (drawn) three numbers will be divisible by 3 if
(i) All the three integers are from same set and their ways are 3C1×nC3
(ii) Drawn three numbers are from different set and their ways arenC1×nC1×nC1=n3 ∴ Favourable number of ways =3×nC3+n3 =3.2.13.n(n−1)(n−2)+n3=23n3−3n2+2n
Again, the total number of ways of drawing three integers out of 3n integers =3nC3=3.2.13n(3n−1)(3n−2)=2n(3n−1)3n−2 ∴ Required Probability=Total waysFavourable ways =n(3n−1)(3n−2)3n3−3n2+2n=(3n−1)(3n−2)3n2−3n+2