Timeline for Computing Lucas sequence for large n
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2021 at 10:27 | vote | accept | huhu roro | ||
| Oct 15, 2021 at 10:27 | answer | added | huhu roro | timeline score: 0 | |
| Oct 7, 2021 at 13:52 | comment | added | Emil Jeřábek | Use matrix powering by repeated squaring (or equivalent recurrences): $\binom{U_n}{U_{n+1}}=M^n\binom01$ and $\binom{V_n}{V_{n+1}}=M^n\binom2P$, where $M=\binom{\ 0\ \ \ 1}{-Q\ P}$. See e.g. en.wikipedia.org/wiki/Lucas_sequence for such properties. | |
| S Oct 7, 2021 at 12:06 | review | First questions | |||
| Oct 7, 2021 at 12:19 | |||||
| S Oct 7, 2021 at 12:06 | history | asked | huhu roro | CC BY-SA 4.0 |