On the number of combinations without certain separations

Abstract: In this paper we enumerate the number of ways of selecting

k

objects from

n

objects arrayed in a line such that no two selected ones are separated by

m - 1, 2 m - 1, ..., p m - 1

objects and provide three different formulas when

m, p g e q 1

and

n g e q p m (k - 1)

. Also, we prove that the number of ways of selecting

k

objects from

n

objects arrayed in a circle such that no two selected ones are separated by

m - 1, 2 m - 1, ..., p m - 1

objects is given by

, where

m, p g e q 1

and

n g e q m p k + 1

.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: On the number of combinations without certain separations