Timeline for A curious process with positive integers
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2018 at 17:27 | history | edited | esg | CC BY-SA 4.0 |
indices of T_1, T_2 corrected
|
| Nov 7, 2018 at 17:47 | history | edited | esg | CC BY-SA 4.0 |
more verbose conclusion
|
| Nov 6, 2018 at 19:21 | history | edited | esg | CC BY-SA 4.0 |
remarks on the general case added
|
| Nov 6, 2018 at 19:15 | history | edited | esg | CC BY-SA 4.0 |
remarks on the general case added
|
| Oct 28, 2018 at 17:59 | history | edited | esg | CC BY-SA 4.0 |
numbers corrected
|
| Oct 28, 2018 at 17:56 | comment | added | esg | @robinz16: thanks, I wasn't aware of that (I was guided by the OP's remark that $x_{3n+1}=24n+6$). | |
| Oct 28, 2018 at 11:54 | history | edited | esg | CC BY-SA 4.0 |
typos corrected
|
| Oct 27, 2018 at 7:52 | comment | added | Robin Zhang | This is an interesting formulation! Just to note: this matrix representation is equivalent to the relation $x_{n′} \equiv y_n \pmod 3$ and the modular relation between $y_n$ and $\Delta_{n−1}$ given above. Similarly, the generalization of this should also come from the modular relations $\mod k$ | |
| Oct 26, 2018 at 18:41 | history | answered | esg | CC BY-SA 4.0 |