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

Home > Algorithms
Deux Power Divisibility (Posted on 2015-04-12) Difficulty: 3 of 5
N is a positive integer and F(N) denotes the sum of the base ten digits of N.

Derive an algorithm to determine the values of N such that F(2N) is divisible by 10.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: continuation of Jer's table Comment 3 of 3 |
(In reply to continuation of Jer's table by Charlie)

Curiously there are only three values in the 1800's but sixteen in the 1300's. 
Actually in the whole range 1769 to 1892 there are only two.

Something's going on here.  They are certainly not as random as I would have guessed.

  Posted by Jer on 2015-04-12 17:15:52

Please log in:
Remember me:
Sign up! | Forgot password

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

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