The Number of Binomial Coefficients Divisible by a Fixed Power of a Prime

There are binomial coefficients for every non-negative integer . Choose a prime number , and split the binomial coefficients into sets according to the highest power of that divides them. This Demonstration uses a combinatorial formula to compute the sizes of these sets. The first set is made up of the binomial coefficients not divisible by .

W.B. Everett, "Number of Binomial Coefficients Divided by a Fixed Power of a Prime," arXiv.org, submitted Oct 8, 2007, http://arxiv.org/abs/0710.1468.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+