I am trying to prove (or find a counterexample for) this:(adsbygoogle = window.adsbygoogle || []).push({});

Let n be any positive integer, and m any odd integer, with 1 <= m < 2^n. Also, let B(x,y) denote the binomial coefficient, x! /( y! ( x - y )! ). Then

2^n | B( 2^n , m ).

Any help is welcome.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Binomial coefficient modulo 2^n

Loading...

Similar Threads for Binomial coefficient modulo | Date |
---|---|

Binomial formula for spherical tensors | Aug 26, 2013 |

Why is the Binomial Formula a Derivation? | Feb 7, 2013 |

Binomial theorem | Jul 7, 2011 |

A quick question on coefficient of binomial expansion | Oct 31, 2006 |

Binomial coefficient modulo a prime | Jun 11, 2006 |

**Physics Forums - The Fusion of Science and Community**