In the last post we showed that

and then we used Lucas’ theorem to evaluate the sum modulo .

My initial attempt at evaluating the sum was to note that

where , but then I was stuck. Numerical examples suggested that this sum is in fact divisible by , but I could not think of a way of extending the argument from the last post. Nonetheless, some extensive google search recently revealed that

**Theorem (Fleck, 1913). **For any ,

.

So taking gives the desired claim after noting that

**Fact. **.

*Proof. *Write with . If then the equation is just , and if then it is .

This article contains a proof of Fleck’s result using the identity . Unfortunately I don’t have a good grasp of the theory behind it.

### Like this:

Like Loading...

*Related*

Pingback: Proof of binomial sum fact | Samin Riasat's Blog

Ailish! I was thinking of you not long ago and how wonderful our little group was when you were at the helm. I hope you are well. Thank you for your kind words. I miss the kids and need to hop the train and see if any of them are still around. I miss Derrick, too. What a sweet soul he was.Much lor,vBaebara