Timeline for Approximating $\prod_{i=1}^{n-1} (1-ai)$ for large $n$
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2012 at 18:06 | vote | accept | Roger S. | ||
| Aug 15, 2012 at 17:56 | answer | added | Robert Israel | timeline score: 5 | |
| Aug 15, 2012 at 17:40 | comment | added | Roger S. | @Gerhard Paseman, thanks for the good suggestion! I've been trying things a bit like that, but the trouble is that $a$ isn't necessarily small, and I'm looking for some error bounds for the approximation. | |
| Aug 15, 2012 at 17:15 | comment | added | Gerhard Paseman | You could group terms in pairs to get terms like (1 - (n+1)a + ba^2). For small values of a this might help you with your error estimates. Gerhard "Ask Me About System Design" Paseman, 2012.08.15 | |
| Aug 15, 2012 at 17:11 | comment | added | Roger S. | @András Bátkai, that was incredibly sloppy, sorry about that. I've fixed f(x). | |
| Aug 15, 2012 at 17:10 | history | edited | Roger S. | CC BY-SA 3.0 |
edited body; edited title
|
| Aug 15, 2012 at 17:09 | comment | added | András Bátkai | What is the role of $i$ in the product? | |
| Aug 15, 2012 at 16:57 | history | edited | Roger S. | CC BY-SA 3.0 |
added 35 characters in body
|
| Aug 15, 2012 at 16:49 | history | asked | Roger S. | CC BY-SA 3.0 |