فهرست نشریات علمی دسترسی آزاد ایران

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. We address this open problem by developing an algorithmic approach that leverages several group theoretic properties of such groups. Specifically, we utilize a result of Frobenius and various necessary properties of such groups, combined with Holt and Plesken’s list of finite perfect groups, to systematically examine all finite groups up to a certain order for the desired property. The computational core of our work is implemented using the computer system GAP. We discover two nonisomorphic groups of order 368,640 that exhibit the desired property. Our investigation also establishes that this is the smallest order of such a group. This study provides a positive answer to Problem 17.76 in the Kourovka Notebook. In addition to the algorithmic framework, this paper provides a structural description of one of the two groups found.