gap> START_TEST("AutomorphismGroup.tst");
# abelian group
gap> Size(AutomorphismGroup(CyclicGroup(49)));
42
gap> G:=AbelianGroup([2,2,2,5,5,5,49]);
<pc group of size 49000 with 7 generators>
gap> Size(AutomorphismGroup(last));
10499328000
gap> Size(GL(3,2))*Size(GL(3,5))*42;
10499328000
# nilpotent group which is not a p-group
gap> gs:=[ExtraspecialGroup( 27, 3 ), DihedralGroup(32)];
[ <pc group of size 27 with 3 generators>,
<pc group of size 32 with 5 generators> ]
gap> G:=DirectProduct(gs);
<pc group of size 864 with 8 generators>
gap> Size(AutomorphismGroup(G));
55296
gap> Size(AutomorphismGroup(G)) = Product(gs, g->Size(AutomorphismGroup(g)));
true
# solvable group
gap> G:=DihedralGroup(100);
<pc group of size 100 with 4 generators>
gap> AutomorphismGroup(G);
<group of size 1000 with 4 generators>
#
gap> STOP_TEST("AutomorphismGroup.tst");
[ Dauer der Verarbeitung: 0.7 Sekunden
(vorverarbeitet)
]