Article contents
On the scarcity of powerful binomial coefficients
Published online by Cambridge University Press: 26 February 2010
Abstract
Assuming the abc-conjecture, it is shown that there are only finitely many powerful binomial coefficients with 3≤k≤n/2 in fact, if q2 divides , then . Unconditionally, it is shown that there are N1/2+σ(1) powerful binomial coefficients in the top N rows of Pascal's Triangle.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 1999
References
- 1
- Cited by