Two binomial coefficient conjectures

Publication date 7 February 2011

Exact enumeration problems, generating functions (05A15) Radix representation; digital problems (11A63) Binomial coefficients; factorials; (q)-identities (11B65)

Abstract: 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.

This page was built for publication: Two binomial coefficient conjectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6223378)