From Wikipedia, the free encyclopedia
Mathematics desk
< October 19 << Sep | October | Nov >> October 21 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


October 20 Information

Sum of the reciprocals of the subfactorials

What is the sum of the reciprocals of the subfactorials of the integers greater than 1?? (1 subfactorial is 0 and 1/0 is undefined.) Georgia guy ( talk) 15:04, 20 October 2016 (UTC) reply

If I understand derangement rightly, it says that , where that is, bizarrely, a round off to the nearest integer function in brackets. And factorial says that Now I know that we can't say that = e * e1 minus the first two points, because there's that round off to be considered. But can this be a start, if you understand why this round-off happens and can calculate just the remainders to offset them from this sum??? Wnt ( talk) 17:40, 20 October 2016 (UTC) reply
I just looked into this a bit further and found [1] which says that the subfactorial is equal to the "uppercase incomplete gamma function" gamma(n+1, -1)/e. Which is really neat, except that I wish they'da named the function something like Blarf234385(tm), because nothing short of at threat of prosecution seems capable of getting two programs to mean the same thing by a function name with a gamma in it. (Well, alright, that's being facetious; blasphemy is the most satisfying form of profanity) I installed R package 'gsl' and used gamma_inc() and variants, but none of them work for negative values of the second parameter. This was kind of off the topic anyway though, since what seems most relevant is that this has the same /e as above. The factorial n! is equal to the complete gamma function, and so it is simply gamma(n+1) = gamma(n+1, 0)... Wnt ( talk) 04:15, 21 October 2016 (UTC) reply
It converges quickly: I get 1.6382270745053706475428931141511226610635932496444... at n=40. No results found using inverse symbolic calculators. 24.255.17.182 ( talk) 04:13, 21 October 2016 (UTC) reply
From Wikipedia, the free encyclopedia
Mathematics desk
< October 19 << Sep | October | Nov >> October 21 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


October 20 Information

Sum of the reciprocals of the subfactorials

What is the sum of the reciprocals of the subfactorials of the integers greater than 1?? (1 subfactorial is 0 and 1/0 is undefined.) Georgia guy ( talk) 15:04, 20 October 2016 (UTC) reply

If I understand derangement rightly, it says that , where that is, bizarrely, a round off to the nearest integer function in brackets. And factorial says that Now I know that we can't say that = e * e1 minus the first two points, because there's that round off to be considered. But can this be a start, if you understand why this round-off happens and can calculate just the remainders to offset them from this sum??? Wnt ( talk) 17:40, 20 October 2016 (UTC) reply
I just looked into this a bit further and found [1] which says that the subfactorial is equal to the "uppercase incomplete gamma function" gamma(n+1, -1)/e. Which is really neat, except that I wish they'da named the function something like Blarf234385(tm), because nothing short of at threat of prosecution seems capable of getting two programs to mean the same thing by a function name with a gamma in it. (Well, alright, that's being facetious; blasphemy is the most satisfying form of profanity) I installed R package 'gsl' and used gamma_inc() and variants, but none of them work for negative values of the second parameter. This was kind of off the topic anyway though, since what seems most relevant is that this has the same /e as above. The factorial n! is equal to the complete gamma function, and so it is simply gamma(n+1) = gamma(n+1, 0)... Wnt ( talk) 04:15, 21 October 2016 (UTC) reply
It converges quickly: I get 1.6382270745053706475428931141511226610635932496444... at n=40. No results found using inverse symbolic calculators. 24.255.17.182 ( talk) 04:13, 21 October 2016 (UTC) reply

Videos

Youtube | Vimeo | Bing

Websites

Google | Yahoo | Bing

Encyclopedia

Google | Yahoo | Bing

Facebook