A group divisible design (GDD) is an ordered pair where is a -set of symbols and is a collection of -subsets (called blocks) of satisfying the following properties: the -set is divided into groups of sizes ; each pair of symbols from the same group occurs in exactly blocks in ; and each pair of symbols from different groups occurs in exactly blocks in . In this paper we give necessary conditions on and for the existence of a , along with sufficient conditions for each . Furthermore, we introduce some construction techniques to construct some s when , namely, a and a .