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

Home > Numbers
Infinitely Summed NOD Function (Posted on 2024-08-26) Difficulty: 3 of 5
D(n) denotes the number of digits in the positive integer N.

Evaluate:

 ∞
 Σ {(D(n))!}-1
n=1

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 1 of 2
Lets break up the sum by the number of digits.
There are 9 1-digit n, those terms sum to 9/1!
There are 90 2-digit n, those terms sum to 90/2!
In general there are 9*10^(k-1) k-digit n, those terms sum to 9*10^(k-1)/k!

Then the summation can be expressed as sum {k = 1 to inf} 9*10^(k-1)/k!
Factor 10/9 out.  Then we have (10/9) * sum {k = 1 to inf} 10^k/k!
This last summation is the series expansion of e^x evaluated at 10, but starting at the second term.
Then we have (10/9)*(e^10-1) as the answer.

  Posted by Brian Smith on 2024-08-26 09:58:05
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 (2)
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