Jeff is choosing three numbers from the set {1, 2, 3, ..., 12}. How many ways can Jeff choose three numbers, so that no two chosen numbers are consecutive?
