SOME APPLICATIONS OF ENUMERATIVE TECHNIQUES

FOR k-SEPARABLE AND k-INSEPARABLE ELEMENTS OF SET X

M. Laisin,  O.C Okoli,  Ujumadu R. N.  and Nsiegbe A. N

Department of Mathematics, Anambra State University Uli, Anambra State, Nigeria.

Email: laisinmark@yahoo.com; odicomatics@yahoo.com

Abstract: We considered applications of r-arrangements of elements of the set X, applied various techniques (Listing, counting and mathematical methods) to obtain the total number of the given r-arrangement. Listing become difficult, if the number of elements of the set X are large ( ) as in some applications that we shall solve by applying the results obtain by Moore and et al. We applied listing, counting and the Enumerative techniques by Moore, and et al to solve the applications.

Keywords: k- inclusion, k- non-inclusion, k-inseparable inclusion, k-inseparable non- inclusion