Author |
Topic: multiples of 13 (Read 3529 times) |
|
Christine
Full Member
Posts: 159
|
 |
multiples of 13
« on: Aug 3rd, 2013, 12:57pm » |
 Quote  Modify
|
How can you find multiples of 13 such that the sum of digits is divisible by 13?
for example,
247 = 13*19 and 2+4+7 = 13
and generally, how do you find multiples of N such that the sum of digits is divisible by N
|
|
 IP Logged |
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender: 
Posts: 13730
|
|
Re: multiples of 13
« Reply #1 on: Aug 4th, 2013, 7:16am » |
Quote Modify
|
The simplest way to find some multiple of N such that the digits sum to another multiple of N, is imo to find when powers of 10 that are 1 modulo N
So, e.g. 106 % 13 = 1; then find at which interval that reoccurs ( http://en.wikipedia.org/wiki/Euler%27s_totient_function ), so for 13, every (6+12k)th power of 10 is 1 modulo 13
Now we can just pick any number that is a multiple of N and distribute that total over digits; so e.g. for every da and db such that da+db=13, da*1018+db*106 is also a multiple of 13. For example 5000000000008000000; but also (if we use 3 nonzero digits) 8000000000009000000000009000000 and 7000000000004000000000009000000000006000000 (if we use 4), etc
Since 13 and 10 are coprime, you can actually just remove the trailing 0s in this case. Which won't stop this from giving ridiculously large numbers, but it's an easy way to make as many as you want.
|
| « Last Edit: Aug 4th, 2013, 7:21am by towr » |
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
|
RIDDLES SITE
WRITE MATH!
Home 
Help 
Search 
Members 
Login 
Register
Reply
Notify of replies
Send Topic
Print