Runs of Ones in Binary Strings

MaRDI QIDQ6427311zbMATH OpenFDO

Authors F. Balado, G. C. M. Silvestre

Publication date 22 February 2023

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$.

This page was built for publication: Runs of Ones in Binary Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6427311)