论文信息 - 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.

[1] Benne de Weger,et al. Elliptic binomial diophantine equations , 1999, Math. Comput..

[2] De Weger. A binomial diophantine equation , 1996 .

[3] D. Kane. New bounds on the number of representation of as a binomial coefficient. , 2004 .

[4] H. P. F. Swinnerton-Dyer,et al. Note on a problem of Chowla , 1959 .

[5] D. Singmaster. How often Does an Integer Occur as a Binomial Coefficient , 1971 .

[6] Mou Jie Deng,et al. A NOTE ON THE DIOPHANTINE EQUATION , 2014 .

[7] H. L. Abbott,et al. On the Number of Times an Integer Occurs as a Binomial Coefficient , 1974 .

[8] M. Mignotte,et al. Integral points on hyperelliptic curves , 2008, 0801.4459.

[9] B. D. Weger,et al. Solving elliptic diophantine equations: the general cubic case , 1999 .

[10] G. Faltings. Endlichkeitssätze für abelsche Varietäten über Zahlkörpern , 1983 .

[11] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[12] L. Mordell. On the integer solutions of $y(y+1)=x(x+1)(x+2)$. , 1963 .