Timeline for Number of words in $\{pi,po\}^*$ of length at most 9
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 10, 2018 at 8:10 | vote | accept | Diceble | ||
| Apr 7, 2018 at 9:24 | history | edited | Raphael |
edited tags
|
|
| Apr 7, 2018 at 7:17 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
deleted 1 character in body; edited tags; edited title
|
| Apr 7, 2018 at 7:16 | answer | added | Yuval Filmus | timeline score: 1 | |
| Apr 5, 2018 at 19:48 | comment | added | Diceble | So I have 4,5 building blocks in my case right? | |
| Apr 5, 2018 at 19:36 | comment | added | quicksort | Yes, it's $2^n$. Now, if your building blocks are long two characters rather than just one, a string of $n$ characters contains $n/2$ such blocks. How many strings of length exactly $n$ are there? How can you use that to solve your original problem? | |
| Apr 5, 2018 at 19:34 | comment | added | Diceble | is it 2^n ? sorry if I'm totally wrong, but I just miss something where i proberly would facepalm myself if I found it out. | |
| Apr 5, 2018 at 19:22 | comment | added | quicksort | How many strings of length $n$ made of zeroes and ones are there? | |
| Apr 5, 2018 at 19:15 | comment | added | Diceble | @quicksort and after thinking i would have no idea how to count that... | |
| Apr 5, 2018 at 19:10 | comment | added | Diceble | @quicksort so $pipo$ would be 4 letters then right? | |
| Apr 5, 2018 at 19:04 | history | edited | quicksort | CC BY-SA 3.0 |
latex
|
| Apr 5, 2018 at 19:04 | review | First posts | |||
| Apr 5, 2018 at 19:26 | |||||
| Apr 5, 2018 at 19:03 | comment | added | quicksort | Both $pi$ and $po$ count as two letters for the answer to be correct. Can you count how many strings of length $n$ you can form? | |
| Apr 5, 2018 at 18:59 | history | asked | Diceble | CC BY-SA 3.0 |