what is the proof for divisibility tests in general, and in particular how are they derived.(adsbygoogle = window.adsbygoogle || []).push({});

for example, i know that in base m, if the sum of the digits are a multiple of m-1, then m-1 is a factor. how tests like alternating digits having equal sums found?

does a test exist for every number?

**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!

# Proof for divisability tests

Loading...

Similar Threads - Proof divisability tests | Date |
---|---|

Simple Proof That Division By Zero Is Impossible | Sep 26, 2012 |

Proof of the Order Divisibility Property | Mar 12, 2012 |

Divisibility proof using gcd | Mar 7, 2012 |

Proof of the The Division Algorithm | Aug 28, 2011 |

Proof: integers divisibility property | Nov 14, 2007 |

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