Orders for which there exist exactly six or seven groups

Abstract

Much progress has been made on the problem of calculating g(n) for various classes of integers n, where g is the group-counting function. We approach the inverse problem of solving the equations g(n) = 6 and g(n) = 7 in n. The determination of n for which g(n) = k has been carried out by G. A. Miller for 1 k 5.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…