Binomial collisions and near collisions
classification
🧮 math.NT
keywords
binomialcoefficientscasescollisionsequalgivealgorithmsalmost
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.