Article contents
On the prime factorization of binomial coefficients
Published online by Cambridge University Press: 09 April 2009
Abstract
For positive integers n and k, with n≥2k, let , where each prime factor of u is less than k, and each prime factor of v is at least equal to k. It is shown that u<v holds with just 12 exceptions, which are determined. If
, where each prime factor of U is at most equal to k, and each prime factor of V is greater than k, then U<V holds with at most finitely many exceptions, 19 of which are determined. It is conjectured that there are no others.
- Type
- Research Article
- Information
- Journal of the Australian Mathematical Society , Volume 26 , Issue 3 , November 1978 , pp. 257 - 269
- Copyright
- Copyright © Australian Mathematical Society 1978
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151016105420290-0671:S1446788700011770_inline1.gif?pub-status=live)
- 7
- Cited by