perplexus.info :: Numbers : Summing Digits

Summing Digits (Posted on 2007-02-26)

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.)

Puzzle Thoughts

Comment 5 of 5 |

Only n=10, and n=46, satisfy the given conditions.

Posted by K Sengupta on 2023-02-09 03:22:46

Please log in:

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:


perplexus dot info