BINOMIAL COLLISIONS AND NEAR COLLISIONS

摘要

We describe ecient algorithms to search for cases in which binomial coecients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coecients dier by 1, and give some identities for binomial coecients that seem to be new.