Remove the last digit from a number and subtract twice this digit from the new (shorter) number. Show that the original number is divisible by 7 iff this difference is divisible by 7.(adsbygoogle = window.adsbygoogle || []).push({});

I have only the division algorithm and the fact that the integers are closed under addition/multiplication/subtraction to work with plus elementary arithmetic. By the way, all numbers are in base 10

Heres what I've got:

let n be an integer. By the division algorithm I can find an integers c,d s.t. n = 10c + d where 0<= d < 10

The number 10c is n with the last digit removed. We need to show 10c + d is divisble by 7 iff 10c - 2d is divisible by 7

Suppose 10c + d is divisble by 7. Then 10c + d = 7m for some integer m.

using the division algorithm we can find integers e,f st. d = 7e + f where

0<= f < 7

given the restrictions that 0<=d<10 we must have e = 0 or 1.

Here's where I'm stuck. Any suggestions?

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

# Elementary Proof

Loading...

Similar Threads for Elementary Proof | Date |
---|---|

B Proof of elementary row matrix operation. | Jun 6, 2017 |

I Express power sums in terms of elementary symmetric function | Feb 22, 2017 |

Number Theory: Why always elementary proofs? | Feb 1, 2014 |

Elementary published (but possibly flawed) proof of FLT | Jan 26, 2011 |

An Elementary Proof Of Both The Beal Conjecture And Fermat's Last Theorem. | Mar 20, 2009 |

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