Abstract
Let $G(n)$ denote the number of (nonisomorphic) groups of order $n$. It is shown here that for large $x$ \[ x^{1.68} \leq \sum \nolimits â_{n \leq x} G(n) \leq {x^2} \cdot \exp \{ -(1 + \mathrm {o}(1)) \log x\log \log \log x/\log \log x\} ,\] where $\sum â$ denotes a sum over square-free $n$. Under an unproved hypothesis on the distribution of primes $p$ with all primes in $p - 1$ small, it is shown that the upper bound is tight.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.