The correct option is D n(n−1)
Let n=2,
Hence we get first four natural numbers.
Thus the A.P could be
1,2,3
(2,3,4)
Hence 2 ways
Hence (2)(2−1) ways.
Let n=3,
we get first 6 natural numbers.
1,2,3,4,5,6
Hence the A.Ps will be
(1,2,3)
(2,3,4)
(3,4,5)
(4,5,6)
(1,3,5)
(2,4,6)
Hence there will be 6 ways of selecting an A.P
Hence
(3)(3−1) ways.
Thus the number of ways of select 3 numbers in A.P out of first 2n numbers is n(n−1)