Eric Rowland
Abstract
Open-access reader
Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients modulo 16 and one about the value of Binomial[n, 2p] modulo n.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients modulo 16 and one about the value of Binomial[n, 2p] modulo n.
Key concepts: Binomial coefficient, Modulo, Mathematics, Binomial (polynomial), Central binomial coefficient, Negative binomial distribution, Binomial theorem, Prime (order theory)