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.)
solution | Comment 3 of 4 |

Edited on February 26, 2007, 11:00 pm
  Posted by hoodat on 2007-02-26 22:58:42

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 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information