Skip to main content
7 events
when toggle format what by license comment
Oct 16, 2020 at 14:22 vote accept Nick Gill
Oct 2, 2020 at 11:42 comment added Nick Gill @AaronMeyerowitz, Thank you for this. Certainly a proof of that conjecture would be enough to ensure I only look at spheres of radius 1 or n-1.... I must admit, though, that my feeling was that the question I asked should be much easier than this conjecture! I rather fancied I was being a dummy for not seeing a straightforward proof... But perhaps it is a harder problem than I first thought...
Oct 1, 2020 at 23:59 comment added Aaron Meyerowitz With regard to prime divisors of binomial coefficients, $\binom{50}{3}=140^2.$ A conjecture of Erdos and Selfridge is that with this one exception, for $3 \le k \le \frac{n}{2}$, there is a prime $p>k$ which divides $\binom{n}{k}$ but $p^2$ does not.
Oct 1, 2020 at 16:30 history edited Nick Gill CC BY-SA 4.0
edited body
Oct 1, 2020 at 15:15 answer added LeechLattice timeline score: 5
Oct 1, 2020 at 10:12 history edited Nick Gill CC BY-SA 4.0
too many "rathers"
Oct 1, 2020 at 9:31 history asked Nick Gill CC BY-SA 4.0