How to Calculate the Sum of Factorial Functions Using the Floor Function?

  • Context: Graduate 
  • Thread starter Thread starter camilus
  • Start date Start date
  • Tags Tags
    Sum
Click For Summary

Discussion Overview

The discussion revolves around evaluating the sum of the reciprocal of factorials of the number of digits of integers, denoted as d(n). Participants explore various approaches to simplify or prove the expression for the sum, including the use of series and properties of the exponential function.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes evaluating the sum \(\sum\limits_{n=1}^\infty \frac{1}{d(n)!}\) and asks for patterns in d(n) to simplify the sum.
  • Another participant expresses interest in the problem and mentions a previous miscalculation regarding the closed form of the answer.
  • A claim is made that the sum equals \(\frac{9}{10}(e^{10} - 1)\), with a participant confirming this after correcting their earlier mistake.
  • One participant offers to share their proof, indicating that others are interested in seeing it.
  • A detailed breakdown of the summation is provided, showing how to analytically simplify the expression and derive the final result.
  • Another participant reflects on their earlier approach using the floor function of logarithms and expresses frustration over their method.
  • It is noted that the floor function is integral to defining d(n), with a specific formulation provided.

Areas of Agreement / Disagreement

While some participants agree on the final expression for the sum, there are differing approaches and interpretations regarding the calculation and simplification of the series. The discussion remains unresolved in terms of a consensus on the best method or representation.

Contextual Notes

Participants express uncertainty about the simplification of the series and the implications of using the floor function in defining d(n). There are also references to potential errors in calculations that have not been fully resolved.

camilus
Messages
146
Reaction score
0
Let [tex]d(n)[/tex] denote the number of digits of n in its decimal representation. Evaluate the sum

[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!}[/tex]​
 
Physics news on Phys.org
You got to show some work first, before you we can help you. Can you find any patterns in d(n) that might make this sum more manageable?
 
I like that problem, it's much less dumb than it appears. I'll admit that my first instinct about the closed form for the answer was off by 0.9, so check your work in case you do the same thing I do.
 
[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!}={9 \over 10}(e^{10}-1)[/tex]
 
I got the proof if anyone is interested...
 
Yep, that's it. I initially forgot to subtract the 1, thus my error of 0.9 mentioned above.
 
camilus said:
I got the proof if anyone is interested...
yeap, i would be glad to see it!
 
Let [tex]d(n)[/tex] denote the number of digits of [tex]n[/tex] in its decimal representation. Evaluate the sum

[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!}[/tex]​

SOLUTION:


The actual summation of [tex]\frac{1}{d(n)!}[/tex] looks like

[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!} = \frac{1}{1!} + \cdots \frac{1}{2!} + \cdots \frac{1}{3!} + \cdots[/tex]​

This can be analytically simplified to

[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!} = 9(\frac{1}{1!}) + 90(\frac{1}{2!}) + 900(\frac{1}{3!}) + 9000(\frac{1}{4!}) + \cdots[/tex]​

after collecting terms and simplyfing to a summation, the result is

[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!} = 9(\frac{1}{1!}) + 90(\frac{1}{2!}) + 900(\frac{1}{3!}) + 9000(\frac{1}{4!}) + \cdots = 9\sum\limits_{n=0}^\infty \frac{10^n}{(n+1)!}[/tex]​

Adding all the terms would give us [tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!} = 9\sum\limits_{n=0}^\infty \frac{10^n}{(n+1)!} = 19822.91922[/tex]

My intuituion tells me that there should be a more simple representation for [tex]\sum\limits_{n=0}^\infty \frac{10^n}{(n+1)!}[/tex].

Now by definition
[tex]e^x = \sum_{n = 0}^{\infty} {x^n \over n!} = 1 + x + {x^2 \over 2!} + {x^3 \over 3!} + {x^4 \over 4!} + \cdots[/tex]​

dividing by x gives us

[tex]{e^x\over x} = {1 \over x}\sum_{n = 0}^{\infty} {x^n \over n!} = {1 \over x}[1 + x + {x^2 \over 2!} + {x^3 \over 3!} + {x^4 \over 4!} + \cdots] = 1 + {1 \over x} + {x \over 2!} + {x^2 \over 3!} + {x^3 \over 4!} + \cdots[/tex]​

Now the series [tex](1 + {1 \over x} + {x \over 2!} + {x^2 \over 3!} + {x^3 \over 4!} + \cdots)[/tex] can be rewritten as [tex]\sum_{n = 0}^{\infty} {x^n \over (n+1)!} + {1 \over x}[/tex].

So [tex]{e^x\over x} = \sum_{n = 0}^{\infty} {x^n \over (n+1)!} + {1 \over x}[/tex], and solving for [tex]\sum_{n = 0}^{\infty} {x^n \over (n+1)!}[/tex] gives us

[tex]\sum_{n = 0}^{\infty} {x^n \over (n+1)!} = {e^x \over x} - {1 \over x} = {e^x - 1 \over x}[/tex]​

Substituting gives us

[tex]\sum\limits_{n=1}^\infty \frac{1}{d(n)!} = 9\sum\limits_{n=0}^\infty \frac{10^n}{(n+1)!} = 9[{e^{10} -1 \over 10}] = {9 \over 10}(e^{10} - 1)[/tex] which indeed equals [tex]19822.91922[/tex].

So in conclusion:

[tex]\huge \sum\limits_{n=1}^\infty \frac{1}{d(n)!} = {9 \over 10}(e^{10} - 1)[/tex]​
 
I was doing stupid things :(
I wrote d(n) as the floor function of [itex]log_{10} n[/itex] and tried some magic with that >.< I thought i had a good idea :(
 
  • #10
the floor function is used to define this function.

[tex]d(n) = floor({ln (n) \over ln (10)}) + 1[/tex]
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 10 ·
Replies
10
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K