Skip to main content
Greg Hurst's user avatar
Greg Hurst's user avatar
Greg Hurst's user avatar
Greg Hurst
  • Member for 8 years, 6 months
  • Last seen more than a week ago
comment
How many random walk steps until the path self-intersects?
I ran $10^9$ simulations over night and the mean stayed at ~$8.886$. Here's a link of the simulation tallies: wolfr.am/C3YsNZmE. The largest run consisted of 98 lines.
comment
How many random walk steps until the path self-intersects?
FWIW I ran this on $10^7$ random configurations and got a mean of ~$8.886$ steps.
comment
Is Mertens function negatively biased?
FWIW, for $n \leq 10^{16}$ there is not much bias. See section 6 here.
comment
comment
comment
When is $ \sigma(n!-1) $ a perfect square?
There are 97 more $n < 1000$ for which we know the full factorization of $n!-1$. They can all be found here and here (the lines without a $\texttt C$ in them have a full factorization). All 97 of these do not give solutions.
comment
When is $ \sigma(n!-1) $ a perfect square?
No more solutions for $n \leq 100$. I found the factorizations here.
awarded
awarded
1 2
3