second problem
let m=2n+1.
now for difference(d)=1.
choices are (1,2,3)(2,3,4)...................................(2n-1,2n,2n+1).
ie the no.of choices are=2n-1
now for d=2
choices are (1,3,5),(2,4,6),.....................................(2n-3,2n-1,2n+1)
the choices are =2n-3.
for d =3 the choices are =2n-5.
for d=4 the choices are =2n-7
similarly
for d=n the choices are (1,n+1,2n+1)= 1 choice
now sum of all choices are =1+3+5+7+..................+2n-3+2n-1
=n^2
the probability =no.of possible ways \ totalways
=>n^2\(2n
+1)C3