Let p be a prime number.(adsbygoogle = window.adsbygoogle || []).push({});

Let A be an integer divisible by p but B be an integer not be divisible by p.

Let A/B be an integer.

How do I prove that A/B is divisible by p?

This sounds like a simple question but I just can't get it. I'm doing it in relation to proving Fermat's little theorem. (a^p = a mod p for all integers a) I'm trying to understand why the binomial coefficients in the binomial expansion of (1+a)^n are all divisible by p (=0 mod p) for all the terms with powers [1, p-1].

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

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

# Prime number dividing fractions.

Loading...

Similar Threads - Prime number dividing | Date |
---|---|

A Equation with three consecutive prime numbers | Apr 11, 2016 |

Largest Prime Number | Feb 6, 2013 |

A big number modulo a prime | Dec 12, 2012 |

Modulo and prime numbers | Nov 4, 2012 |

Proof that ∏(√n) increments when n is a centered polygonal number with a prime index. | Oct 15, 2012 |

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