# Non Consecutive letters

How many ways are there of choosing three different letters from $$\{A,B,C,D,E,F,G,H,I,J\}$$ so that no two of the letters are consecutive?

×