A lower bound on the number of finite simple groups
Let S(n)=|{m<n: there is a (non-cyclic) simple group of order m}|. Investigation of known families of simple groups provides the lower bound S(n)≫n1/4/logn.
Saved in:
Main Author: | Michael E. Mays |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1980-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171280000592 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A note on the exact formulas for certain $2$-color partitions
by: Guadalupe, Russelle
Published: (2024-11-01) -
Arithmetic functions associated with infinitary divisors of an integer
by: Graeme L. Cohen, et al.
Published: (1993-01-01) -
Design and Construction of Simple Periscope.
by: Nuwahereza, Emmanuel
Published: (2024) -
Design and Construction of Simple Periscope.
by: Nuwahereza, Emmanuel
Published: (2024) -
Design and Construction of a Simple Cell Using Acids.
by: Bakuru, Micheal
Published: (2025)