Timeline for Reference request: Counting integer sequences in homogeneous linear recurrences
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 30, 2021 at 10:29 | comment | added | rgvalenciaalbornoz | Just in case, for recurrences of degree $1$, $a_{1}x_{n+1}+a_{0}x_{n}=0,x_{0}=b_{0}$, the result is trivial, since the mentioned probability is related to the probability that $a_{1}|a_{0}$ from a set of $(2m)^2$ pairs, which is roughly $\frac{log(2m)}{2m}$ | |
| Jul 30, 2021 at 10:20 | history | edited | rgvalenciaalbornoz | CC BY-SA 4.0 |
edited body
|
| Jul 30, 2021 at 10:15 | comment | added | rgvalenciaalbornoz | Yes, exactly that, but $n$ natural greater or equal than 0. I fix it in the post. | |
| Jul 30, 2021 at 10:13 | history | edited | rgvalenciaalbornoz | CC BY-SA 4.0 |
added 33 characters in body
|
| Jul 30, 2021 at 10:07 | comment | added | Peter Taylor | So the question is: if we fix the $b_i$, how many assignments of the $a_i$ give integer values for all positive and negative $n$? | |
| Jul 30, 2021 at 10:03 | history | edited | rgvalenciaalbornoz | CC BY-SA 4.0 |
added 125 characters in body
|
| Jul 30, 2021 at 9:47 | history | edited | rgvalenciaalbornoz | CC BY-SA 4.0 |
added 2 characters in body
|
| Jul 30, 2021 at 9:35 | history | asked | rgvalenciaalbornoz | CC BY-SA 4.0 |