The correct option is C 3n2−3n+2(3n−1)(3n−2)
Let the sequence of numbers start with the integer m so that the 3n consecutive integers are m,m+1,m+2,m+3,⋯,m+3n−1.
Now they can be classified as m,m+3,m+6,...,m+3n−2,m+2,m+5,m+8,....,m+3n−1.
The sum of the three numbers shall be divisible by 3 if either all the three numbers are from the same row or all the three numbers are from the same row or all the three numbers are from different rows.
The number of ways that the three numbers of ways that the numbers are from different rows is n×n×n=n3
since a number can be selected from each row in n ways.Hence the favourable no.of ways M=3.nC3+n3
And the total number of ways N=3nC3
∴ The required probability =MN=3.nC3+n33nC3=3n2−3n+2(3n−1)(3n−2)