Binomial collisions and near collisions

Binomial collisions and near collisions

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2017-10
Hauptverfasser: Blokhuis, Aart, Brouwer, Andries, de Weger, Benne
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Binomial coefficients
Collisions
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422