Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 9,918 of 10,432    |
|    bursejan@gmail.com to All    |
|    Re: lim n->oo problem solvable by CAS on    |
|    24 Jun 18 03:46:41    |
      You see you computed:               f(10000.) is about 0.632223583408565              But we have:               lim n->oo f(n) = 1 - 1/e               = 0.6321205588285576784044762298385...              The closed form solution 1 - 1/e, can it be       produced by some CAS nowaday.              Am Sonntag, 24. Juni 2018 12:40:39 UTC+2 schrieb burs...@gmail.com:       > Well the answer is of the limit of the sums       > quotient would be simple 1 - 1/e. But can a       > CAS on the market do it?       >       > What is so difficult in this problem, that       > human by hand can easily do, to do it       > on the computer.       >       > Am Sonntag, 24. Juni 2018 03:14:16 UTC+2 schrieb Richard Fateman:              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca