The correct option is A 3n2−3n+2(3n−1)(3n−2)
Let the consecutive numbers be
x,x+1,x+2,...,x+3n−1
we arrange them in three rows, each consisting of n numbers as follows:
R1:x,x+3,x+6,...,x+3n−3R2:x+1,x+4,x+7,...x+3n−2R3:x+2,x+5,x+8,...,x+3n−1
Sum of three numbers shall be divisible by 3 is all three numbers are from the same row
as one each from R1,R2,R3
The number of selection of 3 numbers from R1 or R2 or R3 is
nC3+nC3+nC3=3nC3=12n(n−1)(n−1)
The number of selection of 1 number from each of R1,R2,R3 is
nC1.nC1.nC1=n3
Thus. the total number as favorable cases
n3+12n(n−1)(n−1)=12n(2n2−3n+2)
The exhaustive number of cases =3nC3=12n(3n−1)(3n−1)
Therefore required probability =3n2−3n+29n2−9n+2