The Todd-coxter coset enumeration algorithm has been used to prove that the group is trivial. This algorithmic proof is used to produce an algebraic proof. In this note a direct proof is given for the more general problem describing the structure of the group with presentation given by 1.1 is used to denote the modulus of an integer, the order of a group and sub-group.