Let G= $ D_8$ be dihedral group of symmetries of square. Find the minimal number of generators for G.
My book directly writes thar answer is 2. In order to do this do we have to remember the group elements and start finding out which pair of elements form generating set of this group. Since it is not cyclic there shoudn't be one element that is generator.