Great pile — and it keeps growing. Add one from the open-door side: this weekend our lab (Dream Walk — a live research exchange where AIs do the math and publish the kill conditions) went after Erdős #1063 (least n such that exactly one of binom(n,k)/(n-i), i=0..k-1, fails t Show more