Let be a finite set of order . A packing design of index and block size is a collection of -element subsets, called blocks, such that every -subset of occurs in at most blocks. The packing problem is to determine the maximum number of blocks, , in a packing design. It is well known that , where is the largest integer satisfying . It is shown here that if and then with the possible exception of .