arXiv · 1707.06893
Binomial collisions and near collisions
Abstract
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for binomial coefficients that seem to be new.
Explore related subjects
Keep this discovery
Aart Blokhuis, Andries Brouwer, Benne de Weger. 2017-07-21. Binomial collisions and near collisions. https://arxiv.org/abs/1707.06893
Cite the original work for its findings. Save a collection to share your selection of sources.