Timeline for Palindromes in the Möbius sequence
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2023 at 8:38 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
Giving Möbius his dots
|
| Feb 16, 2023 at 7:18 | history | edited | domotorp |
edited tags
|
|
| Aug 11, 2018 at 15:58 | comment | added | Wojowu | I believe the answer to the last question is no. Consider a string $11100...01$ with the number of zeros divisible by $4$. For reasons the same as for $1111$ this pattern cannot occur, but removing any character should lead to a string which appears infinitely often (though I can't prove it myself). | |
| Jul 26, 2018 at 5:29 | comment | added | Zach Teitler | @GerryMyerson Fixed. | |
| Jul 26, 2018 at 5:28 | history | edited | Zach Teitler | CC BY-SA 4.0 |
Fixed link to MSE question, cleaned up latex
|
| Jul 25, 2018 at 22:22 | comment | added | Gerry Myerson | The link goes to a question that doesn't seem in any way related. | |
| Jul 25, 2018 at 19:40 | comment | added | Gerhard Paseman | How would you decide among the strings zw, where z is a string of n zeros and w is a shorter string which has been found to exist? I am not holding out hope for a finite classification of forbidden strings. Gerhard "Not Even For Binary Alphabet" Paseman, 2018.07.25. | |
| Jul 25, 2018 at 19:33 | history | asked | user2052 | CC BY-SA 4.0 |