Runs of Ones in Binary Strings
Abstract
We give three different computations of the total number of runs of length i in binary n-strings, and we discuss the connection of this problem with the compositions of n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.