Groups of square-free order, an algorithm

Abstract

An abstract definition of the groups of square-free order is given that leads naturally to a programmable computation of their number. O. Hölder’s alternative description of the groups of square-free order is incidentally derived.