# A discrete mathematics problem by Kislay Raj

How many ways are there to select $$3$$ numbers from the first $$20$$ positive integers such that no 2 of the selected numbers are consecutive?

×