Sierpinski's Hypothesis H1

Abstract

Sierpinski's Hypothesis H1, formulated in 1958, is the conjecture that (provided $n\geq 2$), when the first $n^2$ counting numbers, $1, 2,3,\dots n^2$, are arranged in a square, then each row contains at least one prime. This conjecture is particularly interesting in that it subsumes and is stronger than both the Oppermann and Legrendre conjectures. Herein I shall verify Sierpinski's Hypothesis H1 for (at least) the first $n \leq \hbox{10 070 368 414} \approx 10 \hbox{ billion}$ of these Sierpinski matrices. I shall also demonstrate some partial but more general results. For example: Even for arbitrary $n\geq \hbox{10 070 368 414}$ at least one quarter of the rows of the $n$th Sierpinski matrix contain at least one prime. Furthermore, even for arbitrary $n\geq \hbox{10 070 368 414}$ at least the first $\hbox{141 618}$ rows of the $n$th Sierpinski matrix always contain at least one prime. These and related results are obtained largely by using the locations and values of the known maximal prime gaps, the pigeonhole principle, and some recent bounds on the first Chebyshev function.