Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2008_06_03_bergman: Bergman proves an explicit lower bound for the gcd of two binomial coefficients in the same row for all 2 <= i < j <= n/2, from which this page deduces at least the square root of n over six; refereed and curator-credited.
Linked from (1)
Graph