Dear GAP Forum Members, Suppose G is a group of a given order n and m is a divisor of n. I am interesting to the problem of computing all subgroups of G of order n. Please notice that if n is enough large, it is not efficient to first compute all subgroups of G and then obtain subgroups of order m. For example I need to the subgroups of order 32 in a group of order 1024. Any suggestions or comments will be highly appreciated.
Regards, Alireza _______________________________________________ Forum mailing list Forum@mail.gap-system.org http://mail.gap-system.org/mailman/listinfo/forum
