On the Number of Ones in General Binary Pascal Triangles

Abstract

This paper answers the question as to whether every natural number $n$ is realizable as the number of ones in the top portion of rows of a general binary Pascal triangle. Moreover, the minimum number $\kappa (n)$ of rows is determined so that $n$ is realizable.