Divisibility Patterns within Pascal Divisibility Networks

Abstract

The Pascal triangle is so simple and rich that it has always attracted the interest of professional and amateur mathematicians. Their coefficients satisfy a myriad of properties. Inspired by the work of Shekatkar et al., we study the divisibility patterns within the elements of the Pascal triangle, through its decomposition into Pascal’s matrices, from the perspective of network science. Applying Kolmogorov–Smirnov test, we determine that the degree distribution of the resulting network follows a power-law distribution. We also study degrees, global and local clustering coefficients, stretching graph, averaged path length and the mixing assortative.