## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# The Nonabelian Simple Groups $G, |G| < 10^6$--Minimal Generating Pairs

John McKay and Kiang-Chuen Young
Mathematics of Computation
Vol. 33, No. 146 (Apr., 1979), pp. 812-814+s1-s18
DOI: 10.2307/2006317
Stable URL: http://www.jstor.org/stable/2006317
Page Count: 21
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available

## Abstract

Minimal $(k, m, n)$ generating pairs and their associated presentations are defined for all nonabelian simple groups $G, |G| < 10^6$, excepting the family $\mathrm{PSL}(2, q)$. A complete set of minimal $(2, m, n)$ generating permutations of minimal degree is tabulated for these $G$. The set is complete in the sense that any minimal generating pair for $G$ will satisfy the same presentation as exactly one of the listed pairs.

• 812
• 813
• 814
• s1
• s2
• s3
• s4
• s5
• s6
• s7
• s8
• s9
• s10
• s11
• s12
• s13
• s14
• s15
• s16
• s17
• s18