Aart Blokhuis, Andries Brouwer, Benne de Weger
Published 2017-07-21Version 1
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.
Necessary conditions for binomial collisions
Large Galois groups with applications to Zariski density
Diophantine equations coming from binomial near-collisions
![QR code for arXiv:1707.06893 [math.NT]](http://oss.arxitics.com/images/favicon.svg)