fullerene
Prolific Member
- Local time
- Today 12:50 AM
- Joined
- Jul 16, 2008
- Messages
- 2,156
well... this is borderline science, but doesn't quite fit. I've got this ridiculous math problem due tomorrow, and I have absolutely no idea what to do with it. I figured hell... what better place than somewhere filled with a bunch of NTs. So here it is.
We're supposed to prove that every palindromic number (same value read forwards and backwards), in base 10, with an even number of digits is divisible by 11. Then we have to prove that every integer whose base k representation is palindromic with an even length is divisible by k + 1.
...anyone good at math have any idea what to do about something like that? I don't know where to start... but we're in the chapter on modular arithmetic, if that helps.
We're supposed to prove that every palindromic number (same value read forwards and backwards), in base 10, with an even number of digits is divisible by 11. Then we have to prove that every integer whose base k representation is palindromic with an even length is divisible by k + 1.
...anyone good at math have any idea what to do about something like that? I don't know where to start... but we're in the chapter on modular arithmetic, if that helps.