A variation on bisecting the binomial coefficients

Abstract

In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients { n k } k=0,...,n and include a table with the results for all n ≤ 154. Connections with previous work on this topic is included. We conjecture that the probability of having only trivial solutions is 5/6.