Timeline for count the number of fixed-length sequences with a specific condition
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2019 at 8:47 | vote | accept | le4m | ||
| Nov 21, 2019 at 10:07 | history | edited | joriki |
edited tags
|
|
| Nov 21, 2019 at 10:04 | answer | added | joriki | timeline score: 1 | |
| Nov 21, 2019 at 10:02 | history | edited | le4m | CC BY-SA 4.0 |
added 25 characters in body
|
| Nov 21, 2019 at 10:01 | comment | added | le4m | @AsafRosemarin $s$ is a fixed length sequence with its length fixed to be $n$. More precisely, $s \in \{1,\dots, i\}^n$. | |
| Nov 21, 2019 at 9:59 | comment | added | user706912 | If $s$ can contain any integer, there are infinitely many such sequences... I probably did not understand the question | |
| Nov 21, 2019 at 9:55 | history | asked | le4m | CC BY-SA 4.0 |