Timeline for Leap year formula to arbitrary precision
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2022 at 19:29 | comment | added | Anthony Quas | One more thing that I could add is that this shows that the $(a_n)$ arising from the greedy algorithm are strictly increasing. | |
| Oct 29, 2022 at 18:42 | vote | accept | Michael Engelhardt | ||
| Oct 29, 2022 at 18:42 | vote | accept | Michael Engelhardt | ||
| Oct 29, 2022 at 18:42 | |||||
| Oct 29, 2022 at 18:35 | vote | accept | Michael Engelhardt | ||
| Oct 29, 2022 at 18:42 | |||||
| Oct 29, 2022 at 18:35 | comment | added | Michael Engelhardt | ... and we can convince ourselves that the sequence of $a_i $ can't get stuck at unit values. Very nice, thank you! | |
| Oct 26, 2022 at 4:48 | history | answered | Anthony Quas | CC BY-SA 4.0 |