suppose x=(bn,bn-1...b2,b1,b0)base b . show that x is divisible by (b-1)is divisible by the summation of bi, i=0 up to n. (i wish i could find out how to write it in the notation that you guys use on here)(adsbygoogle = window.adsbygoogle || []).push({});

also, i need to show that every bsae 7 palindrome interger w/ an even number of digits is divisible by 8.

what i know so far....

could i show both of these by induction? also, i know that a palindrome is a number that reads forwards and backwards is the same. i.e. 7117=7117 a palindrome. the first one i honestly do not know where to get started, but could induction as i suggest show it? can anyone offer advise?

**Physics Forums | Science Articles, Homework Help, Discussion**

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!

# Homework Help: Palindromes and modulos

**Physics Forums | Science Articles, Homework Help, Discussion**