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

Home > Numbers
Summing Digits (Posted on 2007-02-26) Difficulty: 3 of 5
Prove that there is a finite number of values of n that satisfy

n = 4s(n) + 3s(s(n)) + 2s(s(s(n))) + 1

where n is a positive integer and s(n) denotes the sum of the digits of n. Also, determine analytically, all values of n that satisfy the equation.

See The Solution Submitted by Dennis    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts First part | Comment 4 of 5 |
s(n) is logarithmic; at most, 9 times the number of digits of n, that is less than 1+log10(n). For n=1000, the left hand side is (far) greater than the right hand side, and the difference grows with n, so at most there can be 999 possible n values. (I tried 1000 out of hand; it seems a much smaller limit could be set, but that's enough to prove there's a finite number of n values.)
  Posted by Federico Kereki on 2007-02-27 06:52:52
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 (14)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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