Abstract
In this work, we show that if F is a positive integer, then is a saturated numerical semigroup with Frobenius number F} is a covariety. As a consequence, we present two algorithms: one that computes and another which computes all the elements of with a fixed genus. If for some then we see that there exists the least element of containing X. This element is denoted by If , then we define the -rank of S as the minimum of In this paper, we present an algorithm to compute all the elements of with a given -rank.