All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
12 digit number (Posted on 2007-01-22) Difficulty: 3 of 5
A 12 digit number is formed using these rules:

* You can only use digits 1,5 and 9 (base 10)
* The number is divisible by 37

Prove that the sum of the digits is not 76

No Solution Yet Submitted by atheron    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Another Approach Comment 2 of 2 |

An equivalent fact will be proven: If a number sums to 76, using the numbers 1, 5, and 9, it can't be divisible by 37. Constructing this number is easier: twice the number of 1s chosen plus the number of 5s chosen must equal 8, filling the remaining spots with 9s.

Thus from this, it can be shown that all are of the form 99999999999999 - 8 terms of 3*10^k (where k is from 0 to 11, and no number is reused more than twice)

Since 999999999999 = 9*3*37*1001001001, it is a multiple of 37. Then we just need to show the removal of the 3*10^k terms can't add up to a mutlple of 37. Thus 30^k mod 37 can equal 3, 30, or 4, since it starts repeating after 4.

We have to add 8 of those terms, but we need to add them in sets of 3 to get the number to be 0 mod 37. Since that is impossible, the resulting number must not be divisible by 37, and if numbers that sum to 76 using 1, 5, and 9 can't be divisible by 37, then numbers using 1, 5, and 9 that are divisible by 37 can't sum to 76.


  Posted by Gamer on 2007-01-23 02:24:04
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information