Complete sets

From MaRDI portal



Abstract: In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem of counting the number of complete subsets of any given set. That is, given any interval of integers mathcalH:=[1,N] and letting mathcalC(N) denotes the complete set counting function, we establish the lower bound mathcalC(N)ggNlogN.












This page was built for publication: Complete sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221060)