Abstract

The Fibonacci group F(2, 7) has been known to be cyclic of order 29 for about five years. This was first established by computer coset enumerations which exhibit only the result, without supporting proofs. The working in a coset enumeration actually contains proofs of many relations that hold in the group. A hand proof that F(2, 7) is cyclic of order 29, based on the working in computer coset enumerations, is presented here.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call