Count the total number of groups in the database.
Find the quasisimple perfect groups up to order that are not simple.
Find the quasisimple perfect groups up to order that are not simple, returned as finitely presented groups.
Find the quasisimple perfect groups up to order that are not simple, returned as permutation groups.
Count the number of non-simple, quasisimple perfect groups in the database.
Create an iterator for those groups
Use the iterator to locate an example whose center has odd order.
Find the quasi-simple perfect groups in the database whose center has order equal to .
Find the quasi-simple perfect groups in the database whose center is isomorphic to SmallGroup( 4,2 ).
Take care to recognize the difference between the ID of a group in the perfect groups database and the (normally different!) ID in the small groups database when a group is present in both databases.
For example, the alternating group of degree has ID [ 60, 5 ] in the database of small groups (it is the fifth group of order ) , but ID [60, 1] in the perfect groups database (it is the first perfect group of order ).