Timeline for Zeroes of the random Fibonacci sequence
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2020 at 15:05 | history | edited | Denis Serre | CC BY-SA 4.0 |
added 8 characters in body
|
| Sep 1, 2011 at 14:46 | vote | accept | JSE | ||
| Aug 21, 2011 at 23:42 | answer | added | R W | timeline score: 12 | |
| Aug 21, 2011 at 23:24 | answer | added | Gjergji Zaimi | timeline score: 23 | |
| Aug 21, 2011 at 20:23 | answer | added | j.c. | timeline score: 9 | |
| Aug 21, 2011 at 19:38 | comment | added | Gerhard Paseman | Further, the probability of x_{n+d} is zero is bounded below by the probability that x_n is 0 times the probability that y_d is zero for d small and d is the smallest index for which y_k is a general fibonacci sequence and y_d is zero. Perhaps this can be used for a quick and rough estimate. Gerhard "Ask Me About System Design" Paseman, 2011.08.21 | |
| Aug 21, 2011 at 19:29 | comment | added | Gerhard Paseman | Perhaps you would like to include the observation that the nth term is zero implies n is a multiple of 3? Gerhard "Ask Me About System Design" Paseman, 2011.08.21 | |
| Aug 21, 2011 at 19:13 | comment | added | JSE | Oh yeah, sorry, doesn't really matter as this induces a global random sign change. | |
| Aug 21, 2011 at 18:47 | comment | added | user6976 | In Wiki, the first $\pm$ is missing (in the formula for $X_n$)? | |
| Aug 21, 2011 at 18:33 | history | asked | JSE | CC BY-SA 3.0 |