Let G be a finite group of order n generated by a and b. Prove or disprove: there is a sequence g1,g2,g3,⋯,g2n such that: (1) every element of G occurs exactly twice, and
(2) gi+1 equals gia or gib for i=1,2,⋯,2n. (interpret g2n+1 as g1.) graph theoryPutnamcollege contests