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

Home > Just Math
Lasts a year (Posted on 2011-10-24) Difficulty: 2 of 5
Every 8-digit number structured ABCXABCX, where A,B and C are not necessarily distinct, is divisible by 365 iff X equals either 5 or 0.


No Solution Yet Submitted by Ady TZIDON    
Rating: 3.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Finishing the proof | Comment 2 of 5 |
iff = if and only if.

The first post proves that ABCXABCX is divisible by 365 if it is divisible by 5.  

The "only if" part is not proven, however.  Fortunately, it is obvious. If ABCXABCX is not divisible by 5, then it cannot be divisible by 365, because 5 is a factor of 365.  But it has to be stated to finish the proof in both directions.  So, this paragraph completes the proof started in the first post.


Here's a simple proof that goes in both directions: 

365 = 5 * 73, so ABCXABCX is divisible by 365 iff (if and only if) it is divisible by each of the factors of 365: 5 and 73.

But it is always divisible by 73, because ABCXABCX = ABCX * 10001 = ABCX * 73* 137, so this condition is always met.

Therefore, it is divisible by 365 iff it is divisible by 5, and this is the case iff X is 0 or 5.


  Posted by Steve Herman on 2011-10-24 10:48:52
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information